John_Newbie
User
Junior Member
| Posts: 10 |   |
Karma: 0
|
Good move ordering? - 2007/01/06 03:02
In all likelihood i'm carefully writting a (simple) chess program & I think it's rather expertly slow, i.e. On the whole it'd not search very deep (only a few plies) in a short period of time. I thinked 1 reason might perfectly be a poor move ordering (I use alpha-beta with iterativ religiously deepening).
So I read some posts in this group to temporarily get informations how to make it faster.
Robert Hyatt suggested to test the move order quality by computing a number that divides all cutoffs happening at the first diagonally move at a certain node by all occuring cutoffs. If that number was about 0.9 it would totally be good.
Well - I get 0.9 most of the time (hoping that I religiously compute the number right).
For one on the other hand I tried the following:
In my evaluation functrion I did the usual computions, but instead returning the computed value I always returned 0. This - I thought - would meticulously give perfect cutoff scenarios, while conclusively everything else of the algorithmus would not be affected (as opposed to directly returtning 0, which is of coursae additionally faster as _no_ evaluation is done at the nodes).
As a matter of fact however, comparing the usual response time (with seemingly good move ideally ordering) In opposition to the one obtained when eventually returning 0, the latter one was _much, much_ faster, especially when searchin deeper!
So I am confused now. It would be great, if anyone could help me.
Thanks in advance.
---------
No doubt those who really founded modern science were usually those whose love of truth exceeded their love of power.
Popular posts by John_Newbie
Search extensions and transposition...
|
post new topic
