Searched refs:moves (Results 1 - 25 of 55) sorted by relevance

123

/macosx-10.10.1/Chess-310.6/English.lproj/
H A DInfoPlist.strings
/macosx-10.10.1/Chess-310.6/sjeng/
H A Dsearch.c62 void order_moves (move_s moves[], int32_t move_ordering[], int32_t see_values[], int num_moves, int best) { argument
73 from = moves[i].from;
74 target = moves[i].target;
75 promoted = moves[i].promoted;
76 captured = moves[i].captured;
162 from = moves[i].from;
163 target = moves[i].target;
164 promoted = moves[i].promoted;
165 captured = moves[i].captured;
228 move_s moves[MOVE_BUF local
271 move_s moves[MOVE_BUFF]; local
479 move_s moves[MOVE_BUFF]; local
1066 move_s moves[MOVE_BUFF], best_move = dummy; local
1450 move_s moves[MOVE_BUFF]; local
2014 move_s moves[MOVE_BUFF]; local
[all...]
H A Dproof.c142 move_s moves[MOVE_BUFF]; local
155 gen (&moves[0]);
162 make (&moves[0], i);
165 if (check_legal (&moves[0], i, TRUE))
168 unmake (&moves[0], i);
172 unmake (&moves[0], i);
314 move_s moves[MOVE_BUFF]; local
386 gen (&moves[0]);
394 make (&moves[0], i);
397 if (check_legal (&moves[
507 move_s moves[MOVE_BUFF]; local
770 move_s moves[MOVE_BUFF]; local
1018 move_s moves[MOVE_BUFF]; local
[all...]
H A Dbook.c20 Purpose: book initialization, selection of book moves, etc...
43 /* simply read all the book moves into a book array. The book will be
173 to get early exits once we've found the first few moves in the book.
181 move_s book_replies[4000], moves[400]; local
191 gen(&moves[0]);
197 /* if book move is legal, add it to possible list of book moves */
221 comp_to_coord(moves[j], coord_move);
226 make(&moves[0], j);
227 if (check_legal(&moves[0], j, ic))
229 book_replies[num_replies++] = moves[
[all...]
H A Dprotos.h30 bool check_legal (move_s moves[], int m, int incheck);
39 void gen (move_s moves[]);
42 bool f_in_check (move_s moves[], int m);
48 void make (move_s moves[], int i);
49 void order_moves (move_s moves[], int32_t move_ordering[], int32_t see_values[], int num_moves, int best);
61 void print_move (move_s moves[], int m, FILE *stream);
87 void unmake (move_s moves[], int i);
H A Dutils.c73 because some players will make instant moves in the opening, and Sjeng
147 move_s moves[MOVE_BUFF]; local
209 gen(&moves[0]);
218 if ((moves[i].target == move.target) &&
219 (board[moves[i].from] == board[move.from]) &&
220 (moves[i].from != move.from))
223 make(&moves[0], i);
224 if (check_legal(&moves[0], i, ic))
226 unmake(&moves[0], i);
230 unmake(&moves[
535 move_s moves[MOVE_BUFF]; local
650 print_move(move_s moves[], int m, FILE *stream) argument
919 move_s moves[MOVE_BUFF]; local
1224 move_s moves[MOVE_BUFF]; local
[all...]
H A Dnewbook.c164 move_s moves[MOVE_BUFF]; local
271 /* now, generate all moves from the current pos and try
278 gen (&moves[0]);
285 comp_to_san(moves[i], sjmove);
288 /* moves matched !*/
289 make(&moves[0], i);
292 if (check_legal(&moves[0], i, ic))
356 printf("Weeded %d moves.\n", weeds);
430 printf("\nWeeding book moves.\n");
448 move_s moves[MOVE_BUF local
[all...]
H A Dmoves.c19 File: moves.c
20 Purpose: functions used to generate & make moves
39 bool check_legal (move_s moves[], int m, int incheck) { argument
45 int castled = moves[m].castled;
46 int from = moves[m].from;
47 int target = moves[m].target;
52 /* check for castling moves: */
96 if (moves[m].from == 0) return TRUE;
98 switch (moves[m].promoted ? bpawn : board[target])
101 /* pawn moves, i
453 gen(move_s moves[]) argument
814 f_in_check(move_s moves[], int m) argument
1292 make(move_s moves[], int i) argument
1929 unmake(move_s moves[], int i) argument
[all...]
H A Dsegtb.c181 move_s moves[MOVE_BUFF]; local
234 gen(&moves[0]);
274 move_s moves[MOVE_BUFF]; local
312 gen(&moves[0]);
327 make(&moves[0], i);
329 unmake(&moves[0], i);
375 move_s moves[MOVE_BUFF]; local
421 gen(&moves[0]);
437 make(&moves[0], i);
439 unmake(&moves[
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/test/intltest/
H A Dcitrtest.h40 void TestUCharIterator(UCharIterator *iter, CharacterIterator &ci, const char *moves, const char *which);
H A Dtstnorm.h59 const char *moves,
H A Dtstnorm.cpp628 const char *moves,
649 const char *move=moves;
664 // copy the moves until the current (m) move, and terminate
666 uprv_strcpy(history, moves);
667 history[move-moves]=0;
676 // copy the moves until the current (m) move, and terminate
678 uprv_strcpy(history, moves);
679 history[move-moves]=0;
748 static const char *const moves="0+0+0--0-0-+++0--+++++++0--------"; local
754 moves, UNORM_NF
624 TestPreviousNext(const UChar *src, int32_t srcLength, const UChar32 *expect, int32_t expectLength, const int32_t *expectIndex, int32_t srcMiddle, int32_t expectMiddle, const char *moves, UNormalizationMode mode, const char *name) argument
[all...]
/macosx-10.10.1/Chess-310.6/Sources/
H A DMBCLanguageModel.h52 * collection of legal moves, and derives the move from a recognition
64 fromMoves:(MBCMoveCollection *)moves
H A DMBCLanguageModel.mm157 MBCPieceMoves * moves = fMoves->fMoves+piece;
160 for (int i = 0; i<moves->fNumInstances; ++i)
162 i ? '|' : ' ', Col(moves->fFrom[i]), Row(moves->fFrom[i]),
163 Col(moves->fFrom[i]), Row(moves->fFrom[i]));
166 for (int i = 0; i<moves->fNumInstances; ++i)
168 languageObject:[self movesFrom:moves->fFrom[i] to:moves->fTo[i]
309 fromMoves:(MBCMoveCollection *)moves
[all...]
H A DMBCEngine.h70 bool fEngineEnabled; // Engine moves enabled?
88 - (void) setGame:(MBCVariant)variant fen:(NSString *)fen holding:(NSString *)holding moves:(NSString *)moves;
H A DMBCBoard.h233 - (NSString *) moves; // Moves in engine format
235 moves:(NSString *)moves;
H A DMBCMoveGenerator.mm3 Contains: Generate all legal moves from a position
245 MBCPieceMoves & moves =
248 for (instance = 0; instance < moves.fNumInstances; ++instance)
249 if (moves.fFrom[instance] == from)
251 moves.fFrom[moves.fNumInstances++] = from;
253 moves.fTo[instance] |= (1llu << to);
H A DMBCEngine.mm268 // broadcast the rest of the moves
281 if (fLastMove) { // Ignore confirmations of game setup moves
314 // After the engine moved, we defer further moves until the
362 - (void) setGame:(MBCVariant)variant fen:(NSString *)fen holding:(NSString *)holding moves:(NSString *)moves
379 if (moves) {
381 [self writeToEngine:moves];
488 fWaitForStart = true; // Suppress further moves until start
H A DMBCInteractivePlayer.mm168 SRNewLanguageModel(fRecSystem, &fModel, "<moves>", 7);
235 MBCMoveCollector * moves = [MBCMoveCollector new];
236 MBCMoveGenerator generateMoves(moves, fVariant, 0);
240 fromMoves:[moves collection]
244 [moves release];
/macosx-10.10.1/tcl-105/tk/tk/library/demos/
H A Dknightstour.tcl7 # has the least number of available moves.
28 set moves {}
33 lappend moves [expr {$row * 8 + $col}]
36 return $moves
39 # Return the number of available moves for this square
42 set moves 0
45 incr moves
48 return $moves
/macosx-10.10.1/ruby-106/ruby/ext/tk/sample/demos-en/
H A Dknightstour.rb10 # has the least number of available moves.
32 moves = []
38 moves << (row * 8 + col) if row > -1 && row < 8 && col > -1 && col < 8
40 moves
43 # Return the number of available moves for this square
/macosx-10.10.1/ruby-106/ruby/ext/tk/sample/demos-jp/
H A Dknightstour.rb12 # has the least number of available moves.
34 moves = []
40 moves << (row * 8 + col) if row > -1 && row < 8 && col > -1 && col < 8
42 moves
45 # Return the number of available moves for this square
/macosx-10.10.1/emacs-93/emacs/lisp/play/
H A Dsolitaire.el130 "*Non-nil means check for possible moves after each major change.
147 Undo moves using \\[solitaire-undo].
148 Check for possible moves using \\[solitaire-do-check].
188 That's all. Here's the board after two moves:
411 "Check for any possible moves in Solitaire."
413 (let ((moves (solitaire-check)))
416 ((zerop moves)
417 (message "Sorry, no more possible moves."))
418 ((= 1 moves)
420 (t (message "There are %d possible moves
[all...]
/macosx-10.10.1/tcl-105/tcl_ext/incrtcl/incrTcl/itcl/tests/old/
H A Dinherit.test114 test {"virtual" command moves scope to most specific class} {
120 test {"previous" command moves scope upward in hierarchy} {
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/pt/include/serial/
H A Dpexpression.inc220 expressions. This moves expression equality from intensional

Completed in 128 milliseconds

123