G

General

The Canon

Thinking

Three results

Playing for three results

Openings Workshop 2010

22nd_June_2010: Openings workshop

The simpler and more specific queries were dealt with first:

Summer Coaching 2010

A bird's eye view of repertoires

How not to beat Andrew Greet

An account of our Christmas simul

Genial 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!

Swindles

Diligent explorers of this website may have found a little collection of the finest swindles that I had perpetrated in my career, up to the point where I established this website.  I pulled off another one so appalling that I thought it too should be displayed as a dreadful warning to others.  The serendipity of life ensured that a week or two before, hot new signing Tim Paulden had pulled off a win when a piece down in an endgame, and a week or two after, I witnessed Ian Jamieson come out with a win in a position that the most sympathetic reading would say was unpromising.

How do Chess-Players Think?

Knight's Tour

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.
Syndicate content

Chess Quotes

From time immemorial, chessmasters have excelled at two things: chess and alibis.

— Reuben FINE