forked from piaohua/mjalgorism
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ptn.rb
270 lines (258 loc) · 10.5 KB
/
ptn.rb
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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
#! /usr/bin/ruby
# 順列生成
class Array
def perms
return [[]] if empty?
uniq.inject([]) do |rs, h|
tmp = self.dup
tmp.delete_at(index(h))
rs + tmp.perms.map {|t| [h] + t }
end
end
def total
self.inject(0){|t,a| t += a}
end
end
# a : [[1,1,1], [1,1,1], [1,1,1], [1,1,1], [2]]
def ptn(a)
if a.size == 1 then
return [a]
end
ret = Array.new
# 重ならないパターン
ret += a.perms
# 重なるパターン
h1 = Hash.new
for i in 0..a.size-1
for j in i+1..a.size-1
key = [a[i], 0, a[j]].to_s
if !h1.key?(key) then
h1.store(key, nil)
h2 = Hash.new
# a[i]とa[j]を範囲をずらしながら重ねる
for k in 0..a[i].size+a[j].size
t = [0]*a[j].size + a[i] + [0]*a[j].size
for m in 0..a[j].size-1
t[k+m] += a[j][m]
end
# 余分な0を取り除く
t.delete(0)
# 4より大きい値がないかチェック
next if t.any? {|v| v > 4}
# 9より長くないかチェック
next if t.size >9
# 重複チェック
if !h2.key?(t.to_s) then
h2.store(t.to_s, nil)
# 残り
t2 = a.dup
t2.delete_at(i)
t2.delete_at(j-1)
# 再帰呼び出し
ret += ptn([t]+t2)
end
end
end
end
end
return ret
end
# キー値を計算
def calc_key(a)
ret = 0
len = -1
for b in a
for i in b
len += 1
case i
when 2 then
ret |= 0b11 << len
len += 2
when 3 then
ret |= 0b1111 << len
len += 4
when 4 then
ret |= 0b111111 << len
len += 6
end
end
ret |= 0b1 << len
len += 1
end
return ret
end
# a : [[1,1,1], [1,1,1], [1,1,1], [1,1,1], [2]]
# ret
# 下位
# 3bit 0: 刻子の数(0~4)
# 3bit 3: 順子の数(0~4)
# 4bit 6: 頭の位置(1~13)
# 4bit 10: 面子の位置1(0~13)
# 4bit 14: 面子の位置2(0~13)
# 4bit 18: 面子の位置3(0~13)
# 4bit 22: 面子の位置4(0~13)
# 1bit 26: 七対子フラグ
# 1bit 27: 九蓮宝燈フラグ
# 1bit 28: 一気通貫フラグ
# 1bit 29: 二盃口フラグ
# 1bit 30: 一盃口フラグ
def find_hai_pos(a)
ret_array = Array.new
p_atama = 0
for i in 0..a.size-1
for j in 0..a[i].size-1
# 頭を探す
if a[i][j] >= 2 then
# 刻子、順子の優先順位入れ替え
for kotsu_shuntus in 0..1
t = Marshal.load(Marshal.dump(a))
t[i][j] -= 2
p = 0
p_kotsu = Array.new
p_shuntsu = Array.new
for k in 0..t.size-1
for m in 0..t[k].size-1
if kotsu_shuntus == 0 then
# 刻子を先に取り出す
# 刻子
if t[k][m] >= 3 then
t[k][m] -= 3
p_kotsu.push(p)
end
# 順子
while t[k].size - m >= 3 &&
t[k][m] >= 1 &&
t[k][m+1] >= 1 &&
t[k][m+2] >= 1 do
t[k][m] -= 1
t[k][m+1] -= 1
t[k][m+2] -= 1
p_shuntsu.push(p)
end
else
# 順子を先に取り出す
# 順子
while t[k].size - m >= 3 &&
t[k][m] >= 1 &&
t[k][m+1] >= 1 &&
t[k][m+2] >= 1 do
t[k][m] -= 1
t[k][m+1] -= 1
t[k][m+2] -= 1
p_shuntsu.push(p)
end
# 刻子
if t[k][m] >= 3 then
t[k][m] -= 3
p_kotsu.push(p)
end
end
p += 1
end
end
# 上がりの形か?
if t.flatten.all? {|x| x==0 } then
# 値を求める
ret = p_kotsu.size + (p_shuntsu.size << 3) + (p_atama << 6)
len = 10
for x in p_kotsu
ret |= x << len
len += 4
end
for x in p_shuntsu
ret |= x << len
len += 4
end
if a.size == 1 then
# 九蓮宝燈フラグ
if a == [[4,1,1,1,1,1,1,1,3]] ||
a == [[3,2,1,1,1,1,1,1,3]] ||
a == [[3,1,2,1,1,1,1,1,3]] ||
a == [[3,1,1,2,1,1,1,1,3]] ||
a == [[3,1,1,1,2,1,1,1,3]] ||
a == [[3,1,1,1,1,2,1,1,3]] ||
a == [[3,1,1,1,1,1,2,1,3]] ||
a == [[3,1,1,1,1,1,1,2,3]] ||
a == [[3,1,1,1,1,1,1,1,4]] then
ret |= 1 << 27
end
end
# 一気通貫
if a.size <= 3 && p_shuntsu.size >= 3 then
p_ikki = 0
for b in a
if b.size == 9 then
b_ikki1 = false
b_ikki2 = false
b_ikki3 = false
for x_ikki in p_shuntsu
b_ikki1 |= (x_ikki == p_ikki)
b_ikki2 |= (x_ikki == p_ikki+3)
b_ikki3 |= (x_ikki == p_ikki+6)
end
if b_ikki1 && b_ikki2 && b_ikki3 then
ret |= 1 << 28
end
end
p_ikki += b.size
end
end
# 二盃口
if p_shuntsu.size == 4 &&
p_shuntsu[0] == p_shuntsu[1] &&
p_shuntsu[2] == p_shuntsu[3] then
ret |= 1 << 29
elsif p_shuntsu.size >= 2 && p_kotsu.size + p_shuntsu.size == 4 then
# 一盃口
if p_shuntsu.size - p_shuntsu.uniq.size >= 1 then
ret |= 1 << 30
end
end
ret_array.push(ret)
end
end
end
p_atama += 1
end
end
if ret_array.size > 0 then
ret_array.uniq!
return ret_array.inject("0x"+ret_array.shift.to_s(16)){|t,a| t += ","+"0x"+a.to_s(16)}
end
t = a.flatten
# 七対子判定
if t.total == 14 && t.all? {|x| x==2} then
return "0x"+(1 << 26).to_s(16)
end
end
chitoi = ptn([[2],[2],[2],[2],[2],[2],[2]])
chitoi.delete_if{|x|
t = x.flatten
t.any?{|y| y != 2}
}
(ptn([[1,1,1],[1,1,1],[1,1,1],[1,1,1],[2]]) +
ptn([[1,1,1],[1,1,1],[1,1,1],[3],[2]]) +
ptn([[1,1,1],[1,1,1],[3],[3],[2]]) +
ptn([[1,1,1],[3],[3],[3],[2]]) +
ptn([[3],[3],[3],[3],[2]]) +
chitoi).uniq.each do |x|
printf("tbl.put(0x%X, new int[] {%s});\n", calc_key(x), find_hai_pos(x))
end
(ptn([[1,1,1],[1,1,1],[1,1,1],[2]]) +
ptn([[1,1,1],[1,1,1],[3],[2]]) +
ptn([[1,1,1],[3],[3],[2]]) +
ptn([[3],[3],[3],[2]])).uniq.each do |x|
printf("tbl.put(0x%X, new int[] {%s});\n", calc_key(x), find_hai_pos(x))
end
(ptn([[1,1,1],[1,1,1],[2]]) +
ptn([[1,1,1],[3],[2]]) +
ptn([[3],[3],[2]])).uniq.each do |x|
printf("tbl.put(0x%X, new int[] {%s});\n", calc_key(x), find_hai_pos(x))
end
(ptn([[1,1,1],[2]]) +
ptn([[3],[2]])).uniq.each do |x|
printf("tbl.put(0x%X, new int[] {%s});\n", calc_key(x), find_hai_pos(x))
end
(ptn([[2]])).uniq.each do |x|
printf("tbl.put(0x%X, new int[] {%s});\n", calc_key(x), find_hai_pos(x))
end