Author: Jim Phillips
Date: 09:42:49 09/23/98
Go up one level in this thread
On September 21, 1998 at 22:16:07, Jeff Anderson wrote: >This is not even an idea as much as a useless half-thought born in the mind of a >bored highschool student. Still I thought it might be slightly relevant. > >Imagine a set of overlayed transparencies, each with a chessboard printed on it, >completely blank becides one piece. For every piece, black and white, there are >64 transparecies, each having a blank board it and one piece on a different >square each time. Now total you would have 768 transparence sheets. If you >overlay them in front of you, every possible position on a chessboard can be >reached by removing certain ones. > >Could a computer some how internally sort its way through these 'transparecies' >extremely fast? > >Jeff Jeff: Although your idea has already been used (with some variations) don't be disappointed. You have just displayed a fine example of right-brain thinking! It is this sort of mind-set that comes up with new ideas, in chess programming and in any other field. I look forward to hearing more of your ideas. -Jim Phillips
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.