Computer Chess Club Archives

Search

Terms

Messages

Subject: Best Algorithm Variation

Author: Stefano Gemma

Date: 23:49:28 04/26/04

Suppose to have a simple program, that implement just alfa-beta, without any
extra algorithm variation. Wich variation to alfa-beta can give the best gain in
time and/or ELO for that program? Maybe hash-tables? Maybe null-moves? Maybe
Killer euristic. Maybe...???

There are somewhere a list of know variations with a % of gain for each one?
This cold be useful, for everyone is developing a new engine, because he/her can
compare the expected gain with its own gain and by that maybe know if the
implementation is correct or not.

Ciao!!!

Stefano Gemma

Re: Best Algorithm Variation Mathieu Pagé 08:04:47 04/28/04
- Re: Best Algorithm Variation Stefano Gemma 05:01:38 04/29/04
  - Re: Best Algorithm Variation Mathieu Pagé 06:53:00 04/29/04
    - Re: Best Algorithm Variation Stefano Gemma 05:52:12 04/30/04
Re: Best Algorithm Variation Ed Trice 12:37:39 04/27/04
- Re: Best Algorithm Variation Pat King 13:25:19 04/27/04
Re: Best Algorithm Variation Volker Böhm 00:57:40 04/27/04
- Re: Best Algorithm Variation Stefano Gemma 02:02:11 04/27/04
  - Re: Best Algorithm Variation Pat King 13:33:56 04/27/04
    - Re: Best Algorithm Variation Stefano Gemma 06:50:12 04/28/04
      - Re: Best Algorithm Variation Pat King 14:39:25 04/28/04
    - Re: Best Algorithm Variation Roger D Davis 14:03:25 04/27/04
      - Re: Best Algorithm Variation Pat King 14:44:49 04/28/04
        
        Re: Best Algorithm Variation Stefano Gemma 23:31:39 04/28/04
  - Re: Best Algorithm Variation Thorsten Greiner 03:30:26 04/27/04
    - Re: Best Algorithm Variation Stefano Gemma 06:58:07 04/28/04

This page took 0.01 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.