| /src/games/backgammon/teachgammon/ |
| ttext1.c | 106 const char *const moves[] = { variable
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",
|
| tutor.h | 58 extern const char *const moves[];
|
| teach.c | 104 if ((i = wrtext(moves)) != 0)
|
| /src/games/hack/ |
| hack.dog.c | 98 EDOG(mtmp)->hungrytime = 1000 + moves;
173 (poisonous(obj) || obj->age + 50 <= moves ||
207 if (moves <= edog->eattime)
211 whappr = (moves - EDOG(mtmp)->whistletime < 5);
212 if (moves > edog->hungrytime + 500 && !mtmp->mconf) {
221 } else if (moves > edog->hungrytime + 750 || mtmp->mhp < 1) {
246 edog->droptime = moves;
300 (gtyp != DOGFOOD && gtyp != APPORT && moves < edog->hungrytime)) {
377 mtmp2->mlstmv != moves &&
400 (otyp < ACCFOOD || edog->hungrytime <= moves)) {
[all...] |
| hack.Decl.c | 98 long moves = 1; variable
|
| hack.main.c | 374 if (moves % 2 == 0 ||
383 ++moves;
390 if (u.uhp * 10 < u.uhpmax && moves - wailmsg > 50) {
391 wailmsg = moves;
399 if (Regeneration || !(moves % 3)) {
406 (!(moves % (22 - u.ulevel * 2)))) {
|
| hack.save.c | 123 bwrite(fd, &moves, sizeof moves);
186 mread(fd, &moves, sizeof moves);
|
| hack.lev.c | 100 bwrite(fd, &moves, sizeof(long));
243 long tmoves = (moves > omoves) ? moves - omoves : 0;
|
| hack.eat.c | 353 if (moves % 2) {
363 if (moves % 20 == 0) { /* jimt@asgb */
467 if (let != 'a' && moves > otmp->age + 50 + rn2(100)) {
|
| hack.worm.c | 127 if (wgrowtime[tmp] <= moves) {
129 wgrowtime[tmp] = moves + rnd(5);
|
| hack.apply.c | 216 obj->age = moves - obj->age; /* actual age */
239 obj->age = moves - obj->age; /* simulated point of time */
307 EDOG(mtmp)->whistletime = moves;
|
| hack.h | 219 extern long moves;
|
| hack.mkobj.c | 120 otmp->age = moves;
|
| hack.engrave.c | 110 if (ep && ep->engr_time <= moves) {
337 ep->engr_time = moves - multi;
|
| hack.unix.c | 351 * however. The motion of '2' is less restrained than usual: diagonal moves
397 || moves < laststattime + MAILCKFREQ
401 laststattime = moves;
|
| hack.mon.c | 100 * moves, so we cannot just walk down the chain (even new
104 if (mtmp->mlstmv < moves)
110 mtmp->mlstmv = moves;
138 if (mtmp->mspeed != MSLOW || !(moves % 2)) {
155 if (warnlevel > lastwarnlev || moves > lastwarntime + 5) {
172 lastwarntime = moves;
245 if ((!(moves % 20) || strchr(MREGEN, mdat->mlet)) &&
|
| hack.pri.c | 627 && obj->age + 250 < moves)
633 && obj->age + 250 < moves)
757 " %ld", moves);
|
| hack.fight.c | 111 if (far != far_noise || moves - noisetime > 10) {
113 noisetime = moves;
|
| /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
138 static char ans[sizeof moves];
141 for (m = moves; *m; m++) {
|
| /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/gomoku/ |
| main.c | 119 fprintf(fp, "%s\n", stoc(game.moves[m]));
188 mvprintw(BSZ + 3, 0, "Black moves first. ");
509 board[game.moves[game.nmoves]].s_occ = EMPTY;
519 board[game.moves[game.nmoves]].s_occ =
527 debuglog("%s", stoc(game.moves[m]));
533 fprintf(fp, "%s", stoc(game.moves[m]));
535 fprintf(fp, " %s\n", stoc(game.moves[m]));
|
| 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...] |
| bdisp.c | 155 if (game.nmoves > 0 && game.moves[game.nmoves - 1] == s)
|
| /src/games/rogue/ |
| use.c | 398 short moves; local
415 moves = get_rand(950, 1150);
422 moves = get_rand(750, 950);
427 rogue.moves_left += moves;
|
| /src/games/snake/snake/ |
| snake.c | 109 static int moves; variable
294 length(moves);
346 moves++;
436 length(moves);
914 length(moves);
971 length(moves);
987 printf("You made %d moves.\n", num);
|
