Modified to-square loop and invalid square testing to save 2 bytes.

Daniel White · Daniel White · commit c8ca010d1b43 · 2015-02-07T13:07:15.000Z
diff --git a/iota.c b/iota.c
@@ -15,9 +15,9 @@ F(U, V, p, r) {
 	int f=0,t, i, d, P, u, q;
 	N ;f<128;f=f+9&~8) { // Loop over squares looking for pieces.
 		N i=T[(P=B[f])&7]-35,d=0;d<0 || (d=T[i++]-35);d=-d) { // Loop over move steps for this piece.
-			N t=f+d;P&S;t+=d) { // Loop over destination squares in this direction.
-				// Invalid square or friendly capture?
-				I (t&(q=136)) || ((u=B[t])&S) M
+			N t=f;!((t+=d)&(q=136)) && P&S;) { // Loop over destination squares in this direction.
+				// Friendly capture?
+				I (u=B[t])&S M
 
 				// Special pawn logic.
 				I P%8==2)
