A silly question.....

Article View: gnu.chess

Article #5201

#5201

From: Royston
Date: Fri, 29 Apr 1994 19:54

8 lines
929 bytes

Ok, don't bite my modem off, but I have a silly question.

Seeing that the number of possible moves in the game of chess is finite,
why can't a database of all possible positions be set up and associated
winning trees kept? This way instead of a computer having to 'think' it
would simply just look and respond.

Open season on me now, it it???

Technical Details

Message-ID: <x-290494195514@adviser.bham.ac.uk>

Path:

arc1-ca.pugleaf.net!gmd.de!nntp.gmd.de!xlink.net!howland.reston.ans.net!pipex!lyra.csx.cam.ac.uk!warwick!bham!adviser.bham.ac.uk!user

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10d71d,a321b4f564e5fc13,start
X-Google-Attributes: gid10d71d,public
X-Google-ArrivalTime: 1994-04-30 07:27:28 PST
Path: arc1-ca.pugleaf.net!gmd.de!nntp.gmd.de!xlink.net!howland.reston.ans.net!pipex!lyra.csx.cam.ac.uk!warwick!bham!adviser.bham.ac.uk!user
From: x@y (Royston)
Newsgroups: gnu.chess
Subject: A silly question.....
Followup-To: gnu.chess
Date: 29 Apr 1994 19:54:25 GMT
Organization: The University of Birmingham, UK.
Lines: 8
Message-ID: <x-290494195514@adviser.bham.ac.uk>
NNTP-Posting-Host: adviser.bham.ac.uk