ICGA Tournaments

Tournaments between computer programs: chess, draughts, checkers, Go, backgammon, and more
enfrjazhesdept
Home / Programs / GridChess

GridChess

Authors

PersonComment
Kai Himstedt
Ulf Lorenz
Thomas GakschToga parts
Fabien LetouzeyFruit parts
Robert HyattCrafty parts

Participations

TournamentTitleParticipantsScoreGames
Chess, 2007, AmsterdamThird Place127.011
Chess (Blitz), 2007, Amsterdam84.07

Description

Description given in 2007:

GridChess is composed of two major components: 1) The proxy chess engine (Crafty based) performs no tree search itself but has some kind of a master role to control the optimistic pondering with distributed worker clients. As a simplified explanation of optimistic pondering here, one can imagine the worker clients forming a pondering pipeline with expected opponent moves extracting this information from the principal variations provided by the chess engines. 2) Real chess engines (controlled by distributed worker clients), Fruit/Toga based, parallelized with Young Brothers Wait Concept (YBWC). This way a combination of two parallel concepts was realized building the complete GridChess system: The parallel Fruit/Toga base engines using the YBWC may run on high performance clusters, each cluster representing a worker client for the proxy chess engine. Several such clusters are then used for an asynchronous distributed game-tree search with the optimistic pondering method.