22nd_June_2010: Openings workshop
The simpler and more specific queries were dealt with first:
An account of our Christmas simulGenial Cornish giant Andrew Greet came to show us how it was done before Christmas, and I'm sorry it's taken me this long to catch up and do some notes. Bob Jones was generous and prompt in his transcription of the games to PGN, so please don't blame him!
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.