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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <sys/time.h>
#include "ipow.h"
#define S (5)
using namespace std;
bool should_flip_board=false;
struct Move;
class Board;
Move protocol_get_move(void);
void protocol_put_move(ostream &s,Move m);
int index_deltas[8][2]={{0,-1},{1,-1},{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1}};
struct Move{
int neudir,from,dir;
string str(void){
stringstream ss;
ss<<neudir<<' '<<from<<' '<<dir;
return ss.str();
}
};
class Board{
public:
int grid[S*S];
int neuidx;
Board(void):neuidx(S*(S/2)+S/2){
memset(grid,0,S*S*sizeof(int));
grid[S*(S/2)+S/2]=3;
for(int i=0;i<S;i++){
grid[i]=1;
grid[S*(S-1)+i]=2;
}
}
int moved(int at,int dir) const{
int x=at%S,y=at/S,x2,y2;
while(true){
x2=x+index_deltas[dir][0];
y2=y+index_deltas[dir][1];
if(x2<0||x2>=S||y2<0||y2>=S||grid[S*y2+x2]!=0)return S*y+x;
x=x2;
y=y2;
}
}
bool move(int at,int dir,int _newatcached=-1){
int newat=_newatcached==-1?moved(at,dir):_newatcached;
if(newat==at)return false;
grid[newat]=grid[at];
grid[at]=0;
if(grid[newat]==3)neuidx=newat;
return true;
}
void undomove(int at,int dir){
int movedidx=moved(at,dir);
movedidx+=S*index_deltas[dir][1]+index_deltas[dir][0];
grid[at]=grid[movedidx];
grid[movedidx]=0;
if(grid[at]==3)neuidx=at;
}
bool isvalid(Move mv){
int oldneuidx=neuidx;
//cerr<<"Called isvalid with move ";
//protocol_put_move(cerr,mv);
//print();
if(!move(oldneuidx,mv.neudir)){
//undomove(oldneuidx,mv.neudir);
return false;
}
if(!move(mv.from,mv.dir)){
//undomove(mv.from,mv.dir);
undomove(oldneuidx,mv.neudir);
return false;
}
undomove(mv.from,mv.dir);
undomove(oldneuidx,mv.neudir);
return true;
}
void print(void) const{
int x,y;
if(should_flip_board){
for(y=S-1;y>=0;y--){
for(x=S-1;x>=0;x--)cerr<<grid[S*y+x]<<' ';
cerr<<endl;
}
} else {
for(y=0;y<S;y++){
for(x=0;x<S;x++)cerr<<grid[S*y+x]<<' ';
cerr<<endl;
}
}
}
vector<Move> generate_moves(void){
vector<Move> poss;
Move m;
int nd,fr,d;
int newneu;
for(nd=0;nd<8;nd++){
newneu=moved(neuidx,nd);
if(newneu==neuidx)continue;
for(fr=0;fr<S*S;fr++){
if(grid[fr]!=1)continue;
for(d=0;d<8;d++){
m.neudir=nd;
m.from=fr;
m.dir=d;
if(isvalid(m))poss.push_back(m);
}
}
}
return poss;
}
};
inline int flip_index(int idx){
return S*(S-1-idx/S)+S-1-idx%S;
}
inline int flip_dir(int dir){
return dir==-1?-1:(dir+4)%8;
}
inline Move protocol_get_move(void){
Move m;
char c=cin.peek();
if(c=='q'||c=='Q')exit(0);
cin>>m.neudir>>m.from>>m.dir;
if(should_flip_board){
m.neudir=flip_dir(m.neudir);
m.from=flip_index(m.from);
m.dir=flip_dir(m.dir);
}
cerr<<"Got: ";
protocol_put_move(cerr,m);
cin.ignore(1024,'\n');
return m;
}
inline void protocol_put_move(ostream &s,Move m){
if(should_flip_board){
s<<flip_dir(m.neudir)<<' '<<flip_index(m.from)<<' '<<flip_dir(m.dir)<<endl;
} else {
s<<m.neudir<<' '<<m.from<<' '<<m.dir<<endl;
}
}
Move calculate_move(Board &bd);
int main(void){
Board bd;
Move mv;
string line;
struct timeval tv;
gettimeofday(&tv,NULL);
cerr<<"seed="<<(1000000*tv.tv_sec+tv.tv_usec)<<endl;
srand(1000000*tv.tv_sec+tv.tv_usec);
//srand(1430130052185291);
getline(cin,line);
if(line=="go"){
should_flip_board=false;
mv.neudir=-1; mv.from=1; mv.dir=3;
bd.move(mv.from,mv.dir);
protocol_put_move(cout,mv);
} else {
if(line!="nogo")cerr<<"no0b "<<line<<" not in (go,nogo)"<<endl;
should_flip_board=true;
mv=protocol_get_move();
bd.move(mv.from,mv.dir);
bd.print();
mv=calculate_move(bd);
if(!bd.isvalid(mv)){
cerr<<"calculate_move gave invalid move "<<mv.str()<<endl;
return 1;
}
bd.move(bd.neuidx,mv.neudir);
bd.move(mv.from,mv.dir);
protocol_put_move(cout,mv);
}
while(true){
bd.print();
mv=protocol_get_move();
bd.move(bd.neuidx,mv.neudir);
bd.move(mv.from,mv.dir);
bd.print();
mv=calculate_move(bd);
if(!bd.isvalid(mv)){
cerr<<"calculate_move gave invalid move "<<mv.str()<<endl;
return 1;
}
bd.move(bd.neuidx,mv.neudir);
bd.move(mv.from,mv.dir);
protocol_put_move(cout,mv);
}
return 0;
}
class Node{
Node *firstchild,*nextsibling;
uint8_t flags;
#define NFLAG_PLAYER (0x1)
#define NFLAG_IS_TERMINAL (0x2)
#define NFLAG_TERMINAL_PLAYER (0x4)
uint8_t board[7]; //7*8=56; 5*5*2=50 (5*5=25 cells, 2 bits per cell); of last byte only 2 bits used
};
Move calculate_move(Board &bd){
static Node root;
}
|
