HomeSort by: relevance | last modified time | path
    Searched refs:num_in (Results 1 - 5 of 5) sorted by relevancy

  /src/games/monop/
houses.c 79 for (i = 0; i < mp->num_in; i++) {
147 for (i = 0; i < mp->num_in; i++) {
166 if (mp->num_in == 3 &&
173 else if (mp->num_in == 2 && abs(result[0] - result[1]) > 1)
180 for (i = 0; i < mp->num_in; i++) {
209 for (i = 0; i < mp->num_in; i++)
280 for (i = 0; i < mp->num_in; i++) {
303 if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
308 else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
310 for (tot = i = 0; i < mp->num_in; i++
    [all...]
misc.c 223 printf("orig->num_in = %d\n", orig->num_in);
225 if (num == orig->num_in)
243 mp->num_own = mp->num_in;
244 for (i = 0; i < mp->num_in; i++)
258 for (i = 0; i < mp->num_in; i++)
prop.c 160 int i, num_in, cur_max; local
169 num_in = num_play;
170 while (num_in > 1 || (cur_max == 0 && num_in > 0)) {
179 if (--num_in == 0)
monop.c 132 #define MONINIT(num_in, h_cost, not_m, mon_n, sq1,sq2,sq3) \
133 {0, -1, num_in, 0, h_cost, not_m, mon_n, {sq1,sq2,sq3}, {0,0,0}}
137 /* num_in h_cost not_m mon_n sqnums */
357 for (i = 0; i < mp->num_in; i++)
monop.h 85 short num_in; /* # in monopoly */ member in struct:mon_st

Completed in 72 milliseconds