From: H.G. Muller <h.g.muller@hccnet.nl>
Date: Fri, 18 Jan 2013 16:05:30 +0000 (+0100)
Subject: Fix bug in move sorting
X-Git-Tag: 0.18~74
X-Git-Url: http://winboard.nl/cgi-bin?a=commitdiff_plain;h=df950afb30088935a862f9e0d5194e432de0af5a;p=hachu.git

Fix bug in move sorting

Due to reverse comparison, oves were resorted on every iteration into the
static order, completely thwarting the purpose of (I)ID.
---

diff --git a/hachu.c b/hachu.c
index ac3ed99..ca7f32d 100644
--- a/hachu.c
+++ b/hachu.c
@@ -1612,7 +1612,7 @@ if(PATH) printf("%d:%2d:%2d msp=%d\n",level,depth,iterDep,msp);
       // MOVE EXTRACTION
     extractMove:
 if(flag & depth >= 0) printf("%2d:%d extract %d/%d\n", depth, iterDep, curMove, msp);
-      if(curMove < sorted) {
+      if(curMove > sorted) {
 	move = moveStack[sorted=j=curMove];
 	for(i=curMove+1; i<msp; i++)
 	  if(moveStack[i] > move) move = moveStack[j=i]; // search move with highest priority