Author: Jeff Anderson
Date: 19:16:07 09/21/98
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
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.