CHESS TREES Sample Clauses

CHESS TREES. A chess game may be considered as a set of positions connected by moves, and a sequence of moves that leads from one position to another. Let’s call this sequence of moves a path. Thus every game may be considered as a path that begins with the starting position and ends at the final one. The same approach may be used for a set of games and even for an entire database, because every database is a set of games. As far as we know, each game is a set of positions connected by paths; consequently, a database may be considered as a set of positions connected by different paths. If one approaches a database from this point of view, it’s quite possible that the same position may occur in several different games but paths leading to this position are different. Likewise, there might be several paths from any position or, in other words, several moves have been played. Therefore, there are two possible approaches: every database may be considered either as a set of games or as a tree, i. e. a set of positions connected by different paths. Rybka & Chess Openings 2009 offers you good tools for operating these chess trees.