Category Archives: Chess

Last time, we briefly mentioned the high-level differences between Stockfish and Leela Chess. To recap, Stockfish evaluates about 100 million positions per second using rudimentary heuristics, whereas Leela Chess evaluates 40 000 positions per second using a deep neural network … Continue reading →

Neil Bickford has exhaustively searched the space of 5 × 4 sliding-block puzzles* to determine the one with the longest minimal solution. The unique result, which requires a whopping 235 moves, happens to be Bob Henderson’s Gauntlet puzzle: *subject to the … Continue reading →

As promised, here is the remainder of the proof of the Turing-completeness of three-dimensional chess. In the first part, we introduced the rules; in the second part, we built structures to function as logic gates and wires. Counter machines Instead of … Continue reading →

This is the second of a projected three-part series of articles, which will ultimately prove the Turing-completeness of three-dimensional chess. In the first article, I described the basic rules of the game. In this article, I shall show how to … Continue reading →

This is the first of a projected series of articles investigating a natural three-dimensional generalisation of chess. In the first article, I’ll briefly describe the rules and mention previous research in this area. The second article will show how to create a linear-bounded … Continue reading →