| /dports/games/crafty/crafty-25.2_1/ |
| H A D | input.c | 70 tree->status[MAXPLY] = tree->status[ply]; in InputMove()
278 mvp = GenerateCaptures(tree, MAXPLY, wtm, moves); in InputMove()
279 mvp = GenerateNoncaptures(tree, MAXPLY, wtm, mvp); in InputMove()
301 MakeMove(tree, MAXPLY, wtm, *mv); in InputMove()
303 UnmakeMove(tree, MAXPLY, wtm, *mv); in InputMove()
306 UnmakeMove(tree, MAXPLY, wtm, *mv); in InputMove()
371 tree->status[MAXPLY] = tree->status[ply]; in InputMoveICS()
455 mvp = GenerateCaptures(tree, MAXPLY, wtm, moves); in InputMoveICS()
474 MakeMove(tree, MAXPLY, wtm, *mv); in InputMoveICS()
476 UnmakeMove(tree, MAXPLY, wtm, *mv); in InputMoveICS()
[all …]
|
| H A D | output.c | 212 tree->status[MAXPLY] = tree->status[ply]; in OutputMove()
213 MakeMove(tree, MAXPLY, wtm, move); in OutputMove()
216 GenerateCheckEvasions(tree, MAXPLY + 1, Flip(wtm), in OutputMove()
223 UnmakeMove(tree, MAXPLY, wtm, move); in OutputMove()
|
| H A D | chess.h | 160 int path[MAXPLY];
170 int hash_path_moves[MAXPLY];
226 SEARCH_POSITION status[MAXPLY + 3];
227 NEXT_MOVE next_status[MAXPLY];
228 KILLER killers[MAXPLY];
232 uint64_t save_hash_key[MAXPLY + 3];
235 int curmv[MAXPLY];
236 int phase[MAXPLY];
237 int hash_move[MAXPLY];
238 unsigned *last[MAXPLY];
[all …]
|
| H A D | hash.c | 158 i < Min(MAXPLY - 1, ptable[entry].hash_pathl + ply); i++) in HashProbe()
161 if (ptable[entry].hash_pathl + ply < MAXPLY - 1) in HashProbe()
164 Min(MAXPLY - 1, ply + ptable[entry].hash_pathl); in HashProbe()
|
| H A D | ponder.c | 101 for (i = 0; i < MAXPLY; i++) { in Ponder()
106 for (i = 0; i < MAXPLY; i++) { in Ponder()
|
| H A D | quiesce.c | 54 if (ply >= MAXPLY - 1) in Quiesce()
299 if (ply >= MAXPLY - 1) in QuiesceEvasions()
|
| H A D | utility.c | 2478 tree->status[MAXPLY] = tree->status[ply]; in VerifyMove()
2479 mvp = GenerateCaptures(tree, MAXPLY, wtm, moves); in VerifyMove()
2480 mvp = GenerateNoncaptures(tree, MAXPLY, wtm, mvp); in VerifyMove()
2482 MakeMove(tree, MAXPLY, wtm, *mv); in VerifyMove()
2484 UnmakeMove(tree, MAXPLY, wtm, *mv); in VerifyMove()
2487 UnmakeMove(tree, MAXPLY, wtm, *mv); in VerifyMove()
|
| H A D | epdglue.c | 293 if (score >= (MATE - MAXPLY)) { in EGMapFromHostScore()
297 } else if (score <= (MAXPLY - MATE)) { in EGMapFromHostScore()
520 for (index = 0; index < MAXPLY; index++) { in EGPutHostPosition()
|
| H A D | iterate.c | 263 for (; iteration <= MAXPLY - 5; iteration++) { in Iterate()
|
| H A D | main.c | 4792 tree->status[MAXPLY] = tree->status[0];
|
| /dports/games/neverball/neverball-1.6.0/putt/ |
| H A D | hole.c | 45 static int stat_v[MAXPLY];
46 static float ball_p[MAXPLY][3];
47 static float ball_e[MAXPLY][3][3];
49 static int score_v[MAXHOL][MAXPLY];
130 memset(score_v, 0, sizeof (int) * MAXPLY * MAXHOL); in hole_init()
|
| H A D | hole.h | 7 #define MAXPLY 5 macro
|
| /dports/games/phalanx/Phalanx-XXV/ |
| H A D | phalanx.h | 233 #define MAXPLY 64 macro
431 extern tsearchnode S[MAXPLY]; /* the current node is S[Ply] */
448 extern tmove PV[MAXPLY][MAXPLY]; /* principal variantion */
|
| H A D | data.c | 9 tmove PV[MAXPLY][MAXPLY]; /* Principal var. */
|
| H A D | evaluate.c | 44 tsearchnode S[MAXPLY];
293 if( Ply >= MAXPLY-2 ) in evaluate()
|
| H A D | search.c | 351 && !Abort && Depth < MAXPLY*100 ) in root_search()
|
| /dports/games/scid/scid/engines/phalanx-scid/ |
| H A D | data.c | 9 tmove PV[MAXPLY][MAXPLY]; /* Principal var. */
|
| H A D | phalanx.h | 238 #define MAXPLY 40 macro
449 extern tmove PV[MAXPLY][MAXPLY]; /* principal variation */
|
| H A D | evaluate.c | 108 int psnl[MAXPLY];
109 int devi[MAXPLY];
319 if( Ply >= MAXPLY-2 ) in evaluate()
|
| H A D | search.c | 394 && !Abort && Depth < MAXPLY*100 ) in root_search()
|
| /dports/games/py-pychess/pychess-1.0.2/lib/pychess/Utils/lutils/ |
| H A D | TranspositionTable.py | 5 from pychess.Utils.lutils.ldata import MATE_VALUE, MAXPLY
49 if tdepth < depth and abs(score) < MATE_VALUE - MAXPLY:
|
| H A D | ldata.py | 37 MAXPLY = 10 variable
|
| /dports/games/py-pychess/pychess-1.0.2/lib/pychess/Players/ |
| H A D | PyChess.py | 16 from pychess.Utils.lutils.ldata import MAXPLY # nopep8
27 self.sd = MAXPLY
|
| H A D | PyChessCECP.py | 18 from pychess.Utils.lutils.ldata import MAXPLY
130 self.sd = MAXPLY
|
| /dports/games/gnubg/gnubg-1.06.002/ |
| H A D | gtktheory.c | 37 #define MAXPLY 4 macro
89 GtkWidget *apwPly[MAXPLY+1];
868 for (i = 0; i <= MAXPLY; ++i) { in GTKShowTheory()
|