Author: KarinsDad
Date: 11:28:54 07/20/99
Go up one level in this thread
On July 20, 1999 at 13:58:38, Dann Corbit wrote: [snip] > >A systematic and scientific investigation of the algorithms needed could greatly >enhance the ability of the programmers to make wise choices. Do we even know >the big O efficiency of these algorithms, so that we know the behavior when the >problem scales? Do we know the strengths and weaknesses when the board is >sparce, when formations are open, or closed? > >I think this is the most important idea in a long time. I think this is really a matter of doing homework on research that has already been done. I think the answers are already out there, it just would take someone some time to collate what is already there. For example: http://www.cs.vu.nl/~aske/Papers/abstr-ks.html When I started my project, I read a lot of papers. I did not completely understand them all, but I understood enough to know that doing things the standard ways was a deadend which would get me at best to the same place as everyone else. So, I started coming up with my own ideas and decided to incorporate them with techniques which have worked for others, but which did not conflict with what I was doing. Since ALL of these different techniques you mention have been done by a LOT of people in the past, one can conclude that the current best standard algorithms are probably already being used by Fritz, Hirarcs, Junior, Schredder, Ferret, Crafty, and others. So, it may be easiest to just ask the authors of the strongest programs which basic algorithms they are using. You already know the strengths and weaknesses of these various programs. Knowing EXACT statistical information may be more misleading then it is informative since in my opinion, the next iterative step in chess programming is to NOT use a bunch of standard algorithms, but to come up with something new (a paradigm shift). KarinsDad :)
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.