forked from accreator/xl-engine
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathxl_ai.cpp
2702 lines (2397 loc) · 50.2 KB
/
xl_ai.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
/*
Copyright (C) 2005-2014 Chengtao Chen
Copyright (C) 2014 Kai Sun
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#define _CRT_SECURE_NO_WARNINGS
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>
#include "pisqpipe.h"
#include "xl_def.h"
#include "xl_ai.h"
// config
#define HASHTT_SIZE _16M
#define VC4TT_SIZE _4M
#define HASH_KEY uint32_t
#define MAX_VC4_NODE 10000
#define NOR_VC4_NODE 10000
#define MAX_SEARCH_NODE 2147483647
#define MAX_DEPTH 18
#define EXT_DEPTH 3
// value table
static char _vtable[2][18]=
{
//dead|1|2|d3|pp|3 |3p|33 |d4|d4p|??|43 |433|44 |4 |5 |L |F
{ 0 ,0,0, 0, 1,5,15,10 ,10,15 ,0 ,10 ,10 ,10 ,10,20,0 , 0 },
{ 0 ,0,0, 0, 1,5,15,-10,10,15 ,0 ,10 ,-10,-10,-10,20,-10,-10}
};
// hash table
typedef struct tagVC4TTITEM
{
HASH_KEY key;
char value;
char p;
}
VC4TTITEM;
#define HTTEXACT 0
#define HTTALPHA 1
#define HTTBETA 2
typedef struct tagHASHTTITEM
{
HASH_KEY key;
char depth;
char std_depth;
char value;
uint8_t flag;
}
HASHTTITEM;
// history table
typedef struct tagHISTORYNODE
{
uint8_t p;
uint32_t value;
struct tagHISTORYNODE *pLeft;
struct tagHISTORYNODE *pRight;
}
HISTORYNODE;
#define ATT_5 5
#define ATT_4 4
#define ATT_0 0
static VC4TTITEM _VC4TT[2][VC4TT_SIZE];
static HASHTTITEM _hashTT[HASHTT_SIZE];
static uint32_t _node;
static uint32_t _vc4_node;
static uint32_t _block_node;
static uint32_t _vc4_limit;
static uint8_t _max_num;
static uint8_t _start_num;
static uint8_t _best_p;
static uint8_t _vc4_p;
static char _root_depth;
static char _std_depth;
static HISTORYNODE* _historyTable[2][256]; // history table
static HISTORYNODE* _historyOrder[2]; //history order
#ifdef _LDBG
int _dbg_vc4tt_hit;
int _dbg_hashtt_hit;
int _dbg_level_hit[20];
int _dbg_eveluate;
#endif
// control
static volatile int _cancel = 0;
static volatile int _working = 0;
static volatile int _initialized = 0;
// board
static uint8_t _com;
static uint8_t _num; // stone count
static uint8_t _layer1[256]; // (Black,White,Empty)
static uint8_t _layer2[2][4][256]; // 4, 3 etc.
static uint8_t _layer3[2][256]; // 43, 44 etc.
static int _att[2][18];
static uint8_t _p5[2];
static RECT8 _activeRect[BW*BW+1];
static uint8_t _moves[BW * BW];
uint8_t _BEGIN[4][256];
uint8_t _END[4][256];
uint8_t _PLUS[4] = {1, 16, 15, 17};
//hash
static uint32_t _hashIndex;
static HASH_KEY _hashCheck;
//2层->3层映射表
static uint8_t _L2toL3[2][65536];
//Zobrist 数组
static uint32_t _Z_Index[2][256];
static HASH_KEY _Z_Check[2][256];
//棋型缓存
uint8_t *_cache[2][BW + 1];
///////////////////////////////////////////////////////
/// 把五子棋的某一行里的一个有效的区域截出来
/// 用二进制表示成 ABCCCCC 的形式作为第一个参数
/// 其中A为左边界 B为右边界 0--被堵住 1--不被堵住
/// CCCCC为棋型 1--有子 2--无子
/// 第二个参数数所求点的坐标
/// 返回值 0--死点 1--1|d2 2--2 3--d3
/// 4--三 5--冲四 6-d4p 7--活四 8-五 *9-长连 *10-四四
/// 低位在右
uint8_t _xl_gene[128][5]=
{
{1,1,1,1,1},// ----- 0
{1,2,2,2,0},// ----0 1
{2,2,2,0,2},// ---0- 2
{3,4,4,0,0},// ---00 3
{2,2,0,2,2},// --0-- 4
{3,4,0,4,0},// --0-0 5
{4,4,0,0,4},// --00- 6
{6,7,0,0,0},// --000 7
{2,0,2,2,2},// -0--- 8
{3,0,4,4,0},// -0--0 9
{4,0,4,0,4},// -0-0- 10
{5,0,7,0,0},// -0-00 11
{4,0,0,4,4},// -00-- 12
{6,0,0,7,0},// -00-0 13
{7,0,0,0,7},// -000- 14
{8,0,0,0,0},// -0000 15
{0,2,2,2,1},// 0---- 16
{0,3,3,3,0},// 0---0 17
{0,4,4,0,3},// 0--0- 18
{0,5,6,0,0},// 0--00 19
{0,4,0,4,3},// 0-0-- 20
{0,6,0,6,0},// 0-0-0 21
{0,7,0,0,6},// 0-00- 22
{0,8,0,0,0},// 0-000 23
{0,0,4,4,3},// 00--- 24
{0,0,6,5,0},// 00--0 25
{0,0,7,0,5},// 00-0- 26
{0,0,8,0,0},// 00-00 27
{0,0,0,7,6},// 000-- 28
{0,0,0,8,0},// 000-0 29
{0,0,0,0,8},// 0000- 30
{0,0,0,0,0},// 00000 31
//----------*2--------------
{1,1,1,1,0},// -----x 0
{1,1,1,1,0},// ----0x 1
{2,2,2,0,1},// ---0-x 2
{3,3,3,0,0},// ---00x 3
{2,2,0,2,1},// --0--x 4
{3,3,0,3,0},// --0-0x 5
{4,4,0,0,3},// --00-x 6
{5,5,0,0,0},// --000x 7
{2,0,2,2,1},// -0---x 8
{3,0,3,3,0},// -0--0x 9
{4,0,4,0,3},// -0-0-x 10
{5,0,5,0,0},// -0-00x 11
{4,0,0,4,3},// -00--x 12
{6,0,0,5,0},// -00-0x 13
{7,0,0,0,5},// -000-x 14
{8,0,0,0,0},// -0000x 15
{0,2,2,2,1},// 0----x 16
{0,3,3,3,0},// 0---0x 17
{0,4,4,0,3},// 0--0-x 18
{0,5,5,0,0},// 0--00x 19
{0,4,0,4,3},// 0-0--x 20
{0,6,0,5,0},// 0-0-0x 21
{0,7,0,0,5},// 0-00-x 22
{0,8,0,0,0},// 0-000x 23
{0,0,4,4,3},// 00---x 24
{0,0,6,5,0},// 00--0x 25
{0,0,7,0,5},// 00-0-x 26
{0,0,8,0,0},// 00-00x 27
{0,0,0,7,6},// 000--x 28
{0,0,0,8,0},// 000-0x 29
{0,0,0,0,8},// 0000-x 30
{0,0,0,0,0},// 00000x 31
//----------*3--------------
{0,1,1,1,1},// x----- 0
{1,2,2,2,0},// x----0 1
{1,2,2,0,2},// x---0- 2
{3,4,4,0,0},// x---00 3
{1,2,2,0,2},// x--0-- 4
{3,4,0,4,0},// x--0-0 5
{3,4,0,0,4},// x--00- 6
{6,7,0,0,0},// x--000 7
{1,0,2,2,2},// x-0--- 8
{3,0,4,4,0},// x-0--0 9
{3,0,4,0,4},// x-0-0- 10
{5,0,7,0,0},// x-0-00 11
{3,0,0,4,4},// x-00-- 12
{5,0,0,7,0},// x-00-0 13
{5,0,0,0,7},// x-000- 14
{8,0,0,0,0},// x-0000 15
{1,1,1,1,1},// x0---- 16
{0,3,3,3,0},// x0---0 17
{0,3,3,0,3},// x0--0- 18
{0,5,6,0,0},// x0--00 19
{0,3,0,3,3},// x0-0-- 20
{0,5,0,6,0},// x0-0-0 21
{0,5,0,0,6},// x0-00- 22
{0,8,0,0,0},// x0-000 23
{0,0,3,3,3},// x00--- 24
{0,0,5,5,0},// x00--0 25
{0,0,5,0,5},// x00-0- 26
{0,0,8,0,0},// x00-00 27
{0,0,0,5,5},// x000-- 28
{0,0,0,8,0},// x000-0 29
{0,0,0,0,8},// x0000- 30
{0,0,0,0,0},// x00000 31
//----------*4--------------
{0,0,0,0,0},// x-----x 0
{1,1,1,1,0},// x----0x 1
{1,1,1,0,1},// x---0-x 2
{3,3,3,0,0},// x---00x 3
{1,1,0,1,1},// x--0--x 4
{3,3,0,3,0},// x--0-0x 5
{3,3,0,0,3},// x--00-x 6
{5,5,0,0,0},// x--000x 7
{1,0,1,1,1},// x-0---x 8
{3,0,3,3,0},// x-0--0x 9
{3,0,3,0,3},// x-0-0-x 10
{5,0,5,0,0},// x-0-00x 11
{3,0,0,3,3},// x-00--x 12
{5,0,0,5,0},// x-00-0x 13
{5,0,0,0,5},// x-000-x 14
{8,0,0,0,0},// x-0000x 15
{0,1,1,1,1},// x0----x 16
{0,3,3,3,0},// x0---0x 17
{0,3,3,0,3},// x0--0-x 18
{0,5,5,0,0},// x0--00x 19
{0,3,0,3,3},// x0-0--x 20
{0,5,0,5,0},// x0-0-0x 21
{0,5,0,0,5},// x0-00-x 22
{0,8,0,0,0},// x0-000x 23
{0,0,3,3,3},// x00---x 24
{0,0,5,5,0},// x00--0x 25
{0,0,5,0,5},// x00-0-x 26
{0,0,8,0,0},// x00-00x 27
{0,0,0,5,5},// x000--x 28
{0,0,0,8,0},// x000-0x 29
{0,0,0,0,8},// x0000-x 30
{0,0,0,0,0},// x00000x 31
};
///////////////////////////////////////////////////////
char XlAlphaBeta(uint8_t side, char alpha, char beta, char depth,uint8_t att);
void XlReset();
void XlInitialize();
void InitBeginEnd();
bool XlIsF(uint8_t);
char QVC4_p(uint8_t p,uint8_t side,uint8_t def[][256]);
char QVC4(uint8_t side,uint8_t def[][256]);
char QVC3(uint8_t side,uint8_t depth);
char QVC3_p(uint8_t p,uint8_t side,uint8_t depth);
bool XlIsMakeVC4(uint8_t p, uint8_t side);
char XlEveluate( uint8_t side,uint8_t att);
char XlSimpleEveluate(uint8_t side);
void XlResetHistoryTable();
char XlBlockC4(uint8_t side,char alpha, char beta, char depth,uint8_t def[][256]);
//char Defend(uint8_t side,uint8_t def[][256]);
char XlReadHashTT(char alpha,char beta,char depth);
void XlWriteHashTT(char depth, char value, char flag);
/////////////////////////////////////////////////////////
void XlQuickSort(char A[],uint8_t move[],int low,int high)
{
char pivot;
uint8_t pivot_m;
int scanUp,scanDown;
int mid,k;
if(high-low<=0)
{
return;
}
else
{
if(high-low==1)
{
if(A[high]>A[low])
{
k=A[high];
A[high]=A[low];
A[low]=k;
k=move[high];
move[high]=move[low];
move[low]=k;
return;
}
}
}
mid=(low +high)/2;
pivot=A[mid];
pivot_m=move[mid];
k=A[mid];
A[mid]=A[low];
A[low]=k;
k=move[mid];
move[mid]=move[low];
move[low]=k;
scanUp =low+1;
scanDown = high;
do{
while(scanUp<=scanDown && A[scanUp]>=pivot)
scanUp++;
while(pivot>A[scanDown])
scanDown--;
if(scanUp<scanDown)
{
k=A[scanUp];
A[scanUp]=A[scanDown];
A[scanDown]=k;
k=move[scanUp];
move[scanUp]=move[scanDown];
move[scanDown]=k;
}
}while(scanUp<scanDown);
A[low]=A[scanDown];
A[scanDown]=pivot;
move[low]=move[scanDown];
move[scanDown]=pivot_m;
if(low<scanDown-1)
XlQuickSort(A,move,low,scanDown-1);
if(scanDown+1<high)
XlQuickSort(A,move,scanDown+1,high);
}
void XlReset()
{
int reset = !(_node == 0 && _vc4_node == 0 && _block_node == 0);
memset(_layer1, Empty, sizeof(_layer1));
memset(_layer2, FSP_1, sizeof(_layer2));
memset(_layer3, FMP_1, sizeof(_layer3));
memset(_att,0,sizeof(_att));
_num = 0;
// _num4[0]=0;
// _num4[1]=0;
_hashIndex=0;
_hashCheck=0;
if(reset)
XlResetHistoryTable();
_node=0;
_vc4_node=0;
_block_node=0;
_vc4_p=0xff;
#ifdef _XLDEBUG
_dbg_hashtt_hit=0;
// _dbg_max_depth=0;
memset(_dbg_level_hit,0,sizeof(_dbg_level_hit));
_dbg_eveluate=0;
#endif
}
void XlInitBeginEnd()
{
uint8_t x, y, p;
for (p = 0; p < 255; p++)
{
x = POSX(p);
y = POSY(p);
_BEGIN[0][p] = x;
_BEGIN[1][p] = y * 16;
_BEGIN[2][p] = MIN(BW - x - 1, y) * 15;
_BEGIN[3][p] = MIN(x, y) * 17;
_END[0][p] = BW - x - 1;
_END[1][p] = (BW - y - 1) * 16;
_END[2][p] = MIN(x, BW - y - 1) * 15;
_END[3][p] = MIN(BW - x - 1, BW - y - 1) * 17;
}
}
void XlInitL2toL3()
{
uint8_t side, *p;
uint32_t n0, n1, n2, n3, idx;
// TRACE("initializing
// mapping
// table...");
for (side = 0; side <= 1; side++)
{
for (n0 = 0; n0 < 11; n0++)
for (n1 = 0; n1 < 11; n1++)
for (n2 = 0; n2 < 11; n2++)
for (n3 = 0; n3 < 11; n3++)
{
int CountOfType[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0};
CountOfType[n0]++;
CountOfType[n1]++;
CountOfType[n2]++;
CountOfType[n3]++;
idx = n0;
idx |= n1 << 4;
idx |= n2 << 8;
idx |= n3 << 12;
// TRACE("idx=%d",idx);
p = &(_L2toL3[side][idx]);
if (side == Black)
{
if (CountOfType[FSP_5])
{
*p = FMP_5;
}
else if (CountOfType[FSP_L])
*p = FMP_L;
else if (CountOfType[FSP_44]
|| CountOfType[FSP_4] + CountOfType[FSP_d4]+CountOfType[FSP_d4p]>= 2)
{
*p = FMP_44;
}
else if ((CountOfType[FSP_d4] || CountOfType[FSP_4]||CountOfType[FSP_d4p])
&& CountOfType[FSP_3] >= 2)
{
*p = FMP_433;
}
else if (CountOfType[FSP_3] >= 2)
{
*p = FMP_33;
}
else if (CountOfType[FSP_4])
{
*p = FMP_4;
}
else if ((CountOfType[FSP_d4] || CountOfType[FSP_4] ||CountOfType[FSP_d4p])
&& CountOfType[FSP_3])
{
*p = FMP_43;
}
else if (CountOfType[FSP_d4p]||CountOfType[FSP_d4] && (CountOfType[FSP_2] || CountOfType[FSP_d3]))
{
*p = FMP_d4p;
}
else if (CountOfType[FSP_d4])
{
*p = FMP_d4;
}
else if (CountOfType[FSP_3] && (CountOfType[FSP_2]
|| CountOfType[FSP_d3]))
{
*p = FMP_3p;
}
else if (CountOfType[FSP_3])
*p = FMP_3;
else if (CountOfType[FSP_2] + CountOfType[FSP_d3] >= 2)
*p = FMP_pp;
else if (CountOfType[FSP_d3])
*p = FMP_d3;
else if (CountOfType[FSP_2])
*p = FMP_2;
else if (CountOfType[FSP_1])
*p = FMP_1;
else
*p = FMP_DEAD;
}
else // 白方
{
if (CountOfType[FSP_5] || CountOfType[FSP_L])
{
*p = FMP_5;
}
else if (CountOfType[FSP_44]
|| CountOfType[FSP_4] + CountOfType[FSP_d4]+CountOfType[FSP_d4p] >= 2)
{
*p = FMP_44;
}
else if (CountOfType[FSP_4])
{
*p = FMP_4;
}
else if ((CountOfType[FSP_d4] ||CountOfType[FSP_d4p])&& CountOfType[FSP_3])
{
*p = FMP_43;
}
else if (CountOfType[FSP_d4p]||CountOfType[FSP_d4] && (CountOfType[FSP_2]|| CountOfType[FSP_d3]))
{
*p = FMP_d4p;
}
else if (CountOfType[FSP_d4])
{
*p = FMP_d4;
}
else if (CountOfType[FSP_3] >= 2)
{
*p = FMP_33;
}
else if (CountOfType[FSP_3] && (CountOfType[FSP_2]
|| CountOfType[FSP_d3]))
{
*p = FMP_3p;
}
else if (CountOfType[FSP_3])
*p = FMP_3;
else if (CountOfType[FSP_2] + CountOfType[FSP_d3] >= 2)
*p = FMP_pp;
else if (CountOfType[FSP_d3])
*p = FMP_d3;
else if (CountOfType[FSP_2])
*p = FMP_2;
else if (CountOfType[FSP_1])
*p = FMP_1;
else
*p = FMP_DEAD;
}
}
}
// TRACE("done.\n");
}
void XlInitZobrist()
{
int i;
uint8_t *p = (uint8_t *) _Z_Index;
for (i = 0; i < sizeof(_Z_Index); i++)
{
p[i] = rand() & 0xFF;
}
p = (uint8_t *) _Z_Check;
for (i = 0; i < sizeof(_Z_Check); i++)
{
p[i] = rand() & 0xFF;
}
// TRACE("done.\n");
}
void XlInitCacheLine(uint8_t * dst, uint32_t src, char len, uint8_t side,bool reverse)
{
#define _STONE(n) ((src>>(n))&1)
char n, i, blank, blank1dis;
uint8_t idx, j, m, temp[15];
uint32_t rev;
// 0100101001001000 B
// ....|<->|.......
// |idx|<- n ->
memset(dst, 0, len);
for (n = 0; (n + 4) < len; n++)
{
if (n > 0 && side)
if (_STONE(n - 1))
continue;
blank = 0;
idx = 0;
for (i = 0; i < 5; i++)
{
if (_STONE(n + i))
{
idx |= 1 << (4 - i);
}
else
{
blank++;
if (blank == 1)
blank1dis = i;
}
}
if (n + 5 < len && _STONE(n + 5) && side)
{
// 这个区右边还有棋子
if (blank == 1)
dst[n + blank1dis] = FSP_L; // 长连
}
else if (n + 5 < len && !_STONE(n + 5) && side && blank == 0)
{
dst[n + 5] = FSP_L;
}
else
{
if (n == 0)
idx |= 64;
else
{
if (_STONE(n - 1))
idx |= 64; // 左边界
else if (n > 1 && side)
if (_STONE(n - 2))
idx |= 64;
}
if (n + 5 >= len)
idx |= 32;
else
{
if (_STONE(n + 5))
idx |= 32; // 右边界
else if (n + 6 < len)
if (_STONE(n + 6) && side)
idx |= 32; // 右边界
}
for (i = 0; i < 5; i++)
{
j = _xl_gene[idx][i];
m = dst[n + i];
if ((j == FSP_d4|| j==FSP_d4p) && (m == FSP_d4||m == FSP_d4p))
dst[n + i] = FSP_44;
else if(j == FSP_d4 && m == FSP_d3 || m == FSP_d4 && j == FSP_d3)
dst[n + i] = FSP_d4p;
else if (j > m)
dst[n + i] = j;
}
}
if (blank >= 1)
n += blank1dis;
// 与反向计算一起防止白重复算4和漏算
}
if (side || !reverse)
return;
// 反向算一次
rev = 0;
for (i = 0; i < len; i++)
if (_STONE(i))
rev |= 1 << (len - i - 1);
XlInitCacheLine(temp, rev, len, side, false);
for (i = 0; i < len; i++)
if (dst[i] < temp[len - i - 1])
dst[i] = temp[len - i - 1];
}
int XlInitCache()
{
char side, n;
uint32_t idx, pow_n;
for (n = 0; n <= BW; n++)
{
_cache[0][n] = 0;
_cache[1][n] = 0;
}
for (side = 0; side <= 1; side++)
{
for (n = 5; n <= BW; n++)
{
pow_n = 1 << n;
_cache[side][n] = (uint8_t *)malloc(n * pow_n);
if (!_cache[side][n])
{
XlDispose();
return 0;
}
for (idx = 0; idx < pow_n; idx++)
{
XlInitCacheLine((_cache[side][n]) + idx * n, idx, n, side, true);
}
}
}
return 1;
}
void XlUpdateL2Area(uint8_t p, char line, char len, uint8_t side)
{
uint8_t plus, p1, *l2, *pC;
char n;
uint32_t idx;
plus = _PLUS[line];
l2 = _layer2[side][line];
if (len < 5)
{
// <5的死区，将L2清0
for (n = 0; n < len; n++)
{
if (l2[p])
{
//L2清0
l2[p] = 0;
idx = (uint32_t) _layer2[side][0][p];
idx |= ((uint32_t) _layer2[side][1][p]) << 4;
idx |= ((uint32_t) _layer2[side][2][p]) << 8;
idx |= ((uint32_t) _layer2[side][3][p]) << 12;
_att[side][_layer3[side][p]]--;
// if(_layer3[side][p]>=FMP_d4) _num4[side]--;
_layer3[side][p] = _L2toL3[side][idx];
_att[side][_layer3[side][p]]++;
if(_layer3[side][p]==FMP_5) _p5[side]=p;
}
p += plus;
}
}
else
{
uint32_t area = 0;
p1 = p;
for (n = 0; n < len; n++)
{
if (_layer1[p1] == side)
area |= 0x00000001 << n;
p1 += plus;
}
pC = _cache[side][len];
pC += len * area;
for (n = 0; n < len; n++)
{
if (l2[p] != *pC)
{
l2[p] = *pC;
idx = (uint32_t) _layer2[side][0][p];
idx |= ((uint32_t) _layer2[side][1][p]) << 4;
idx |= ((uint32_t) _layer2[side][2][p]) << 8;
idx |= ((uint32_t) _layer2[side][3][p]) << 12;
_att[side][_layer3[side][p]]--;
// if(_layer3[side][p]>=FMP_d4) _num4[side]--;
_layer3[side][p] = _L2toL3[side][idx];
_att[side][_layer3[side][p]]++;
if(_layer3[side][p]==FMP_5) _p5[side]=p;
}
p += plus;
pC++;
}
}
}
void XlPutStoneLine(uint8_t p, char line, uint8_t side)
{
uint8_t begin, end, left, right, plus;
char len;
plus = _PLUS[line];
// 找到行的开始和结尾
begin = p - _BEGIN[line][p];
end = p + _END[line][p];
///////////////////////////////////////////
// v
// X O X X O X O X
// [ area1 ]
// [ area2 ] [ area3 ]
//////////////////////////////////////////
// area1
for (left = p; left != begin; left -= plus)
if (_layer1[left - plus] == !side)
break;
for (right = p; right != end; right += plus)
if (_layer1[right + plus] == !side)
break;
len = (right - left) / plus + 1;
XlUpdateL2Area(left, line, len, side);
// area2
for (left = p; left != begin; left -= plus)
if (_layer1[left - plus] == side)
break;
len = (p - left) / plus;
XlUpdateL2Area(left, line, len, OPP(side));
// area3
for (right = p; right != end; right += plus)
if (_layer1[right + plus] == side)
break;
len = (right - p) / plus;
XlUpdateL2Area((uint8_t)(p + plus), line, len, OPP(side));
}
void XlPutStone(uint8_t p, uint8_t side)
{
char x,y,left,right,top,bottom;
uint8_t pre;
_layer1[p] = side;
_hashIndex ^= _Z_Index[side][p];
_hashCheck ^= _Z_Check[side][p];
_moves[_num] = p;
_num++;
//更新hotRect
#define HOTRECT_RANGE 2
x=POSX(p);
y=POSY(p);
pre =_num -1;
left = x - HOTRECT_RANGE;
top = y - HOTRECT_RANGE;
right = x+ HOTRECT_RANGE;
bottom = y + HOTRECT_RANGE;
//添加
_activeRect[_num].left = left <_activeRect[pre].left? left :_activeRect[pre].left;
_activeRect[_num].top= top < _activeRect[pre].top ?top :_activeRect[pre].top;
_activeRect[_num].right = right >_activeRect[pre].right ? right : _activeRect[pre].right;
_activeRect[_num].bottom = bottom > _activeRect[pre].bottom? bottom :_activeRect[pre].bottom;
//越界剪裁
if(_activeRect[_num].left <0 ) _activeRect[_num].left =0;
if(_activeRect[_num].top <0 ) _activeRect[_num].top = 0;
if(_activeRect[_num].right >= BW ) _activeRect[_num].right= BW-1;
if(_activeRect[_num].bottom >=BW )_activeRect[_num].bottom = BW-1;
XlPutStoneLine(p, 0, side);
XlPutStoneLine(p, 1, side);
XlPutStoneLine(p, 2, side);
XlPutStoneLine(p, 3, side);
// update the site where put stone, it is not part of any area
/* _layer2[side][0][p] = FSP_DEAD;
_layer2[side][1][p] = FSP_DEAD;
_layer2[side][2][p] = FSP_DEAD;
_layer2[side][3][p] = FSP_DEAD;
_att[side][_layer3[side][p]] --;
_layer3[side][p] = FMP_DEAD;
_att[side][FMP_DEAD] ++;
*/
_layer2[OPP(side)][0][p] = FSP_DEAD;
_layer2[OPP(side)][1][p] = FSP_DEAD;
_layer2[OPP(side)][2][p] = FSP_DEAD;
_layer2[OPP(side)][3][p] = FSP_DEAD;
_att[OPP(side)][_layer3[OPP(side)][p]] --;
// if(_layer3[side][p]>=FMP_d4) _num4[side]--;
_layer3[OPP(side)][p] = FMP_DEAD;
_att[OPP(side)][FMP_DEAD] ++;
}
void XlRemoveStoneLine(uint8_t p, char line, uint8_t side)
{
uint8_t begin, end, left, right, plus;
char len;
plus = _PLUS[line];
// 找到行的开始和结尾
begin = p - _BEGIN[line][p];
end = p + _END[line][p];
///////////////////////////////////////////////
// O
// XO X X O ^ X O X
// [ area1,W ]
// [ area2,B ]
///////////////////////////////////////////////
for (left = p; left != begin; left -= plus)
{
if (_layer1[left - plus] == !side)
break;
}
for (right = p; right != end; right += plus)
{
if (_layer1[right + plus] == !side)
break;
}
len = (right - left) / plus + 1;
XlUpdateL2Area(left, line, len, side);
// area2
for (left = p; left != begin; left -= plus)
{
if (_layer1[left - plus] == side)
break;
}
for (right = p; right != end; right += plus)
{
if (_layer1[right + plus] == side)
break;
}
len = (right - left) / plus + 1;
XlUpdateL2Area(left, line, len, OPP(side));
}
void XlRemoveStone()
{
// 不做合法性判断
// char line;
uint8_t p, side;
p = _moves[_num - 1];
side = _layer1[p];
_num--;
_hashIndex ^= _Z_Index[side][p];
_hashCheck ^= _Z_Check[side][p];
_layer1[p] = Empty;
XlRemoveStoneLine(p, 0, side);
XlRemoveStoneLine(p, 1, side);
XlRemoveStoneLine(p, 2, side);
XlRemoveStoneLine(p, 3, side);
}
//只有黑棋才判断真三
bool XlIsTrue3(uint8_t p, char line)
{
uint8_t begin, end, left, right, plus;
if (_layer2[Black][line][p] != FSP_3)
return false;
XlPutStone(p, Black);
plus = _PLUS[line];
begin = p - _BEGIN[line][p];
end = p + _END[line][p];
for (left = p; left != begin && _layer1[left] != White; left -= plus)
{
if (_layer1[left] == Empty)
{
if (_layer2[Black][line][left] == FSP_4)
{
if (!XlIsF(left))
{
XlRemoveStone();
return true;
}
}
break;
}
}