blob: 58648b9f357b40f47325a937d8461a07e089f08d (
plain)
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
|
#include "ptn.h"
#define ASSERT_NONEMPTY { if (ptn == 0 || *ptn == 0) return PTN_INVALID; }
#define ASSERT_MORE { if (*ptn == 0) return PTN_INVALID; }
enum PTN_PARSE_RESULT
parse_place(const uint8_t board_size, char *ptn,
uint8_t *location, enum STONE_VARIANT *stone) {
ASSERT_NONEMPTY;
*stone = STONE_FLAT;
switch (*ptn) {
case 'C' : { ptn++; *stone = STONE_CAPSTONE; break; };
case 'S' : { ptn++; *stone = STONE_STANDING; break; };
case 'F' : { ptn++; break; };
}
ASSERT_MORE;
if ( (*ptn < 'a') || (*ptn > '`' + board_size) ) return PTN_INVALID;
*location = *ptn - 'a';
ptn++; ASSERT_MORE;
if ( (*ptn < '1') || (*ptn > board_size + '0') ) return PTN_INVALID;
*location += board_size * (*ptn - '1');
if (*(++ptn) > 0) return PTN_INVALID;
return PTN_VALID;
}
enum PTN_PARSE_RESULT
parse_move(const uint8_t board_size, char *ptn,
uint8_t *location, enum MOVE_DIRECTION *direction,
uint8_t *steps, uint8_t drops[5]) {
ASSERT_NONEMPTY;
uint8_t picked_up = 0;
if ( (*ptn >= '1') && (*ptn <= '0' + board_size)) {
picked_up = *ptn - '0';
ptn++; ASSERT_MORE;
}
if ( (*ptn < 'a') || (*ptn > '`' + board_size) ) return PTN_INVALID;
*location = *ptn - 'a';
ptn++; ASSERT_MORE;
if ( (*ptn < '1') || (*ptn > board_size + '0') ) return PTN_INVALID;
*location += board_size * (*ptn - '1');
ptn++; ASSERT_MORE;
switch (*ptn) {
case '+': { *direction = M_UP; break; }
case '-': { *direction = M_DOWN; break; }
case '<': { *direction = M_LEFT; break; }
case '>': { *direction = M_RIGHT; break; }
default: return PTN_INVALID;
}
ptn++; ASSERT_MORE;
*steps = 0;
uint8_t total = 0;
while (*ptn) {
if ( (*ptn < '1') || (*ptn > '0' + board_size) ) {
return PTN_INVALID;
}
// TODO: Correct?
if ( (*steps >= board_size) && *ptn) return PTN_INVALID;
drops[*steps] = *ptn - '0';
total += drops[*steps];
*steps += 1;
ptn++;
}
if ( (picked_up > 0) && (total != picked_up) ) return PTN_INVALID;
return PTN_VALID;
}
|
