Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!nntp.sei.cmu.edu!cis.ohio-state.edu!math.ohio-state.edu!howland.reston.ans.net!ix.netcom.com!netcom.com!scottec
From: scottec@netcom.com (Scott Cunningham)
Subject: Chess - exhaustive searching
Message-ID: <scottecD6FAH9.2pp@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
Date: Sun, 2 Apr 1995 19:36:45 GMT
Lines: 9
Sender: scottec@netcom19.netcom.com

	I know Chess is considered one of the games which is not feasable 
to do a full recording of all posible games, but how close are we to that 
technology??  How many possible positions of relevance are there?  You 
must exclude all illegal positions (pawn in first row, both kings in 
check, etc...)  Would it be feasable to run with 1 gig storage?? 10 gig?  
1 Tbyte?  At what point could the computer just say "26 moves till mate"

	Scott

