Geometry.Net - Math_Discover: Computer Chess

Deep Junior - The Reigning World Computer Chess Champion
Deep Junior The Reigning World computer chess Champion. 1. Brief BIOJunior and its high-end PC version Deep Junior are acknowledged
http://www.x3dworld.com/Entertainment/CI_X3DEvnt_DeepJunior.html

Extractions: Deep Junior - The Reigning World Computer Chess Champion 1. Brief BIO Junior and its high-end PC version Deep Junior are acknowledged to be one of the best computer programs to have ever played the game of chess. Before facing the ultimate challenge of playing world's number one player Garry Kasparov, Deep Junior has gathered all possible titles and achievements of computer chess. It is the Reigning Absolute World Computer Chess Champion - Maastricht July 2002, 7.5/9 http://www.cs.unimaas.nl/Olympiad2002/ It also won the previous World Micro Computer Chess Champion - Maastricht August 2001, 8/9 (no loss) - two full points ahead of all its competition. Its low-end PC version, Junior, also won the World Micro Computer Chamionship in Paris, November 1997, 9.5/11. Junior is a private enterprise of Amir Ban and Shay Bushinsky. Originally an off-hours hobby, in 1993 Ban and Bushinsky joined forces to develop and promote a chess program they called Junior. Originally an amateur program, in 1997 Junior went commercial, and has since been marketed by ChessBase (www.chessbase.com) as a game CD under the labels Junior and Deep Junior. Deep Junior has played many official games against the world's top human players, in regular tournaments as well as in exhibition matches. It is the first program to have ever played in a national chess league (in Israel).
Jyrki Alakuijala's Home Page
A GPLed, complete, but compact ( 3 kloc) chess program in Python (2.0 or later) is downloadable from the site. It has absearch, pondering, complex evaluation, iterative deepening, and a graphical user interface. Searches around 200 nodes per sec on modern hardware.
http://www.kolumbus.fi/jyrki.alakuijala/pychess.html

Extractions: This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation. pythonchess is a computer chess program for human vs. computer games. pythonchess is a complete chess program with alpha-beta search, hashing, pondering, iterative deepening, etc. implemented in Python programming language. Python is well-suited for almost anything else but complex small-grained computation like chess programming. Here is my contribution trying to bend and strecth the limits of Python. This project was started as a Python learning and pair programming exercise with my great friend and colleague, Hannu Helminen. After building an initial chess engine together, I continued refining it, and also added the graphical user interface. The initial concept of this project was to try to find out how clean and simple a chess program could be. As usual, the goal changed during the development and I concentrated more on improving the playing strength, which made the code less obvious. The program is divided into image files, one file for each piece type, separately for both colors, and source files. Two source files are included. board.py includes the user interface, while nchess6.py includes the unit tests and the chess engine. Unfortunately, the piece images are provided as gif files. This is only because tk does not support any patent free image type having the alpha channel.
MAKING COMPUTER CHESS SCIENTIFIC (20-Sep-1998)
MAKING computer chess SCIENTIFIC. Kasparov that the tournament oriented work on computerchess was not contributing as much to the science of AI as it should.
http://www-formal.stanford.edu/jmc/chess.html

Extractions: Up to: Main McCarthy page I complained in my Science review of Monty Newborn's Deep Blue vs. Kasparov that the tournament oriented work on computer chess was not contributing as much to the science of AI as it should. AI has two tools for tackling problems. One is to use methods observed in humans, often observed only by introspection, and the other is to invent methods using ideas of computer science without worrying about whether humans do it this way. Chess programming employs both. Introspection is an unreliable way of determining how humans think, but introspectively suggested methods are valid as AI if they work. Much of the mental computation done by chess players is invisible to the player and to outside observers. Patterns in the position suggest what lines of play to look at, and the pattern recognition processes in the human mind seem to be invisible to that mind. However, the parts of the move tree that are examined are consciously accessible. It is an important advantage of chess as a Drosophila for AI that so much of the thought that goes into human chess play is visible to the player and even to spectators. When chess players argue about what is the right move in a position, they follow out lines of play, i.e. argue explicitly about parts of the move tree. Moreover, when a player is found to have made a mistake, it is almost always a failure to follow out a certain line of play rather than a misevaluation of a final position.
Gargamella
Gargamella is a new Italian winboard chess engine. A free download is available. There are some theory pages about computer chess programming.
http://digilander.iol.it/gargamellachess/index.htm

Extractions: sl="1.3" Gargamella is a new Italian WinBoard chess engine. Download Gargamella and enjoy! ;-) Do you want to build a chess engine too? Read here Nicola Rizzuti Gargamella è un nuovo motore di scacchi per WinBoard. Scaricate Gargamella e divertitevi! ;-) Vuoi costruire un motore anche tu? Guarda la nuova sezione Programming Theory Nicola Rizzuti News I'm very sorry: Gargamella 0.5.0 doesn't work! I was leaving for CIPS 2002 and I was very tired and when I have updated my web site at 3:00 am(!) I selected a bad version of my engine. Now I have updated the Download Section...try to download again and enjoy! NEW RELEASE Gargamella 0.5.0 : Improved page Papers : now about 90 publications available! : aggiornata la sezione Programming Theory con la sezione Domande frequenti : aggiornata la sezione Programming Theory Dal hanno visitato questa pagina: [ Home ] Inside Gargamella History Download Programming Theory ... Link
Review Of Computer Chess Comes Of Age By Monty Newborn (11-May-1998)
Review of computer chess Comes of Age by Monty Newborn. The review appearedin Science on 1997 June 6. There are .html, .dvi, .pdf and .ps versions.
http://www-formal.stanford.edu/jmc/newborn.html
Chess News, Chess Programs And Databases
Chessbase European Site. ChessBase is a multifeatured chess database program.Category Games Board Games Abstract Battle Games Chess SoftwareShredder tops the computer rankings 14.02.2003 When was the last time Fritzdid not occupy the first place in the computer chess ranking lists?
http://www.chessbase.com/

Extractions: The organizers of Dortmund are so organized that they sent out their March 17th press release on March 16th! When you have a tournament this good, you want to get the word out asap. It's a Linares-style double all-play-all with six players: Kramnik, Leko, Anand, Naiditsch, Bologan, and Radjabov. It runs July 31 to August 10. Full press release here. Russian-Belgian GM Mikhail Gurevich used the French to finish a point ahead of an all-star field in Reykjavic, Iceland. His 8/9 score put him out of the reach of big names like Shirov, Adams, and Topalov. His reward was not having to share any of the $10,000 first prize. Results and a selection of games for download and online replay here.
Daily Chess Columns
A short history of computer chess. A short history of computer chess.The first chess machine. In 1769 the Hungarian engineer Baron
http://www.chessbase.com/columns/column.asp?pid=102
Computer Chess / GNU Chess
Contains GNUChess Atari, Chess, computer chess and source code of these for different platforms
http://users.pandora.be/ai/chess/indexGNUChess.html
An Introduction To Computer Chess
computer chess Past to Present. Alejandro LópezOrtiz alopez-o@neumann.uwaterloo.ca1993. UPDATE. Introduction. History of computer chess.
http://se.uwaterloo.ca/~alopez-o/divulge/chimp.html

Extractions: UPDATE In this time of ``intelligent'' cameras, electronic games and coffee-makers it seems strange that at some point many computer scientists thought that computers would never be able to perform nontrivial tasks. Even today, many people are still unaware of what computers can and cannot do. It is sometimes amusing to see a scientist's face light up surprise when shown some computer tools that have been available for over a decade (like computer graphics, symbolic mathematics, etc), and their disillusionment when told that computers still can't efficiently perform some apparently simple tasks (simple for a computer) like finding the optimal route to be followed by a courier delivering packages all over the city. The history of computer chess is plagued by similar under-and-overstatements put forward by laypeople and experts alike. Though chess is an ideal problem for computers to attack. Its aims are clearly defined (to play good chess) and its advancement can be easily measured (player ranking). Computer chess may give a down to earth perspective on what is and is not currently possible with a computer and how much effort it may take to achieve an specific goal in computer development.
Publications Test Suites Misc Links .bishop Computer Chess
.bishop computer chess publications Aske Plaat, Jonathan Schaeffer, Wim Pijls, Ariede Bruin, BestFirst Fixed-Depth Game-Tree Search in Practice , 1995, 7p.
http://www.kozachenko.com/dotbishop/

Extractions: publications test suites misc links .bishop computer chess publications Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin, " Best-First Fixed-Depth Game-Tree Search in Practice Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin, " An Algorithm Faster than NegaScout and SSS* in Practice Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin, " A New Paradigm for Minimax Search Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin, " A Minimax Algorithm Better than Alpha-Beta? No and Yes Herbert A. Simon, Jonathan Schaeffer, " The Game of Chess Jonathan Schaeffer, Paul Lu, Duane Szafron, Robert Lake, " A Re-Examination of Brute-Force Search David A. McAllester, Deniz Yuret, " Alpha-Beta-Conspiracy Search Norbert Klingbeil, Jonathan Schaeffer, " Empirical Results with Conspiracy Numbers Lisa Lister, Jonathan Schaeffer, " An Analysis of the Conspiracy Numbers Algorithm Jonathan Schaeffer, " The History Heuristic and Alpha-Beta Search Enhancements in Practice Alexander Reinefeld, " Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA* Alexander Reinefeld, T.Anthony Marsland, "
Computer Chess History By Bill Wall
computer chess History by Bill Wall. In 1947, Alan Turing of chess. In1950, Alan Turing wrote the first computer chess program. By 1956
http://www.geocities.com/SiliconValley/Lab/7378/comphis.htm

Extractions: In 1947, Alan Turing specified the first chess program for chess. In 1948 the UNIVAC computer was advertised as the strongest computer in the world. So strong, that it could play chess and gin rummy so perfectly that no human opponent could beat it. In 1949 Claude Shannon described how to program a computer and a Ferranti digital machine was programmed to solve mates in two moves. He proposed basic strategies for restricting the number of possibilities to be considered in a game of chess. In 1950, Alan Turing wrote the first computer chess program. By 1956 experiments on a MANIAC I computer (11,000 operations a second) at Los Alamos, using a 6x6 chessboard, was playing chess. This was the first documented account of a running chess program. In 1957 a chess program was written by Bernstein for an IBM 704. This was the first full-fledged game of chess by a computer. The first chess computer to play in a tournament was MacHack VI (PDP-6) written at MIT by Greenblatt. The computer entered the 1966 Massachussets Amateur championship, scoring 1 draw and 4 losses for a USCF rating of 1243. In 1958, a chess program beat a human player for the first time (a secretary who was taught how to play chess just before the game).
Winboard-Overview
120 Winboard engines, with tabulated features, download links. Part of a much larger computer chess site.
http://www.winboardengines.de/html/winboard-overview.html
Maro's Chess Page
The Correspondence Chess Place by John C. Knudsen; MSO Worldwide; KaiLübke Shep's computer chess Site programprogram tests; Macintosh
http://www.geocities.com/CapeCanaveral/Launchpad/2640/chess.htm

Extractions: (German, English, French, Italian, Spanish) Classic Chess (until 1945) de.alt.games.schach general german chess newsgroup gnu.chess GNU chess related newsgroup maus.spiele.schach rec.games.chess.analysis analysis openings/middlegames/endgames rec.games.chess.computer reports/discussion on game servers, databases, software rec.games.chess.misc
Chess - Steve Pribut's Chess Site
Links to chess sites and resources, including software, chess servers, and frequently asked questions.Category Games Board Games Battle Games Chess Directories Latest SSDF Computer Ratings. computer chess Ratings from Selective Search Magazine. ComputerChess Information and FAQs. Search the Site. Search The Site.
http://www.drpribut.com/sports/chess.html

Extractions: Chess News Waitzkin Remembers Mednis December 2002 MIG Starts Chess Ninja Training Subscription based. View free newsletter. The Week In Chess Chessbase General Chess News Chessnews.org Information about US Chess politics. Europe Echecs In French. Tout en francais. Chess Magazines and Articles Chess Offers Young Life Lessons NY Times. December 15, 2002 Chess Columns at Chessbase Mig, Henderson and others. SmartChess Online e-zine with Interviews, Articles, and Some News The Week In Chess Best and Oldest Chess News Weekly On The Net Chessopolis Reviews, Articles Tasc Chess Calandar by Eric van der Schilden New In Chess Magazine - Mostly print magazine and also games for print magazine in several formats.
Arasan
A chess program for Windows.Category Games Video Games Recreation Board Games Freeware Chess If you're interested in computer chess, you might want to check out the followingother free programs Crafty, GNUChess, Little Goliath, The Crazy Bishop
http://www.arasanchess.org/

Extractions: by Jon Dart The latest version is Arasan 6.3, released in January 2003. The Windows version runs on Windows 95 or more recent versions. The Linux version comes in source only, and requires GCC 2.95.2 or higher. Arasan has both a native Windows user interface and a console-based chess engine for use with Winboard or xboard. Arasan includes an opening book with about 32,000 moves. There is also a larger opening book available for separate download. Older versions are still available: Arasan 5.4 (previous version, Windows 95 or higher) Arasan 2.2 (for Windows 3.1). If you have questions or want to report a bug, you can var name='jdart@'; var domain='jdart.best.vwh.net'; document.write( '' + 'email' ) the author. If you're interested in computer chess, you might want to check out the following other free programs: Crafty GNUChess Little Goliath The Crazy Bishop ... Der Bringer , and ExChess . If you want more info about chess programming, you might look at the following sites:
Peter's Computer Chess Page
Peter's Homepage computer chess. Dec 3 2001, Added endgame test suite. March3 2001, Redesign of main computer chess page and tidy up of other pages.
http://homepages.caverock.net.nz/~peter/chess.htm
A Welcome From The President, David Levy
Acknowledging our history and continuing activity, we now detail somecomputerchess achievements. The ICCA, ICGA and computer chess.
http://www.cs.unimaas.nl/icga/organisation/welcome.html

Extractions: Welcome to the website of the ICGA, the global organisation promoting the use of computers in "game" situations. The ICGA contributes to the experience of game- and computer-game playing in the widest sense through education, entertainment and academic research in Artificial Intelligence. Our aims are: Games have historically been a major part of the worlds cultures, perhaps initially as a way of modelling some aspect of our society in a simple and safe way. Today, computer technology is a key force for change: computer game-playing combines these two elements of our world. Computer involvement in game- and model-domains will continue to add value to the human enjoyment of them, as well as creating knowledge and AI techniques which can be used more widely in important areas where complex search is involved. The ICGA contributes by promoting this activity and our members have included many leading figures in Computer Science. The ICGA has developed from and incorporates its roots, the ICCA (International Computer Chess Assoc.), which encouraged and witnessed remarkable progress in computer chess over a period of 25 years. As you will see from this site, the ICGA recognises a wide range of game-domains, each a micro-world presenting a distinct challenge to its players and to the AI community. The ICGA publishes the
Howstuffworks "How Chess Computers Work"
Machine The world is watching as Garry Kasparov takes on computer chess champDeep Junior. Find out how computer chess programs calculate their moves.
http://computer.howstuffworks.com/chess.htm

Extractions: How can a computer play chess? For many people, that is a mind-boggling concept. Chess seems like a distinctly human activity, requiring intelligence and thought, so how can a computer possibly do it? In this edition of HowStuffWorks , we will take a look at this question. What you will find is that computers don't really "play" chess like people do. A computer that is playing chess is not "thinking." Instead, it is calculating through a set of formulas that cause it to make good moves. As computers have gotten faster and faster, the quality of these calculated moves has gotten better and better. Computer chess calculators are now the best chess players on the planet, even though they do it totally blindly. People and Chess If you have ever watched a person first learning to play chess, you know that a human chess player starts with very limited abilities. Once a player understands the basic rules that control each piece, he or she can "play" chess. However, the new player is not very good. Each early defeat comes as something of a surprise "Oh, I didn't think about that!" or "I didn't see that coming!" are common exclamations.
``Scalable Search In Computer Chess'' -- My Latest Book !!
``Scalable Search in computer chess'' My Latest Book !! Author 1589.3 SelfPlay Experiments in computer chess .. 162
http://supertech.lcs.mit.edu/~heinz/node1.html

Extractions: ``Scalable Search in Computer Chess'' My Latest Book !! Author: Ernst A. Heinz Title: ``Scalable Search in Computer Chess'' Subtitle: Algorithmic Enhancements and Experiments at High Search Depths Series: Computational Intelligence (ser. eds. Profs. Bibel and Kruse) Publisher: Vieweg Verlag [268 pages, 31 figures, 57 tables] ISBN: 3-528-05732-7 Please click here to view an image of the cover illustration. Independent reviews of the book by Dr. Dap Hartmann (in English) and Dr. Christian Donninger (in German) were published in the ICCA Journal and the periodical in March /April 2000. Excerpts from these reviews follow below. ``The results of extensive experiments on scalability and performance of game-tree searching have been laid down in this excellent book. [...] I warmly recommend this book to any serious computer-chess enthusiast. The style of writing is very clear, and hardly any programming experience is required to enjoy most of this work. [...] As it is, the book offers good value for the money. [...] Scalable Search in Computer Chess is one of the three best computer-chess books of the decade!''
Cilkchess
The Cilkchess Parallel Chess Program. Announcements. Cilkchess competesin the 1999 World computer chess Championship, June 1420 Cilkchess.
http://supertech.lcs.mit.edu/chess/

Extractions: Computer chess provides a good testbed for understanding dynamic multithreaded computations. The parallelism in computer chess is derived from a dynamic expansion of a highly irregular game tree, which makes computer chess difficult to express, for example, as a data-parallel program. Our chess program helps us investigate how to program this sort of dynamic MIMD-style application. Implementing a state-of-the-art parallel chess program has had a marked influence on the design of Cilk, which is targeted as a platform delivering both high performance and ease of programming. Cilk-5 incorporates inlets and aborts, features that turned out to be indispensible for cleanly expressing the speculative parallelism of a chess program. Writing algorithms such as Jamboree search and Young Brothers Wait has become a joy with Cilk-5. Currently, we are looking further into how speculative parallelism in search algorithms can be expressed efficiently. Cilkchess is a complete rewrite of our previous chess program, *Socrates. It is based on

41-60 of 131 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | Next 20