Computer Chess Club Archives


Search

Terms

Messages

Subject: Chess Heuristics Technical ASpects (Urgent if possible)

Author: Rikkert

Date: 10:22:15 03/12/03


My name is Rikkert Keldermann and I am a 4th Grade student Electrical
Engineering. I am currently following a course called knowledge systems. For
this course we have to write an essay of a knowledge system and I choose a
chesscomputer. However, I am missing some information, which I need for my
essay, maybe some off can answer some questions for me, because I couldn't find
the answers/articles on the web I needed. It are vital questions.

When an provide an opening book (or end game book) is provided with q chess
program, how many bites are necessary in the database to save a position in the
game, with its next moves and at the same time generate a fast follow op
position (i.e., the next move, without searching to long in the database, of an
evaluation function which last too long). What about the space? Is the database
not too big. Is the database not too big? How do you save the positions in the
database (i.e. what are the technical aspects of the database and evaluation
function?)...I really need this technical stuff.

I hope somebody can help me out. Or maybe you know some good websites with this
information.



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.