Answers.Body: <p>Yes, Turing created a "Paper Machine" along with David Champernowne in 1948 that they called "Turochamp". As far as I know he only played one recorded game with the system, against Alick Glennie (full game found <a href="http://www.chessgames.com/perl/chessgame?gid=1356927" rel="noreferrer">here</a>). There was only one recorded game against the Paper Machine because it took a very long time. Calculating one move without an electronic computer could take up to an hour.</p>
  
  <p>You can read more about Turochamp <a href="https://chessprogramming.wikispaces.com/Turochamp" rel="noreferrer">here</a>.</p>
  
  <p>I have not found any source code for running Turochamp yourself, but I"m sure someone out there has coded it. For the 100th anniversary of Turing's birth Kasparov played a game against the Paper Machine, notes <a href="http://en.chessbase.com/post/alan-turing-plays-garry-kasparov-at-che-58-years-after-his-death" rel="noreferrer">here</a>.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-02-16T13:52:36.477Z
Answers.LastActivityDate: 2015-02-16T16:28:26.827Z
Answers.LastEditDate: 2015-02-16T16:28:26.827Z
Answers.UserDisplayName: Justin C
Answers.Body: <p>Chessbase has made an implementation of Turing's engine available at the bottom of <a href="https://en.chessbase.com/post/reconstructing-turing-s-paper-machine" rel="nofollow noreferrer">this</a> post.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-09-30T07:47:49.817Z
Answers.LastActivityDate: 2017-09-30T07:47:49.817Z
Answers.UserDisplayName: PeteyPabPro
Answers.Body: <p>Yes, he played a game against Alick Glennie, actually he created an algorithm based on mathematical calculations. Then he tried his algorithm using pen and paper to do calculations.</p>
  
  <pre><code>[fen ""]
  [White "Alan Turing"]
  [Black "Alick Glennie"]
  
  1.e4 e5 2.Nc3 Nf6 3.d4 Bb4 4.Nf3 d6 5.Bd2 Nc6 6.d5 Nd4 7.h4 Bg4 8.a4
  Nxf3+ 9.gxf3 Bh5 10.Bb5+ c6 11.dxc6 O-O 12.cxb7 Rb8 13.Ba6 Qa5
  14.Qe2 Nd7 15.Rg1 Nc5 16.Rg5 Bg6 17.Bb5 Nxb7 18.O-O-O Nc5
  19.Bc6 Rfc8 20.Bd5 Bxc3 21.Bxc3 Qxa4 22.Kd2 Ne6 23.Rg4 Nd4
  24.Qd3 Nb5 25.Bb3 Qa6 26.Bc4 Bh5 27.Rg3 Qa4 28.Bxb5 Qxb5
  29.Qxd6 Rd8 0-1
  </code></pre>
  
  <p>The main idea of algorithm is <a href="http://antheacarson.hubpages.com/hub/The-1952-Paper-Chess-Computer-of-Alan-Turing" rel="noreferrer">here</a>:</p>
  
  <ol>
  <li><p>Mobility: For the queen, rooks, bishops, add the square roots of the number of moves that the piece can make, counting a capture as two moves.</p></li>
  <li><p>Piece safety: For the rooks, bishops and knights add 1 point if there is one defender and 1.5 if there is more than one</p></li>
  <li><p>King mobility: For the king use the same method of scoring as for the piece, but do not count castling</p></li>
  <li><p>King safety: Deduct points for the king's vulnerability, defined as the number of moves that a queen could make were it on the square of the king</p></li>
  <li><p>Castling: add 1 point if castling is still legally possible after this move. Add another point if castling is immediately possible or if a castling move has just been made</p></li>
  <li><p>Pawn credit: score .2 points for each rank advanced and .3 points for each pawn defended by one or more non pawns</p></li>
  <li><p>Check and mate threats. Score 1 point for the threat of mate, and .5 points for a checkmaterial values used to each of the pieces were:pawn =1, knight=3, bishop=3.5 rook =5, queen=10</p></li>
  </ol>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-10-09T21:16:34.530Z
Answers.Text: Does this pen and paper algorithm have the basic concept 'in' it that all chess programs share? If the pen and paper chess algorithm is feasible could a mechanical or low-tech device be made that can play this without any electronic circuitry involved?
Answers.UserDisplayName: 201044
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-10-10T06:22:58.933Z
Answers.Text: Yes and No, the basic concept and algorithm is what we know about chess as general guides which is implemented in computers by evaluation functions . Here the main problem is computing move variations. It needs lots of paper and time.
Answers.UserDisplayName: masoud
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-02-16T14:08:43.287Z
Answers.LastActivityDate: 2015-02-16T14:08:43.287Z
Answers.UserDisplayName: masoud
Body: <p>I read Turing had some algorithm or method he could use to play chess 'against' this pen and paper algorithm assigning certain numerical values to each piece. Is this true? Is there a pen and paper algorithm one can use to play a kind of chess with oneself?</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-02-16T12:21:02.823Z
Comments.Text: I am sure that at some trivial level it is possible. I have not heard of anything, however.
Comments.UserDisplayName: Tony Ennis
Tags: <engines><history><chess-variants>
Title: About Alan Turing and chess
ThreadText: # About Alan Turing and chess
  
  (Asked by: username_0 on 2015-02-16)
  
  I read Turing had some algorithm or method he could use to play chess 'against' this pen and paper algorithm assigning certain numerical values to each piece. Is this true? Is there a pen and paper algorithm one can use to play a kind of chess with oneself?
  
  **Tags:** engines, history, chess-variants
  
  > **Comments:**
  > **username_1**: I am sure that at some trivial level it is possible. I have not heard of anything, however.  
  
  ---
  
  ## 3 answers
  
  ### Answer by username_4 on 2015-02-16. Score: 7 | Accepted answer
  
  Yes, he played a game against Alick Glennie, actually he created an algorithm based on mathematical calculations. Then he tried his algorithm using pen and paper to do calculations.
  
  ```
  [fen ""]
  [White "Alan Turing"]
  [Black "Alick Glennie"]
  
  1.e4 e5 2.Nc3 Nf6 3.d4 Bb4 4.Nf3 d6 5.Bd2 Nc6 6.d5 Nd4 7.h4 Bg4 8.a4
  Nxf3+ 9.gxf3 Bh5 10.Bb5+ c6 11.dxc6 O-O 12.cxb7 Rb8 13.Ba6 Qa5
  14.Qe2 Nd7 15.Rg1 Nc5 16.Rg5 Bg6 17.Bb5 Nxb7 18.O-O-O Nc5
  19.Bc6 Rfc8 20.Bd5 Bxc3 21.Bxc3 Qxa4 22.Kd2 Ne6 23.Rg4 Nd4
  24.Qd3 Nb5 25.Bb3 Qa6 26.Bc4 Bh5 27.Rg3 Qa4 28.Bxb5 Qxb5
  29.Qxd6 Rd8 0-1
  
  ```
  
  The main idea of algorithm is [here](http://antheacarson.hubpages.com/hub/The-1952-Paper-Chess-Computer-of-Alan-Turing):
  
  1. Mobility: For the queen, rooks, bishops, add the square roots of the number of moves that the piece can make, counting a capture as two moves.
  2. Piece safety: For the rooks, bishops and knights add 1 point if there is one defender and 1.5 if there is more than one
  3. King mobility: For the king use the same method of scoring as for the piece, but do not count castling
  4. King safety: Deduct points for the king's vulnerability, defined as the number of moves that a queen could make were it on the square of the king
  5. Castling: add 1 point if castling is still legally possible after this move. Add another point if castling is immediately possible or if a castling move has just been made
  6. Pawn credit: score .2 points for each rank advanced and .3 points for each pawn defended by one or more non pawns
  7. Check and mate threats. Score 1 point for the threat of mate, and .5 points for a checkmaterial values used to each of the pieces were:pawn =1, knight=3, bishop=3.5 rook =5, queen=10
  
  > **Comments:**
  > **username_0**: Does this pen and paper algorithm have the basic concept 'in' it that all chess programs share? If the pen and paper chess algorithm is feasible could a mechanical or low-tech device be made that can play this without any electronic circuitry involved?  
  > **username_4**: Yes and No, the basic concept and algorithm is what we know about chess as general guides which is implemented in computers by evaluation functions . Here the main problem is computing move variations. It needs lots of paper and time.  
  
  ---
  
  ### Answer by username_2 on 2015-02-16. Score: 5
  
  Yes, Turing created a "Paper Machine" along with David Champernowne in 1948 that they called "Turochamp". As far as I know he only played one recorded game with the system, against Alick Glennie (full game found [here](http://www.chessgames.com/perl/chessgame?gid=1356927)). There was only one recorded game against the Paper Machine because it took a very long time. Calculating one move without an electronic computer could take up to an hour.
  
  You can read more about Turochamp [here](https://chessprogramming.wikispaces.com/Turochamp).
  
  I have not found any source code for running Turochamp yourself, but I"m sure someone out there has coded it. For the 100th anniversary of Turing's birth Kasparov played a game against the Paper Machine, notes [here](http://en.chessbase.com/post/alan-turing-plays-garry-kasparov-at-che-58-years-after-his-death).
  
  
  ---
  
  ### Answer by username_3 on 2017-09-30. Score: 1
  
  Chessbase has made an implementation of Turing's engine available at the bottom of [this](https://en.chessbase.com/post/reconstructing-turing-s-paper-machine) post.
  
  
  ---
  
  