Author: Bruce Cleaver

Date: 17:15:58 02/14/04

Go up one level in this thread

"Why not use a logarithmic scale based on the difference between the best possible move and the move under consideration?" Ron Rivest (he is the "R" in the RSA encryption algorithm) wrote a chess algorithm called min-max approximation, which computes the first derivative (really!!) of the score's change as a means to shape the search. It has somewhat the same flavor as your idea. It is really beautiful, but has two flaws: it is a best-first searcher (therefore exponential in memory), and heavily involves floating-point calcs. The first objection can be overcome in the standard way, but not the second.

- Re: not using nullmove? [generalized null move]
**Christophe Theron***11:21:25 02/15/04*- Re: not using nullmove? [generalized null move]
**Bruce Cleaver***14:13:03 02/15/04*

- Re: not using nullmove? [generalized null move]
- Re: not using nullmove? [generalized null move]
**Tord Romstad***09:35:12 02/15/04*- Re: not using nullmove? [generalized null move]
**Dann Corbit***09:59:44 02/15/04*- Thanks, Dann! (n/t)
**Tord Romstad***03:02:05 02/16/04*

- Thanks, Dann! (n/t)

- Re: not using nullmove? [generalized null move]
- Re: not using nullmove? [generalized null move]
**Russell Reagan***19:43:19 02/14/04*- Re: not using nullmove? [generalized null move]
**Bruce Cleaver***04:49:56 02/15/04*- Re: not using nullmove? [generalized null move]
**Russell Reagan***09:20:47 02/15/04*- Re: not using nullmove? [generalized null move]
**Dann Corbit***10:04:10 02/15/04*

- Re: not using nullmove? [generalized null move]

- Re: not using nullmove? [generalized null move]

- Re: not using nullmove? [generalized null move]

This page took 0.06 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.