| /src/games/backgammon/teachgammon/ |
| ttext1.c | 106 const char *const moves[] = { variable in typeref:typename:const char * const[]
108 "\n Moves are made along the positions on the board according to",
109 "their numbers. Red moves in the positive direction (clockwise",
110 "from 1 to 24), and white moves in the negative direction (coun-",
157 "many moves as possible.",
167 "player must do is move the man off the bar. Such moves are",
|
| /src/games/hack/ |
| hack.Decl.c | 98 long moves = 1; variable in typeref:typename:long
|
| /src/games/robots/ |
| auto.c | 84 * Return x coordinate moves
106 * Return y coordinate moves
128 * Find possible moves
137 static const char moves[] = ".hjklyubn"; local in function:find_moves
138 static char ans[sizeof moves];
141 for (m = moves; *m; m++) {
|
| /src/games/rogue/ |
| use.c | 398 short moves; local in function:eat
415 moves = get_rand(950, 1150);
422 moves = get_rand(750, 950);
427 rogue.moves_left += moves;
|
| /src/games/larn/ |
| scores.c | 74 long moves; /* number of moves made by player */ member in struct:log_fmt
701 logg.moves = c[MOVESMADE];
787 if (logg.moves <= 0)
788 logg.moves = 1;
791 lprintf(" BYTES in: %ld, out: %ld, moves: %ld, deaths: %ld, spells cast: %ld\n", (long) (logg.bytin), (long) (logg.bytout), (long) (logg.moves), (long) (logg.killed), (long) (logg.spused));
792 lprintf(" out bytes per move: %ld, time per move: %ld ms\n", (long) (logg.bytout / logg.moves), (long) ((logg.cputime * 1000) / logg.moves));
|
| /src/games/snake/snake/ |
| snake.c | 109 static int moves; variable in typeref:typename:int
294 length(moves);
346 moves++;
436 length(moves);
914 length(moves);
971 length(moves);
987 printf("You made %d moves.\n", num);
|
| /src/games/gomoku/ |
| gomoku.h | 84 * 'F' is the number of moves still needed to make the combo non-blockable.
85 * 'W' is the minimum number of moves needed to win once it can't be blocked.
89 * Each time a frame is added to the combo, the number of moves to complete
90 * the force is the number of moves needed to 'fill' the frame plus one at
91 * the intersection point. The number of moves to win is the number of moves
101 * fewest moves to win.
106 * complete which takes fewer or the same number of moves to win).
142 #define cv_force c.a /* # moves to complete force */
143 #define cv_win c.b /* # moves to win *
252 spot_index moves[BSZ * BSZ]; \/* log of all played moves *\/ member in struct:game
[all...] |
| /src/sys/dev/scsipi/ |
| ch.c | 1171 u_int8_t *moves, *exchanges; local in function:ch_get_params
1213 moves = &sense_data.pages.cap.move_from_mt;
1216 sc->sc_movemask[from] = moves[from];
|
