Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move Generation

Author: Uri Blass

Date: 13:28:05 02/22/05

Go up one level in this thread


On February 22, 2005 at 16:01:50, macaroni wrote:

>Don't forget to search captures first. Search hash move, then all captures, then
>rest sorted by history. This is because in many positions, the whole line is
>refuted by NxQ, free queen or equivilent capture. This will greatly improve your
>search efficiency. Perhaps your already doing this, just in case.
>Cheers
>Tor

This is clearly not his problem.
Even with random order of moves he should get less nodes.

the number of nodes that he gets is largerthan perft 4.

Uri



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.