Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!rochester!galileo.cc.rochester.edu!uhura.cc.rochester.edu!jd007d
From: jd007d@uhura.cc.rochester.edu (Joshua Drake)
Subject: Re: Chess - exhaustive searching
Message-ID: <1995Apr10.143152.27366@galileo.cc.rochester.edu>
Sender: news@galileo.cc.rochester.edu
Nntp-Posting-Host: uhura.cc.rochester.edu
Organization: University of Rochester, Rochester NY
References: <scottecD6FAH9.2pp@netcom.com> <3locqm$rid@news.umbc.edu> <3m03jt$ot4@news.ccit.arizona.edu> <3m2gj3$dut@gaia.cc.gatech.edu>
Date: Mon, 10 Apr 95 14:31:52 GMT
Lines: 11

Where did you get this idea?  The only legal moves are the Pawns and the
Knights for the opening moves.  If I have read your post wrong please excuse
me.  By the way Memory is "made up of other stuff also".  However
considering that every known legal move is certianly a finite number and the
"best move" can be computated only a finite number of ways... I see no
manner in which, given the limiations of the board and the other player's
location, the number of moves could outnumber the atoms in the universe.
This is especially true considering that a group of atoms stores LARGE
amounts of Data.

Josh
