Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Dynamic move ordering for capture/promotions?

Author: Severi Salminen

Date: 00:44:02 04/03/01

Go up one level in this thread


I'd _guess_ that these kinds of pin situations are very rare and thus would just
slow down your search if implemented. You should test that every move ordering
method works properly. Test each of them separately - especially SEE. Go through
the code in your mind and try to find bugs. It really helps. How big is your
fail high -percentile? Over 90%? I'm using similar move ordering and in position
after 1.e4 e5 2.d4 d5 my program has fail high -percentile of 96.2% after 9 ply
search. The total number of nodes is 1'815'792. These numbers  include qsearch.

Severi



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.