Submitted by DrDave on Mon, 19/10/2009 - 21:52
Gunno Toernberg tells me he has been working on a computer approach to the problem: you can see his endeavours at: http://w1.859.telia.com/~u85905224/knight/eknight.htm where you can have ago on his Java board.
Comments on: Martin Loebbing and Ingo Wegener, The Number of Knight's Tours Equals 33,439,123,484,294 --- Counting with Binary Decision Diagrams Comment by the authors, May 15, 1996: The number of knight's tours given in the paper is incorrect, since the correct number must be divisible by 4.
Submitted by DrDave on Mon, 19/10/2009 - 20:49
"There is really only one mistake in chess - underestimating your opponent"-- TARTAKOVER
I found this session hard to prepare, and might try again! I have tried to find mistakes that are typical of a certain level of player - that is, mistakes of a characteristic kind, that better players no longer (or only rarely) make.
The hope is that these are the sorts of error most easily avoided. This document is subject to two caveats:
Submitted by DrDave on Mon, 19/10/2009 - 20:43
Shakespeare annotates a chess game Pinched wholemeal (as opposed to piecemeal) from Irving Chernev.
"In a book called Chesslets, by Dr. J. Schumer, all the games are annotated by quotations from various writers.-- CHERNEV, Wonders and curiosities of chess
Here is one of the games, with comments by Shakespeare:"
(27) Atkins - Saunders [E90]
Submitted by DrDave on Mon, 19/10/2009 - 20:26