Author: Steffen Jakob
Date: 03:40:10 08/10/98
Go up one level in this thread
Hi Guido! >>I would like to tell you something about an idea which I had this >>weekend. I talked a bit about it with Bruce at ICC and he said that it >>might already be a known idea. I would appreciate some feedback. >> >>Some time ago someone (KK?) posted statistics about the first moves of >>white. This seemed rather useless for me. More interesting would be >>the the likelihood of _any_ move played in a won game by a strong >>player. This information e.g. could be used for a trivial move >>ordering. My plan is to do the following: >> >>1. Use a precalculated list of all possible moves for the move >> generator in your chess engine. >>2. Add a counter to the move structure >>3. scan a large database with only high quality games and >> increment the counter for each game where the winner made this >> move. >> >>The counter could be used to perform a very simple but also cheap move >>ordering or even for the evaluation itself. This idea could be improved >>if you don't store only a counter but a set of (pawnstruct, counter) >>pairs. >> >>What do you think? > >Your idea looks like a static implementation of a history heuristic table to me, >which >will be clearly outperfomed by the common dynamic approach. I didnt think of using this as the only way to compute the move order but as an additional factor (prob. with the lowest weight). >How you want to use this table for evaluation purposes I've no idea, please >elaborate. Easiest way would be to give a bonus f(counter) for each move in the line where the leaf position has to be evaluated. BTW: I don't claim that this is good idea for computer chess. It's just an idea :-) Greetings, Steffen.
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.