Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mobility in Chess Evaluation Function at terminal-nodes

Author: Will Singleton

Date: 17:14:03 12/28/05

Go up one level in this thread


On December 28, 2005 at 17:35:09, Tord Romstad wrote:

>On December 28, 2005 at 16:30:26, Will Singleton wrote:
>>
>>Could you clarify?  In my program, I have to gen the moves in order to count
>>them.
>
>Generating moves involves a lot of expensive and unnecessary
>operations when all you need is the number of moves.  You need
>to construct the actual move objects (in my program, an unsigned
>int containing the from square, the destination square, the
>captured piece, and the promotion piece), store this object in
>some kind of list or array, and incrementing a number of moves
>count or an end of move list pointer.  This is obviously much
>more time-consuming than just incrementing an integer.
>
>>Do you mean that your mobility doesn't consider legality or viability?
>
>Yes, this too.  I think pseudo-legal mobility is just as good as legal
>mobility.  I have never tested this, though.
>
>But anyway, this is an unrelated point.  Even if you insist on counting
>legal moves only, there is no need to actually generate the moves.
>
>Tord

Ok, so it's just semantics.  By "generate the moves," I meant that I figure out
which pseudo-legal moves are possible, and count them.  I don't actually make
the move-list, which to my way of thinking is an additional step beyond
generating the moves.  Language is certainly imprecise.



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.