### Chess Board Representations

Monday, March 10th, 1997This article discusses some alternative ways of representing a chess board with pieces in computer memory.

Read the rest of this entry »This article discusses some alternative ways of representing a chess board with pieces in computer memory.

Read the rest of this entry »A list of computer chess books. Read the rest of this entry »

Tree search is one of the central algorithms of any game playing program. The term is based on looking at all possible game positions as a tree, with the legal game moves forming the branches of this tree. The leaves of the tree are all final positions, where the outcome of the game is known. The problem for most interesting games is that the size of this tree is tremendously huge, something like W^D, where W is the average number of moves per position and D is the depth of the tree, Searching the whole tree is impossible, mainly due to lack of time, even on the fastest computers. All practical search algorithms are approximations of doing such a full tree search.

These pages give an overview of traditional, fixed depth minimax search, with various refinements such as selective extensions and pruning, as used in most modern chess programs. There are other, more experimental, game tree search techniques that take a different approach, like e.g. B* and conspiracy numbers, which I hope to describe at a later time.

Read the rest of this entry »This section lists a number of chess programs. I have only included programs for which sources are available.

Read the rest of this entry »Computer chess related links. Read the rest of this entry »

A collection of general chess links. Read the rest of this entry »