How computers play chess
Parallel algorithms for machine intelligence and vision
Large-scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Monte-Carlo opening books for amazons
CG'10 Proceedings of the 7th international conference on Computers and games
Principled method for exploiting opening books
CG'10 Proceedings of the 7th international conference on Computers and games
| Hi-index | 0.00 |
The best chess programs have reached the level of top players in the human chess world. The so-called opening books, which are databases containing thousands of Grandmaster games, have been seen as a big advantage of programs over humans, because the computers do never forget a variation. Interestingly, it is this opening phase which causes most problems for the computers. Not because they do not understand openings in general, but because the opening books contain too much rubbish. We introduce a heuristic which explores the database during a game. Without that, the computer repeats failures of weaker players. Our contribution presents best practice.