
Recent Posts
Subscribe to Complex Projective 4Space
Archives
 September 2021
 July 2021
 June 2021
 May 2021
 February 2021
 January 2021
 December 2020
 November 2020
 October 2020
 September 2020
 August 2020
 July 2020
 June 2020
 May 2020
 June 2019
 May 2019
 March 2019
 November 2018
 September 2018
 July 2018
 June 2018
 May 2018
 April 2018
 March 2018
 February 2018
 November 2017
 October 2017
 November 2016
 May 2016
 March 2016
 February 2016
 December 2015
 September 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 July 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
Recent Comments
 Martin Andersen on The neural network of the Stockfish chess engine
 Danny Winters on Final chapter of MODA
 Ross Presser on Hamming backups: a 2of3 variant of SeedXOR
 An efficient prime for numbertheoretic transforms  Complex Projective 4Space on Complexity of integer multiplication almost solved
 SuperSupermario24 on Infinite monkey theorem
Category Archives: Chess
The neural network of the Stockfish chess engine
Last time, we briefly mentioned the highlevel 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
Posted in Chess
10 Comments
Most difficult chess problem
Neil Bickford has exhaustively searched the space of 5 × 4 slidingblock 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
Posted in Chess
27 Comments
3D chess is Turingcomplete
As promised, here is the remainder of the proof of the Turingcompleteness of threedimensional 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
Posted in Chess
Leave a comment
Circuitry in 3D chess
This is the second of a projected threepart series of articles, which will ultimately prove the Turingcompleteness of threedimensional chess. In the first article, I described the basic rules of the game. In this article, I shall show how to … Continue reading
Posted in Chess
Leave a comment
Threedimensional chess
This is the first of a projected series of articles investigating a natural threedimensional 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 linearbounded … Continue reading
Posted in Chess
Leave a comment