Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Centrality Perturbation to Move Selection Order

Author: Stuart Cracraft

Date: 12:15:34 01/30/98

Go up one level in this thread


Presently, I don't sort but use a move selection method (pick
highest score from amongst the set of moves). Since N is large
in this case, it is inefficient as well (as if it sorted.)

The main problem is that move generation is done too much and too
often and I don't have a routine for simply legality-checking
a move (hash move, killer move) without having to do a move
generation.

The search should be in phases of types of moves generated or
being investigated without generation. Won't be hard. Just a
switch/case-like statement with the same code doing slightly
different things depending on the type of move being legality
checked or generated.

I do have the capability presently to generate captures without
generating non-captures and will roll it in. I do have hash
move and killer available but presently do a move generation
before them. After putting together a legality-checker routine,
I can search them directly without the move gen.

Thanks for the helpful feedback,

--Stuart



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.