blob: 432808d9cbc77bbe7eedfddd59574933f82c3ad9 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
#include "web_match.h"
#include "match.h"
#include <stdbool.h>
#include <stddef.h>
#include <stdlib.h>
struct match_state *state;
struct match_opts *match_opts;
void free_state()
{
state->legs[1]->n_visits += state->boat_undone; // avoid memory leak
leg_free(state->legs[0]);
leg_free(state->legs[1]);
free(state);
state = NULL;
}
void match_opts_free()
{
free(match_opts);
match_opts = NULL;
}
int match_num_players()
{
if (state->mode == M_P)
return 1;
return 2;
}
int match_winning_player()
{
for (int i = 0; i < match_num_players(); ++i) {
if (state->legs[i]->rem == 0)
return i + 1;
}
return -1;
}
bool match_is_over()
{
return match_winning_player() != -1;
}
struct leg *state_active_leg()
{
return state->legs[state->active_player - 1];
}
|