Author: Renze Steenhuisen
Date: 02:45:53 11/06/03
I would like to get a little more certainty than I have right now. It is about the search algorithms that have been developed throughout the years. I would like to have a complete list (at least for myself) and writing a little about these algorithms, including pseudo-code. After having read lots of articles, it has come to my attention that things aren't that clear as I thought they were. I was wondering if any alorithm is missing? Please let me know! Is NegaScout the Negamax formulation of Scout, or is NegaScout a little more advanced aswell? (I have the feeling that it was more advanced) --------------------------------------------------------------------- Minimax Depth-First Algorithms: AlphaBeta (Fail-hard, Fail-Soft) Scout PVS (PVSearch, NegaScout, C-alpha-beta) MTD(f) Best-First Algorithms: SSS* B* Conspiracy Number Search Proof-Number Search (and pn^2) --------------------------------------------------------------------- Kind regards, Renze
This page took 0.02 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.