Chess-playing programs

Since it is not always obvious why certain pathways are interesting and others not, this is an artificial intelligence problem of more complexity than the well-known chess-playing program problen 26 - where the legal rules are more clearly delineated and "winning" strategies are better known. 

If the chessboard were infinite—that is, played with no borders at all—the game could get very sparse as the pieces quickly disperse through the board. Infinite chess provides an interesting problem for game-playing computer programs, as the programs not only would have to limit the number of moves they look ahead (as usual), but would have to limit their spatial horizon as well. 

One of the great challenges in programming was to build a program that could play chess as well as a master. This was accomplished in 2006, when Vladimir Kramnik, the reigning world champion, was beaten by a computer program called Deep Fritz. 

---