Fix detection of bare Kings

[fairymax.git] / fairymax.c

diff --git a/fairymax.c b/fairymax.c
index 0e22af6..bfe1f2a 100644 (file)
--- a/fairymax.c
+++ b/fairymax.c
@@ -589,8 +589,8 @@ int main(int argc, char **argv)
                         if(tlim>TimeLeft/15) tlim = TimeLeft/15;\r
                         PromPiece = 0; /* Always promote to Queen ourselves */\r
                         for(N=K=0;K<S;K++)N+=b[K]?b[K]&16?S:1:0; /* count pieces for detecting bare King */\r
-                        if(w[3]<0&w[4]<0){if(N>>8<2)centr[4]=5;if(!(N&S-2))centr[3]=5;Z+=R>4;R=4;}\r
-printf("# %d+%d pieces, centr = (%d,%d)\n", N&63, N>>7, centr[3], centr[4]);\r
+                        if(w[3]<0&w[4]<0){if(N<2*S)centr[4]=5,Z+=R>4,R=4;if(!(N&S-2))centr[3]=5,Z+=R>4,R=4;}\r
+printf("# %d+%d pieces, centr = (%d,%d) R=%d\n", N&63, N>>7, centr[3], centr[4], R);\r
                         N=0;K=I;\r
                         if(hill) centr[3] = R>20 ? 1 : 22-R;\r
                         if (D(Side,-I,I,Q,O,LL|S,3)==I) {\r