Author: Derrick Gatewood
Date: 23:30:23 12/24/99
I am just now starting a little chess program. I have about 2 years of expirience with C++ and can do some moderately advance stuff with it, but I am not formerly trained in it. All I need to get started is a simple example of a search algorithm outside of a chess program. Maybe a Tic, Tac, Toe program that uses a nega-max algorithm (hehe, why???) or any other search algorithm. I believe seeing it outside something very complicating, such as a full chess program, will open my eyes as to how it actually works. If somebody can help me, I would appreciate it. I will also understand if nobody can help me. It is very frustrating trying to help somebody learn how to do something they have little expirience with. I bought the book Algorithms in C++ by Robert Sedgewick, and this helped me understand algorithms as a whole, btu mainly just sorting algorithms. Again, any help would be greatly appreciated and BTW, Meryy Christmas!!!!!!
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.