Home
last modified time | relevance | path

Searched refs:nplies (Results 1 – 8 of 8) sorted by relevance

/dports/benchmarks/fhourstones/fhourstones-3.1_2/
H A DGame.c61 int moves[SIZE],nplies; variable
67 nplies = 0; in reset()
75 return color[nplies&1] + color[0] + color[1] + BOTTOM; in positioncode()
84 for (i=0; i<nplies; i++) in printMoves()
97 return islegal(color[nplies&1] | ((bitboard)1 << height[col])); in isplayable()
123 n = moves[--nplies]; in backmove()
124 color[nplies&1] ^= (bitboard)1<<--height[n]; in backmove()
129 color[nplies&1] ^= (bitboard)1<<height[n]++; in makemove()
130 moves[nplies++] = n; in makemove()
H A DGame.java44 int moves[],nplies; in height'()
57 nplies = 0; in height'()
65 return color[nplies&1] + color[0] + color[1] + BOTTOM; in height'()
74 for (int i=0; i<nplies; i++) in height'()
99 return islegal(color[nplies&1] | (1L << height[col])); in height'()
131 n = moves[--nplies]; in height'()
132 color[nplies&1] ^= 1L<<--height[n]; in height'()
137 color[nplies&1] ^= 1L<<height[n]++; in height'()
138 moves[nplies++] = n; in height'()
H A DConnect4.java27 int moves[],nplies; field in Connect4
40 nplies = 0; in reset()
57 for (int i=0; i<nplies; i++) in toString()
81 return islegal(color[nplies&1] | (1L << height[col])); in isplayable()
116 n = moves[--nplies]; in backmove()
117 color[nplies&1] ^= 1L<<--height[n]; in backmove()
122 color[nplies&1] ^= 1L<<height[n]++; in makemove()
123 moves[nplies++] = n; in makemove()
H A DSearchGame.c56 if (nplies == SIZE-1) // one move left in ab()
58 otherside = (side = nplies & 1) ^ 1; in ab()
80 if (nplies == SIZE-2) // two moves left in ab()
118 if ((score=val) > alpha && nplies >= bookply && (alpha=val) >= beta) { in ab()
135 if (nplies <= reportply) { in ab()
144 int i, side = nplies & 1, otherside = side ^ 1, score; in solve()
154 reportply = nplies + REPORTPLY; in solve()
155 bookply = nplies + BOOKPLY; in solve()
190 printf("\nSolving %d-ply position after ", nplies); in main()
H A DSearchGame.java37 if (nplies == SIZE-1) // one move left in ab()
40 otherside = (side = nplies & 1) ^ 1; in ab()
65 if (nplies == SIZE-2) // two moves left in ab()
105 if ((score=sc) > alpha && nplies >= BOOKPLY && (alpha=sc) >= beta) { in ab()
123 if (nplies <= reportply) { in ab()
131 int i, side = nplies & 1, otherside = side ^ 1; in solve()
132 reportply = nplies + REPORTPLY; in solve()
169 System.out.println("\nSolving " + c4.nplies + "-ply position after " in main()
H A DTransGame.c80 if (nplies < SYMMREC) { // try symmetry recognition by reversing columns in hash()
H A DTransGame.java54 if (nplies < SYMMREC) { // try symmetry recognition by reversing columns in hash()
/dports/games/crafty/crafty-25.2_1/
H A Dlearn.c47 int nplies = 0, thisply = 0, i, j, v, cluster; in LearnBook() local
86 nplies++; in LearnBook()
87 nplies = Max(nplies, 1); in LearnBook()
91 book_learn[i] = t_learn_value * (float) thisply / (float) nplies; in LearnBook()