Author: scott farrell
Date: 22:06:14 11/30/02
Go up one level in this thread
On December 01, 2002 at 00:25:00, Russell Reagan wrote: >On November 30, 2002 at 23:54:31, scott farrell wrote: > >>Anyway, there is clearly no 'correct' value for this (nor anything else in chess >>programming). >> >>It largely depends on what your strategy is, ie. what are you going to do on a >>fail-low or fail-high, are you trying to work out/infer anything else? >> >>So it comes back to what is your strategy , and what are you going to do with >>the fail-low, fail-high situations. I only started working on this today, so I >>am no genius on it or anything, I am interested in other people's ideas. > >Thanks for your help Scott. > >It sounds like I just need to get a little better grasp of what all of this >stuff means. IE I know what a fail-high/fail-low is, but what additional >information does a fail-high/fail-low imply? That is the kind of information I >would like to be able to learn. I would like to be able to understand the basics >of this subject so I could better understand other aspiration search, when you >need to re-search, other methods like MTD(f), etc. > >What is the general subject area I should look into? Aspriation search? Or is >this simpler alpha-beta stuff? > >What is a good resource for learning about this kind of stuff? Books, academic >papers, websites, anything. > >I'm sure these topics have been covered before, since there are many who are >knowledgable about them. Besides, I'm sure I would do better to be able to stand >on my own with this subject matter, rather than asking question after question >about the tiny details. > >Any help is appreciated :) This forum, google, and the ICCA journal are the only sources of info. Do you have really good output from your code when it is running searches? You need this to start to learn when, how fast, how often fail-low fail-high occur. Reviewed lost games, find moves it made wrong, look at the output, re-run the position after the game, and find how you could have detected the problem with say aspiration window and fail-low and avoided the losing move. I think everyone learns this sort of stuff by watching the runtime stats of their program, reading this forum, comparing results/runtime stats on problems on this forum - I know I did. Scott
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.