Author: Jonathan Lee
Date: 12:02:56 10/25/99
Go up one level in this thread
On October 25, 1999 at 14:43:12, Jeff Kenton wrote: >On October 25, 1999 at 14:31:21, Scott Gasch wrote: > >> >>On a related note: didn't someone prove that checkers was a closed game? >>Whoever moves first wins if they play perfectly? If this is indeed the case, >>you might do no search at all and instead but a big hard drive and put the >>tablebase on it. Then you can play the "best" move from all positions...? >>However I am not sure if this is true or just me being confused. >> > >I don't believe this is true. Besides, I don't have a disk that big <grin>. First of all, there are about 10 different ways to play checkers. If it is the "most popular one", I already have a shareware checkers program that plays like a master. It uses only 58,000 bytes. The program is called blitz45. If you are doing programming for fun, then alright, but trust me the one I got at home can go ply 20 half moves in less than a minute. (9th message) Jonathan
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.