Author: Russell Reagan
Date: 14:35:14 08/28/03
I was wondering how often paradoxes happen in computer chess games. For instance, does a program without a transposition table ever beat a program with a transposition table consistently (assuming they are otherwise similar)? Or a program without any forward pruning beats one that uses null move? I'll give an example to show what I mean by "otherwise similar": Program A: basic alpha-beta search move ordering qsearch evaluation function Program B: basic alpha-beta search move ordering qsearch evaluation function transposition table The only main difference is the transposition table, even though the details of move ordering, qsearch, and evaluation might be different. It doesn't seem like program A should ever beat program B consistently. Are there any examples of such a paradox occuring? For instance, maybe a program lacked some major component that another had (transposition table, forward pruning, etc.) but it was still stronger because of, say, superior positional evaluation.
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.