-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathYizhong.cpp
1216 lines (1168 loc) · 38.6 KB
/
Yizhong.cpp
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
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "mahjong.h"
YiZhongChecker specialYiZhong[] = {
{
"国士无双十三面", GUO_SHI_WU_SHUANG_SHI_SAN_MIAN, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (!(isYaoJiu(t)) || p.mingTiles.size() != 0 || p.anGangTiles.size() != 0)
return FanFu({}, 0, 0, 0);
string test = "";
for (auto & x : p.handTiles) {
if (!(isYaoJiu(x)))
return FanFu({}, 0, 0, 0);
test += x;
}
if (test != "B1B9T1T9W1W9Z1Z2Z3Z4Z5Z6Z7")
return FanFu({}, 0, 0, 0);
return FanFu({ GUO_SHI_WU_SHUANG_SHI_SAN_MIAN }, 26, 0, 0);
}
},
{
"国士无双", GUO_SHI_WU_SHUANG, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (!(isYaoJiu(t)) || p.mingTiles.size() != 0 || p.anGangTiles.size() != 0)
return FanFu({}, 0, 0, 0);
string test = "";
for (auto & x : p.handTiles) {
if (!(isYaoJiu(x)))
return FanFu({}, 0, 0, 0);
test += x;
}
if (test == "B1B9T1T9W1W9Z1Z2Z3Z4Z5Z6Z7")
return FanFu({}, 0, 0, 0);
vector<string> hc = p.handTiles;
hc.push_back(t);
vector<string>::iterator it = unique(hc.begin(), hc.end());
hc.erase(it, hc.end());
sort(hc.begin(), hc.end());
test = "";
for (auto & x : hc) {
test += x;
}
if (test != "B1B9T1T9W1W9Z1Z2Z3Z4Z5Z6Z7")
return FanFu({}, 0, 0, 0);
return FanFu({ GUO_SHI_WU_SHUANG }, 13, 0, 0);
}
},
{
"七对子", QI_DUI_ZI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.anGangTiles.size() || p.mingTiles.size())
return FanFu({}, 0, 0, 0);
map<string, int> countNum;
countNum.insert(make_pair(t, 1));
for (auto & x : p.handTiles) {
auto it = countNum.find(x);
if (it != countNum.end())
it->second++;
else
countNum.insert(make_pair(x, 1));
}
for (auto & x : countNum) {
if (x.second != 2)
return FanFu({}, 0, 0, 0);
}
return FanFu({ QI_DUI_ZI }, 2, 25, 0);
}
},
};
YiZhongChecker yakumanYiZhong[] = {
{
"四暗刻单骑", SI_AN_KE_DAN_QI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.mingTiles.size() != 0)
return FanFu({}, 0, 0, 0);
int tmp = 0;
string last = "";
bool flag = true;
for (auto & x : p.handTiles) {
if (last == x)
tmp++;
else {
if (tmp == 2 || tmp == 4 || (tmp == 1 && last != t))
return FanFu({}, 0, 0, 0);
tmp = 1;
last = x;
}
}
return FanFu({ SI_AN_KE_DAN_QI }, 26, 0, 0);
}
},
{
"纯正九莲宝灯", CHUN_ZHENG_JIU_LIAN_BAO_DENG, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.mingTiles.size() != 0 || p.anGangTiles.size() != 0)
return FanFu({}, 0, 0, 0);
vector<string> hc = p.ownTiles;
vector<vector<int> > nums = string_to_34_tiles(hc, true);
int type_of_tiles;
for (type_of_tiles = 0; type_of_tiles < 3; type_of_tiles++)
if (nums[type_of_tiles][10] == 13)
break;
string strT = "BTWZ";
if (type_of_tiles == 3 || t[0] != strT[type_of_tiles])
return FanFu({}, 0, 0, 0);
if (nums[type_of_tiles][1] != 3 || nums[type_of_tiles][9] != 3)
return FanFu({}, 0, 0, 0);
for (int i = 2; i <= 8; i++)
if (nums[type_of_tiles][i] != 1)
return FanFu({}, 0, 0, 0);
return FanFu({ CHUN_ZHENG_JIU_LIAN_BAO_DENG }, 26, 0, 0);
}
},
{
"大四喜", DA_SI_XI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 大四喜需要有东南西北四种刻子 Z 1234每种牌都需要有3张及以上
// 另外还需要有将牌，将牌可以是任意的
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (int idx = 1; idx <= 4; idx++)
if (nums[3][idx] < 3)
return FanFu({}, 0, 0, 0);
int num_of_pair = 0;
for (int type_of_tiles = 0; type_of_tiles < 3; type_of_tiles++)
for (int idx = 1; idx <= 9; idx++)
num_of_pair += (nums[type_of_tiles][idx] == 2);
for (int idx = 5; idx <= 7; idx++)
num_of_pair += (nums[3][idx] == 2);
return num_of_pair == 1 ? FanFu({ DA_SI_XI }, 26, 0, 0) : FanFu({}, 0, 0, 0);
}
},
{
"四暗刻", SI_AN_KE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.mingTiles.size() != 0 || p.pos != pid)
return FanFu({}, 0, 0, 0);
// 要和四暗刻单骑区分开来；这种情况下只能自摸，否则以三暗刻算
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
int countKeZi = 0, countPair = 0;
for (int type_of_tiles = 0; type_of_tiles < 4; type_of_tiles++)
for (int idx = 1; idx <= 9; idx++) {
if (nums[type_of_tiles][idx] >= 3)
countKeZi++;
else if (nums[type_of_tiles][idx] == 2)
countPair++;
else if (nums[type_of_tiles][idx] == 1)
return FanFu({}, 0, 0, 0);
}
if (countKeZi == 4 && countPair == 1)
return FanFu({ SI_AN_KE }, 13, 0, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"九莲宝灯", JIU_LIAN_BAO_DENG, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.mingTiles.size() != 0 || p.anGangTiles.size() != 0)
return FanFu({}, 0, 0, 0);
vector<string> hc = p.ownTiles;
vector<vector<int> > nums = string_to_34_tiles(hc, true);
int type_of_tiles = getTypeOfTile(t[0]);
if (nums[type_of_tiles][10] != 13 || type_of_tiles == 3)
return FanFu({}, 0, 0, 0);
bool flag = true;
if (nums[type_of_tiles][1] != 3 || nums[type_of_tiles][9] != 3)
flag = false;
for (int i = 2; i <= 8; i++)
if (nums[type_of_tiles][i] != 1)
flag = false;
if (flag)
return FanFu({}, 0, 0, 0);
hc.push_back(t);
nums = string_to_34_tiles(hc, true);
if ((nums[type_of_tiles][1] > 3 && nums[type_of_tiles][9] > 3) ||
nums[type_of_tiles][1] < 3 || nums[type_of_tiles][9] < 3)
return FanFu({}, 0, 0, 0);
else if (nums[type_of_tiles][1] == 3 && nums[type_of_tiles][9] == 3) {
int cnt = 0;
for (int i = 2; i <= 8; i++) {
if (nums[type_of_tiles][i] == 0 || nums[type_of_tiles][i] > 2)
return FanFu({}, 0, 0, 0);
else if (nums[type_of_tiles][i] == 2)
cnt++;
}
if (cnt != 1)
return FanFu({}, 0, 0, 0);
}
else {
for (int i = 2; i <= 8; i++)
if (nums[type_of_tiles][i] != 1)
return FanFu({}, 0, 0, 0);
}
return FanFu({ JIU_LIAN_BAO_DENG }, 13, 0, 0);
}
},
{
"天和", TIAN_HU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 第一巡亲家自摸胡牌
if (p.pos != 0 || p.pos != pid || p.mingTiles.size() != 0 || p.anGangTiles.size() != 0 || p.outTiles.size() != 0)
return FanFu({}, 0, 0, 0);
return FanFu({ TIAN_HU }, 13, 0, 0);
}
},
{
"地和", DI_HU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 第一巡闲家在没有人鸣牌时自摸胡牌
if (p.pos == 0 || p.pos != pid || p.mingTiles.size() != 0 || p.anGangTiles.size() != 0 || p.outTiles.size() != 0 || isMingPai)
return FanFu({}, 0, 0, 0);
return FanFu({ DI_HU }, 13, 0, 0);
}
},
{
"字一色", ZI_YI_SE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 字一色由 东南西北白发中 七种牌组成
if (t[0] != 'Z')
return FanFu({}, 0, 0, 0);
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (int type_of_tiles = 0; type_of_tiles < 3; type_of_tiles++)
if (nums[type_of_tiles][10])
return FanFu({}, 0, 0, 0);
// check QI_DUI_ZI
if (p.anGangTiles.size() == 0 && p.mingTiles.size() == 0) {
bool flag = true;
for (int idx = 1; idx <= 7; idx++)
if (nums[3][idx] != 2)
flag = false;
if (flag)
return FanFu({ ZI_YI_SE }, 13, 0, 0);
}
// check usual
int countKeZi = 0, countPair = 0;
for (int idx = 1; idx <= 7; idx++) {
if (nums[3][idx] >= 3)
countKeZi++;
else if (nums[3][idx] == 2)
countPair++;
else if (nums[3][idx] == 1)
return FanFu({}, 0, 0, 0);
}
if (countKeZi == 4 && countPair == 1)
return FanFu({ ZI_YI_SE }, 13, 0, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"绿一色", LV_YI_SE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 绿一色由 T2 T3 T4 T6 T8 Z6 条23468和发 六种牌组成 (type_of_tiles = 1 or 3)
// 绿一色肯定不能是七对子，只能是常见胡牌牌型
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[1][1] || nums[1][5] || nums[1][7] || nums[1][9]
|| nums[0][10] || nums[2][10] || (nums[3][6] != nums[3][10]))
return FanFu({}, 0, 0, 0);
return FanFu({ LV_YI_SE }, 13, 0, 0);
}
},
{
"清老头", QING_LAO_TOU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 清老头由 B1 B9 T1 T9 W1 W9 六种牌组成，也不可能是七对子
// 没有顺子，只能是刻子
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][10]) // 不能有字牌
return FanFu({}, 0, 0, 0);
int countKeZi = 0, countPair = 0;
for (int type_of_tiles = 0; type_of_tiles < 3; type_of_tiles++) {
if (nums[type_of_tiles][1] + nums[type_of_tiles][9] != nums[type_of_tiles][10])
return FanFu({}, 0, 0, 0);
countKeZi += (nums[type_of_tiles][1] >= 3) + (nums[type_of_tiles][9] >= 3);
countPair += (nums[type_of_tiles][1] == 2) + (nums[type_of_tiles][9] == 2);
if (nums[type_of_tiles][1] == 1 || nums[type_of_tiles][9] == 1)
return FanFu({}, 0, 0, 0);
}
return FanFu({ QING_LAO_TOU }, 13, 0, 0);
}
},
{
"大三元", DA_SAN_YUAN, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 收集了三元牌的三组刻子或杠子，另外还有一个面子，然后是雀头
// 三元牌不能做雀头
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][5] < 3 || nums[3][6] < 3 || nums[3][7] < 3)
return FanFu({}, 0, 0, 0);
return FanFu({ DA_SAN_YUAN }, 13, 0, 0);
}
},
{
"四杠子", SI_GANG_ZI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 进行了四次杠操作，暗杠、大明杠均可，所以手里只有单张牌了
if (p.handTiles.size() != 1)
return FanFu({}, 0, 0, 0);
int timesGang = p.anGangTiles.size();
for (auto & x : p.mingTiles) {
if (x.size() == 4)
timesGang++;
else
return FanFu({}, 0, 0, 0);
}
if (timesGang == 4 && p.handTiles[0] == t)
return FanFu({ SI_GANG_ZI }, 13, 0, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"小四喜", XIAO_SI_XI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 东南西北其中的3种以刻子（或者杠子）存在，剩下的一种作雀头的和了形式。
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
int countKeZi = 0, countPair = 0;
for (int idx = 1; idx <= 4; idx++) {
countKeZi += nums[3][idx] >= 3;
countPair += nums[3][idx] == 2;
if (nums[3][idx] == 1)
return FanFu({}, 0, 0, 0);
}
if (countKeZi == 3 && countPair == 1)
return FanFu({ XIAO_SI_XI }, 13, 0, 0);
return FanFu({}, 0, 0, 0);
}
},
};
YiZhongChecker usualYiZhong[] = {
{
"清一色", QING_YI_SE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 清一色不能含有字牌，所以只考虑BTW。七对子已经考虑在其中
int baseFan = 6;
if (p.mingTiles.size() > 0)
baseFan--;
char c = t[0];
if (c == 'Z')
return FanFu({}, 0, 0, 0);
int typeT = getTypeOfTile(c);
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[typeT][10] != hc.size())
return FanFu({}, 0, 0, 0);
return FanFu({ QING_YI_SE }, baseFan, 0, 0);
}
},
{
"二杯口", ER_BEI_KOU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.anGangTiles.size() != 0 || p.mingTiles.size() != 0 || partition.empty())
return FanFu({}, 0, 0, 0);
int type_of_tiles = 0;
vector<vector<string>> vecTiles(3); // 取每个顺子的第一张
for (auto & x : partition) {
if (x.type == "KEZI")
return FanFu({}, 0, 0, 0);
if (x.type == "JIANG")
continue;
type_of_tiles = getTypeOfTile(x.part[0][0]);
vecTiles[type_of_tiles].push_back(x.part[0]);
}
for (int i = 0; i < 3; i++) {
if (vecTiles[i].size() == 2) {
if (vecTiles[i][0] != vecTiles[i][1])
return FanFu({}, 0, 0, 0);
}
else if (vecTiles[i].size() == 4) {
sort(vecTiles[i].begin(), vecTiles[i].end());
if (vecTiles[i][0] != vecTiles[i][1] || vecTiles[i][2] != vecTiles[i][3])
return FanFu({}, 0, 0, 0);
}
else
return FanFu({}, 0, 0, 0);
}
return FanFu({ ER_BEI_KOU }, 3, 0, 0);
}
},
{
"纯全带幺九", CHUN_QUAN_DAI_YAO_JIU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 面子只能是111(1),123,999(9),789，雀头只能是11,99，不可能是七对子
// 和清老头区别开来，纯全带幺九一定含有顺子
if (t[0] == 'Z' || partition.empty())
return FanFu({}, 0, 0, 0);
int baseFan = 3;
if (p.mingTiles.size())
baseFan--;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][10])
return FanFu({}, 0, 0, 0);
int type_of_tile = getTypeOfTile(t[0]);
for (auto & tiles : p.anGangTiles)
if (!isYaoJiu(tiles[0]))
return FanFu({}, 0, 0, 0);
for (auto & tiles : p.mingTiles)
if (!isYaoJiu(tiles[0]) && !isYaoJiu(tiles[2]))
return FanFu({}, 0, 0, 0);
int fu = 0;
int cntShunZi = 0;
for (auto & x : partition) {
cntShunZi += x.type == "SHUNZI";
if (x.type == "JIANG" || x.type == "KEZI") {
if (!isYaoJiu(x.part[0]))
return FanFu({}, 0, 0, 0);
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 8;
else if (nums[type_of_tile][t[1] - '0'] == 4)
fu += 8;
else // 刻子形成如果是来自他人，则算为明刻
fu += 4;
}
}
else if (!isYaoJiu(x.part[0]) && !isYaoJiu(x.part[2]))
return FanFu({}, 0, 0, 0);
}
if (cntShunZi == 0)
return FanFu({}, 0, 0, 0);
return FanFu({ CHUN_QUAN_DAI_YAO_JIU }, baseFan, fu, 0);
}
},
{
"混一色", HUN_YI_SE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
// 去除清一色
if (nums[3][10] == 0)
return FanFu({}, 0, 0, 0);
int baseFan = 3;
if (p.mingTiles.size())
baseFan--;
int type_of_tiles; // 确定染的是哪一个色
for (type_of_tiles = 0; type_of_tiles < 3; type_of_tiles++) {
if (nums[type_of_tiles][10])
break;
}
int tmp = hc.size() - nums[3][10];
if (tmp != nums[type_of_tiles][10])
return FanFu({}, 0, 0, 0);
// 有可能是七对子
if (p.mingTiles.size() == 0 && p.anGangTiles.size() == 0) {
int cnt = 0;
for (int j = 1; j <= 9; j++)
if (nums[type_of_tiles][j] == 2)
cnt++;
for (int j = 1; j <= 7; j++)
if (nums[3][j] == 2)
cnt++;
if (cnt == 7)
return FanFu({ HUN_YI_SE }, 3, 0, 0);
}
int fu = 0;
for (auto & x : partition) {
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (t[0] != 'Z' && nums[type_of_tiles][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
}
return FanFu({ HUN_YI_SE }, baseFan, fu, 0);
}
},
{
"双立直", SHUANG_LI_ZHI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 待判断
// 在第一巡手上牌已经听牌，且之前没有人鸣牌
if (p.mingTiles.size() != 0 || p.anGangTiles.size() != 0 || isMingPai || !p.isLiZhi)
return FanFu({}, 0, 0, 0);
if (p.numLiZhi == 1)
return FanFu({ SHUANG_LI_ZHI }, 2, 0, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"混全带幺九", HUN_QUAN_DAI_YAO_JIU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 需要和纯全带幺九、混老头等分开来。混全带幺九+七对子=混老头
int baseFan = 2;
if (p.mingTiles.size())
baseFan--;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
// 去除纯全带。混全一定存在顺子
if (nums[3][10] == 0 || partition.empty())
return FanFu({}, 0, 0, 0);
// 去除混老头
int cntShunZi = 0;
for (auto & x : partition)
cntShunZi += x.type == "SHUNZI";
if (cntShunZi == 0)
return FanFu({}, 0, 0, 0);
for (auto & tiles : p.anGangTiles)
if (!isYaoJiu(tiles[0]))
return FanFu({}, 0, 0, 0);
for (auto & tiles : p.mingTiles)
if (!isYaoJiu(tiles[0]) && !isYaoJiu(tiles[2]))
return FanFu({}, 0, 0, 0);
int type_of_tile = getTypeOfTile(t[0]);
int fu = 0;
for (auto & x : partition) {
if (x.type == "JIANG" || x.type == "KEZI") {
if (!isYaoJiu(x.part[0]))
return FanFu({}, 0, 0, 0);
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 8;
else if (type_of_tile != 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 8;
else // 刻子形成如果是来自他人，则算为明刻
fu += 4;
}
}
else if (!isYaoJiu(x.part[0]) && !isYaoJiu(x.part[2]))
return FanFu({}, 0, 0, 0);
}
return FanFu({ HUN_QUAN_DAI_YAO_JIU }, baseFan, fu, 0);
}
},
{
"三色同顺", SAN_SE_TONG_SHUN, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
int baseFan = 2;
if (p.mingTiles.size())
baseFan--;
vector<vector<int>> nMin(3, vector<int>());
int type_of_tile, fu = 0;
for (auto & x : p.mingTiles) {
type_of_tile = getTypeOfTile(x[0][0]);
if (type_of_tile == 3)
continue;
if (x[0][1] != x[1][1])
nMin[type_of_tile].push_back(x[0][1] - '0');
}
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (type_of_tile == 3)
continue;
if (x.type == "SHUNZI")
nMin[type_of_tile].push_back(x.part[0][1] - '0');
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
}
int tmp;
for (int i = 0; i < 3; i++) {
if (nMin[i].size() == 0 || nMin[i].size() > 2)
return FanFu({}, 0, 0, 0);
if (nMin[i].size() == 1)
tmp = nMin[i][0];
}
for (int i = 0; i < 3; i++) {
auto it = find(nMin[i].begin(), nMin[i].end(), tmp);
if (it == nMin[i].end())
return FanFu({}, 0, 0, 0);
}
return FanFu({ SAN_SE_TONG_SHUN }, baseFan, fu, 0);
}
},
{
"对对和", DUI_DUI_HU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
int countPairs = 0;
for (auto & part : partition) {
countPairs += part.type == "JIANG";
}
if (countPairs >= 2)
return FanFu({}, 0, 0, 0);
int fu = 0;
for (auto & tiles : p.mingTiles) {
if (tiles[0][1] != tiles[1][1])
return FanFu({}, 0, 0, 0);
}
for (auto & x : partition) {
if (x.type == "SHUNZI")
return FanFu({}, 0, 0, 0);
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
}
return FanFu({ DUI_DUI_HU }, 2, fu, 0);
}
},
{
"三暗刻", SAN_AN_KE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 三暗刻发生在anGangTiles和handTiles中
// 另外还有一个面子和对子
if (p.mingTiles.size() > 1 || partition.empty())
return FanFu({}, 0, 0, 0);
int countAnKe = p.anGangTiles.size(), fu = 0, type_of_tile = getTypeOfTile(t[0]);
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (auto & x : partition) {
if (x.type == "SHUNZI" || x.type == "JIANG")
continue;
if (pid == p.pos || x.part[0] != t) {
countAnKe++;
fu += 4 + 4 * isYaoJiu(x.part[0]);
}
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4) {
countAnKe++;
fu += 4 + 4 * isYaoJiu(x.part[0]);
}
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
if (countAnKe == 3)
return FanFu({ SAN_AN_KE }, 2, fu, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"三杠子", SAN_GANG_ZI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
// 三杠子要在鸣牌和暗杠里找。
int countGangZi = p.anGangTiles.size(), fu = 0, type_of_tile = getTypeOfTile(t[0]);
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (auto & x : p.mingTiles) {
if (x.size() == 4)
countGangZi++;
}
for (auto & x : partition) {
if (x.type == "SHUNZI" || x.type == "JIANG")
continue;
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
if (countGangZi == 3)
return FanFu({ SAN_GANG_ZI }, 2, fu, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"三色同刻", SAN_SE_TONG_KE, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
// 和三色同顺类似，需要找到最少花色的一种牌
int fu = 0, type_of_tile;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
vector<vector<int> > cntNum(3, vector<int>());
for (auto & x : p.anGangTiles) {
type_of_tile = getTypeOfTile(x[0][0]);
if (type_of_tile == 3)
continue;
cntNum[type_of_tile].push_back(x[0][1] - '0');
}
for (auto & x : p.mingTiles) {
type_of_tile = getTypeOfTile(x[0][0]);
if (type_of_tile == 3 || x[0][1] != x[1][1])
continue;
cntNum[type_of_tile].push_back(x[0][1] - '0');
}
for (auto & x : partition) {
if (x.type == "SHUNZI" || x.type == "JIANG")
continue;
type_of_tile = getTypeOfTile(x.part[0][0]);
if (type_of_tile < 3)
cntNum[type_of_tile].push_back(x.part[0][1] - '0');
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
int tmp = 0;
for (int i = 0; i < 3; i++) {
if (cntNum[i].size() == 0 || cntNum[i].size() > 2)
return FanFu({}, 0, 0, 0);
if (cntNum[i].size() == 1)
tmp = cntNum[i][0];
}
for (int i = 0; i < 3; i++) {
auto it = find(cntNum[i].begin(), cntNum[i].end(), tmp);
if (it == cntNum[i].end())
return FanFu({}, 0, 0, 0);
}
return FanFu({ SAN_SE_TONG_KE }, 2, fu, 0);
}
},
{
"混老头", HUN_LAO_TOU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 混老头只能用BTW的19和字牌
int fu = 0, type_of_tile;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][10] == 0) // 去除清老头
return FanFu({}, 0, 0, 0);
// 有可能是七对子
if (p.mingTiles.size() == 0 && p.anGangTiles.size() == 0) {
int cnt = 0;
for (int i = 0; i < 3; i++)
cnt += (nums[i][1] == 2) + (nums[i][9] == 2);
for (int i = 1; i <= 7; i++)
cnt += (nums[3][i] == 2);
if (cnt == 7)
return FanFu({ HUN_LAO_TOU }, 2, 0, 0);
}
for (int i = 0; i < 3; i++)
if (nums[i][1] + nums[i][9] != nums[i][10])
return FanFu({}, 0, 0, 0);
for (auto & x : partition) {
if (x.type == "KEZI") {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (pid == p.pos || x.part[0] != t)
fu += 8;
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 8;
else // 刻子形成如果是来自他人，则算为明刻
fu += 4;
}
}
return FanFu({ HUN_LAO_TOU }, 2, fu, 0);
}
},
{
"小三元", XIAO_SAN_YUAN, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
// 小三元指的是白发中有两个刻子，剩下的一个当雀头。
int fu = 0, type_of_tile;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
int countKeZi = 0, countPair = 0;
for (int idx = 5; idx <= 7; idx++) {
countKeZi += nums[3][idx] >= 3;
countPair += nums[3][idx] == 2;
}
for (auto & x : partition) {
if (x.type == "SHUNZI" || x.type == "JIANG")
continue;
type_of_tile = getTypeOfTile(x.part[0][0]);
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
if (countKeZi == 2 && countPair == 1)
return FanFu({ XIAO_SAN_YUAN }, 2, fu, 0);
return FanFu({}, 0, 0, 0);
}
},
{
"一气通贯", YI_QI_TONG_GUAN, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (partition.empty())
return FanFu({}, 0, 0, 0);
// 判断比较很简单。是数量最多的花色，至少有9张。不可能出现这个花色的暗杠，因为顺子需要
int baseFan = 2, type_of_tile, fu = 0, obj;
if (p.mingTiles.size())
baseFan--;
vector<int> cntNum;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (obj = 0; obj < 3; obj++)
if (nums[obj][10] >= 9)
break;
if (obj == 3)
return FanFu({}, 0, 0, 0);
for (auto & x : p.mingTiles) {
type_of_tile = getTypeOfTile(x[0][0]);
if (type_of_tile == 3 || x[0][1] == x[1][1] || obj != type_of_tile)
continue;
cntNum.push_back(x[0][1] - '0');
}
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (x.type == "JIANG")
continue;
else if (x.type == "SHUNZI") {
if (obj == type_of_tile)
cntNum.push_back(x.part[0][1] - '0');
}
else {
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
}
for (int i = 1; i <= 7; i += 3)
if (find(cntNum.begin(), cntNum.end(), i) == cntNum.end())
return FanFu({}, 0, 0, 0);
return FanFu({ YI_QI_TONG_GUAN }, baseFan, fu, 0);
}
},
{
"立直", LI_ZHI, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.isLiZhi) {
if (p.mingTiles.size() == 0 && p.anGangTiles.size() == 0 && !isMingPai && p.numLiZhi == 1)
return FanFu({}, 0, 0, 0);
int type_of_tile, fu = 0;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (x.type != "KEZI")
continue;
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
return FanFu({ LI_ZHI }, 1, fu, 0);
}
return FanFu({}, 0, 0, 0);
}
},
{
"一发", YI_FA, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 要先加入胡牌判断。并且需要查看立直、出牌历史
// 不与岭上开花复合
if (!p.isLiZhi || !p.isYiFa)
return FanFu({}, 0, 0, 0);
return FanFu({ YI_FA }, 1, 0, 0);// 一发一定有立直，所以不重复计算符数
}
},
{
"门前清自摸", MEN_QIAN_QING_ZI_MO, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
if (p.pos != pid || p.mingTiles.size() > 0)
return FanFu({}, 0, 0, 0);
int type_of_tile, fu = 0;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (x.type != "KEZI")
continue;
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
return FanFu({ MEN_QIAN_QING_ZI_MO }, 1, fu, 0);
}
},
{
"平和", PING_HU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 四副顺子及序数牌或客风牌作将牌，胡牌时包含主风牌、场风牌和箭牌的将牌会增加符数，所以不能有
// 同样需要加入胡牌判断。最后必须是顺子的两面听，不能是边张、单钓中张或者是单骑听雀头。
// 在算符的时候，如果是门清自摸，则自摸的2符必须不计
if (p.anGangTiles.size() != 0 || partition.empty() || t[0] == 'Z') // 平和不能有暗杠 因为需要计算符数 t不能是字牌
return FanFu({}, 0, 0, 0);
// 没有确定门前清是为了计算符数。wiki上：平和在门前清时算一番；在副露下算两符
for (auto & x : p.mingTiles) {
if (isTileSame(x[0], x[1]))
return FanFu({}, 0, 0, 0);
}
// Z-p.pos,Z-p.changFeng,Z567的都不能有
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][10] >= 3 || nums[3][5] || nums[3][6] || nums[3][7] || nums[3][p.pos + 1] || nums[3][p.changFeng + 1])
return FanFu({}, 0, 0, 0);
int tmp = getTypeOfTile(t[0]);
// 不能是边张、单钓中张或者是单骑听雀头。
int res = checkTingType(hc, t, nums[tmp][10] % 3 == 2);
if ((res & 1) != 1)
return FanFu({}, 0, 0, 0);
if(p.pos == pid)
return FanFu({ PING_HU }, 1, 20, 0);
else
return FanFu({ PING_HU }, 1, 30, 0);
}
},
{
"断幺九", DUAN_YAO_JIU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
if (nums[3][10] || nums[0][1] || nums[1][1] || nums[2][1] || nums[0][9] || nums[1][9] || nums[2][9])
return FanFu({}, 0, 0, 0);
int type_of_tile, fu = 0;
// 有可能是七对子
if (p.mingTiles.size() == 0 && p.anGangTiles.size() == 0) {
int cnt = 0;
for (int i = 0; i < 3; i++)
for (int j = 2; j <= 8; j++)
cnt += (nums[i][j] == 2);
if (cnt == 7)
return FanFu({ DUAN_YAO_JIU }, 1, 0, 0);
}
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (x.type != "KEZI")
continue;
if (pid == p.pos || x.part[0] != t)
fu += 4;
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4;
else // 刻子形成如果是来自他人，则算为明刻
fu += 2;
}
return FanFu({ DUAN_YAO_JIU }, 1, fu, 0);
}
},
{
"一杯口", YI_BEI_KOU, [](const vector<Tiles>& partition, const Player& p, string t, int pid) -> FanFu {
// 要求门前清
if (p.mingTiles.size() != 0 || p.anGangTiles.size() > 2 || partition.empty())
return FanFu({}, 0, 0, 0);
int type_of_tile, fu = 0;
vector<string> hc = p.ownTiles;
hc.push_back(t);
vector<vector<int> > nums = string_to_34_tiles(hc, true);
vector<vector<int> > cntNum(3, vector<int>());
for (auto & x : partition) {
type_of_tile = getTypeOfTile(x.part[0][0]);
if (x.type == "SHUNZI")
cntNum[type_of_tile].push_back(x.part[0][1] - '0');
if (x.type == "KEZI") {
if (pid == p.pos || x.part[0] != t)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else if (type_of_tile < 3 && nums[type_of_tile][t[1] - '0'] == 4)
fu += 4 + 4 * isYaoJiu(x.part[0]);
else // 刻子形成如果是来自他人，则算为明刻
fu += 2 + 2 * isYaoJiu(x.part[0]);
}
}
int cnt = 0;
for (int i = 0; i < 3; i++) {
set<int> st(cntNum[i].begin(), cntNum[i].end());
for (auto & val : st)
cnt += count(cntNum[i].begin(), cntNum[i].end(), val) >= 2;
}