-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathclass.go
175 lines (163 loc) · 2.74 KB
/
class.go
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
package fm3
type V struct {
c int // delta column
r int // delta row
}
func newV(c, r int) V {
return V{
c: c,
r: r,
}
}
type Name int
const (
NONE = Name(0)
FU = Name(1)
TO = Name(2)
KY = Name(3)
NKY = Name(4)
KE = Name(5)
NKE = Name(6)
GI = Name(7)
NGI = Name(8)
KI = Name(9)
KA = Name(10)
UM = Name(11)
HI = Name(12)
RY = Name(13)
OU = Name(14)
)
type Class struct {
name Name
leap []V // hither's point of view ex. FU: (0, -1)
ride []V
king bool
unpromote Name // unpromoted name or empty
promote Name // promoted name or empty
}
var kinLeap = []V{
newV(1, -1), newV(0, -1), newV(-1, -1),
newV(1, 0), /* */ newV(-1, 0),
/* */ newV(0, 1),
}
var toLetter = map[Name]string {
NONE: "・",
FU : "歩",
TO : "と",
KY : "香",
NKY : "杏",
KE : "桂",
NKE : "圭",
GI : "銀",
NGI : "全",
KI : "金",
KA : "角",
UM : "馬",
HI : "飛",
RY : "竜",
OU : "玉",
}
var fromLetter = reverse((map[Name]string)(toLetter))
func reverse(map[Name]string) map[string]Name {
res := make(map[string]Name)
for n, l := range toLetter {
res[l] = n
}
return res
}
var toClass = map[Name]*Class {
FU: &Class {
name: FU,
leap: []V{newV(0, -1)},
promote: TO,
},
TO: &Class {
name: TO,
leap: kinLeap,
unpromote: FU,
},
KY: &Class {
name: KY,
ride: []V{newV(0, -1)},
promote: NKY,
},
NKY: &Class {
name: NKY,
leap: kinLeap,
unpromote: KY,
},
KE: &Class {
name: KE,
leap: []V{newV(1, -2), newV(-1, -2)},
promote: NKE,
},
NKE: &Class {
name: NKE,
leap: kinLeap,
unpromote: KE,
},
GI: &Class {
name: GI,
leap: []V{
newV(1, -1), newV(0, -1), newV(-1, -1),
//
newV(1, 1), /* */ newV(-1, 1),
},
promote: NGI,
},
NGI: &Class {
name: NGI,
leap: kinLeap,
unpromote: GI,
},
KI: &Class {
name: KI,
leap: kinLeap,
},
KA: &Class {
name: KA,
ride: []V{
newV(1, -1), newV(-1, -1),
newV(1, 1), newV(-1, 1),
},
promote: UM,
},
UM: &Class {
name: UM,
leap: []V{newV(0, -1), newV(1, 0), newV(-1, 0), newV(0, 1)},
ride: []V{
newV(1, -1), newV(-1, -1),
newV(1, 1), newV(-1, 1),
},
unpromote: KA,
},
HI: &Class {
name: HI,
ride: []V{newV(0, -1), newV(1, 0), newV(-1, 0), newV(0, 1)},
promote: RY,
},
RY: &Class {
name: RY,
ride: []V{newV(0, -1), newV(1, 0), newV(-1, 0), newV(0, 1)},
leap: []V{
newV(1, -1), newV(-1, -1),
newV(1, 1), newV(-1, 1),
},
unpromote: HI,
},
OU: &Class {
name: OU,
leap: []V{
newV(1, -1), newV(0, -1), newV(-1, -1),
newV(1, 0), /* */ newV(-1, 0),
newV(1, 1), newV(0, 1), newV(-1, 1),
},
king: true,
},
}
func (n Name) class() *Class {
return toClass[n]
}
func (n Name) letter() string {
return toLetter[n]
}