Author: Pete Galati
Date: 11:30:14 04/05/00
Go up one level in this thread
On April 05, 2000 at 14:08:01, Dann Corbit wrote: >It might be funny to write the smallest possible chess program that produces >legal moves for both sides. If it plays against itself, it could have no I/O >except to display the chosen moves. It could more or less choose legal moves at >random. Basically, it could be nothing but a board representation, a move >generator, and calls to rand(). > >Can it be done in (for instance) ten lines of C? How would you decide the random move to make? Wait a minute, that didn't make sense. Since you're not really talking about selecting a move based on a search, you'd have to generate a list of all the legal moves for each position, feed them to your random function as variables, and it would make it's random selection from those. It would play a bad game of Chess. I doubt if you could get by on 10 lines. Pete
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.