Author: José Carlos
Date: 09:10:44 01/14/01
Go up one level in this thread
On January 14, 2001 at 11:53:06, John Wentworth wrote: >Hello. I'am just starting to write a Chess program and I'am coming across >problems I'am sure most Chess programmers solved years ago. If someone could >give some general tips or tell me how to avoid some pitfalls I would appreciate >it. I am an experienced programmer( I do it for a living), but this is my first >attempt at Chess. I have some general questions too: > >1. First problem, when doing a search, I want to be able to identify reasonable >moves and not waste time looking at moves that are meaningless. I guess this is >a selective type of search, how do you "select" those moves. You should read about search algorithms. But, to start with, It's a good idea to implement a simple minimax and see what happens. As you write your code, and see how it works, you'll learn a lot of things (I did it that way). >2. What is a tablebase, I own Hiarcs and when it loads it says it's initializing >them. They are complied positions of known result. For example, isntead of evaluating a KPK position, you can use a tablebase that contains all posible KPK positions with the exact "mate in n" or "draw" eval. Don't try this until your porgram is strong enough, because it can be messy if you're a beginner. >3. I'am using Crafty's book, any know problems with this book? Not that I know. >I just want a program that plays around 1800-1900 level that could beat my old >Par Excellence, not trying to make a GM here. Thanks for the advice\help. That will happen soon. Your first tries will end up in a 1400-1600 program. Rising that will be easy. When you reach 2000-2100 things will start to get complicated. José C.
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.