-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathMoveTreeBaseUnit.pas
1337 lines (1037 loc) · 34.4 KB
/
MoveTreeBaseUnit.pas
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
////////////////////////////////////////////////////////////////////////////////
// All code below is exclusively owned by author of Chess4Net - Pavel Perminov
// Any changes, modifications, borrowing and adaptation are a subject for
// explicit permition from the owner.
unit MoveTreeBaseUnit;
interface
uses
Classes, SysUtils, Contnrs,
//
ChessRulesEngine;
type
PDataBag = ^TDataBag;
TDataBag = packed object
public
btFirst: byte;
btSecond: byte;
private
function FEquals(const Other: TDataBag): boolean;
procedure FConvertFromMove(const AMove: TMoveAbs);
function FIsMove: boolean;
function FToMove: TMoveAbs;
function FConvertFromNearPointer(lwPointer: LongWord; out Data: TDataBag): boolean;
function FIsNearPointer: boolean;
function FToNearPointer: Word;
function FConvertFromFarPointer(lwPointer: LongWord; out HiData, LowData: TDataBag): boolean;
function FIsFarPointer: boolean;
function FToFarPointer(const HiData, LowData: TDataBag): LongWord;
function FIsEndDataTag: boolean;
end;
TMoveTreeStream = class
private
m_InnerStream: TStream;
m_wHeaderSize: Word;
m_iDBVersion: integer;
constructor FCreateFileStream(const BaseFileName: TFileName);
constructor FCreateMemoryStream;
function FGetSize: Int64;
procedure FSetDBVersion;
function FReadHeader(out wVersion: Word): boolean;
procedure FWriteHeader(const wVersion: Word);
public
constructor Create;
destructor Destroy; override;
function ReadBagFromStream(out ABag: TDataBag): boolean; overload;
function ReadBagFromStream(lwPosition: LongWord; out ABag: TDataBag): boolean; overload;
procedure WriteBagToStream(const ABag: TDataBag); overload;
procedure WriteBagToStream(lwPosition: LongWord; const ABag: TDataBag); overload;
procedure WriteBagToStreamEnd(const ABag: TDataBag);
property Size: Int64 read FGetSize;
end;
TMoveAbsArr = array of TMoveAbs;
TMovesDataIterator = class
private
m_Moves: TMoveAbsArr;
m_iIndex: integer;
constructor FCreate(const Moves: TMoveAbsArr);
public
constructor Create;
function HasNext: boolean;
function GetNextMove: TMoveAbs;
function GetLastMove: TMoveAbs;
function GetNextDataBag: TDataBag;
function GetLastDataBag: TDataBag;
end;
TInsertionPoint = object
public
lwAddress1: LongWord;
lwAddress2: LongWord;
private
procedure FInit(lwAddress: LongWord); overload;
procedure FInit(lwAAddress1, lwAAddress2: LongWord); overload;
end;
TMoveTreeAddress = packed object
public
lwPosition: LongWord;
wOffset: Word;
private
procedure FInit(lwAPosition: LongWord; wAOffset: Word);
public
function Equals(const Other: TMoveTreeAddress): boolean;
end;
TMoveTreeAddressArr = array of TMoveTreeAddress;
TPosAddressItem = class
private
m_Pos: TChessPosition;
m_Addresses: TMoveTreeAddressArr;
constructor FCreate(const APos: TChessPosition; const AAddress: TMoveTreeAddress);
procedure FAddAddress(const AAddress: TMoveTreeAddress);
property Pos: TChessPosition read m_Pos;
property Addresses: TMoveTreeAddressArr read m_Addresses;
public
constructor Create;
end;
TMoveTreeBaseCache = class
private
m_InitialPos: TChessPosition;
m_InitialAddress: TMoveTreeAddress;
m_Buckets: array of TObjectList;
constructor FCreate(const InitialPos: TChessPosition; const InitialAddress: TMoveTreeAddress);
procedure FAdd(const APos: TChessPosition; const AAddress: TMoveTreeAddress);
procedure FClearBuckets;
function FGetHashCode(const Pos: TChessPosition): integer;
function FGetBucketIndex(const Pos: TChessPosition): integer;
public
constructor Create;
destructor Destroy; override;
function Get(const APos: TChessPosition; out AAddresses: TMoveTreeAddressArr): boolean;
procedure Clear;
end;
TMovePosAddress = object
public
move: TMoveAbs;
pos: TChessPosition;
address: TMoveTreeAddress;
private
procedure FInit(const AMove: TMoveAbs; const APos: TChessPosition;
const AAddress: TMoveTreeAddress);
end;
TMovePosAddressArr = array of TMovePosAddress;
EMoveTreeBase = class(Exception);
TMoveTreeBase = class
private
m_BaseStream: TMoveTreeStream;
m_ChessRulesEngine: TChessRulesEngine;
m_PosCache: TMoveTreeBaseCache;
m_InitialPos: TChessPosition;
FOnAdded: TNotifyEvent;
constructor FCreate;
class function FGetBaseFileName(const strBaseName: string): TFileName;
procedure FSetOnAdded(OnAddedEvent: TNotifyEvent); // cannot be overriden
function FFindData(lwPosition: LongWord; const DataIterator: TMovesDataIterator;
out InsertionPoint: TInsertionPoint): boolean; overload;
procedure FFindData(const APos: TChessPosition; const Address: TMoveTreeAddress; out Datas: TMovePosAddressArr); overload;
procedure FSaveData(const InsertionPoint: TInsertionPoint; const DataIterator: TMovesDataIterator);
procedure FStartNearBranch(const InsertionPoint: TInsertionPoint; const Data: TDataBag);
procedure FStartFarBranch(const InsertionPoint: TInsertionPoint; const DataHi, DataLow: TDataBag);
procedure FDoAdded;
property ChessRulesEngine: TChessRulesEngine read m_ChessRulesEngine;
property BaseStream: TMoveTreeStream read m_BaseStream;
protected
constructor CreateForTest;
constructor CreateForTestFarJump;
public
constructor Create(const strBaseName: string);
destructor Destroy; override;
class function Exists(const strBaseName: string): boolean;
function Add(const Moves: TMoveAbsArr): boolean;
procedure Find(const Pos: TChessPosition; const Addresses: TMoveTreeAddressArr;
out Moves: TMoveAbsArr); overload;
procedure Find(const Pos: TChessPosition; out Moves: TMoveAbsArr); overload;
property OnAdded: TNotifyEvent write FSetOnAdded;
property PosCache: TMoveTreeBaseCache read m_PosCache;
end;
const
_TDataBag: PDataBag = nil; // helper
implementation
type
TDataFinder = class
private
m_Base: TMoveTreeBase;
m_lwPosition: LongWord;
m_lwLastPosition: LongWord;
function FReadBagFromStream(out ABag: TDataBag): boolean; overload;
function FReadBagFromStream(lwPosition: LongWord; out ABag: TDataBag): boolean; overload;
function FJumpNear(const Data: TDataBag; out NextDataBag: TDataBag): boolean;
function FJumpFar(const HiData: TDataBag; out NextDataBag: TDataBag): boolean;
property Base: TMoveTreeBase read m_Base;
protected
function RFind(lwPosition: LongWord): boolean;
function RIsDataFromJump: boolean;
function RF1(const DataBag: TDataBag): boolean; virtual; abstract;
function RF2(const DataBag: TDataBag): boolean; virtual; abstract;
function RF3: boolean; virtual; abstract;
procedure RP4; virtual; abstract;
procedure RP5; virtual;
property Position: LongWord read m_lwPosition;
property LastPosition: LongWord read m_lwLastPosition;
public
constructor Create(ABase: TMoveTreeBase);
end;
TInsertionPointDataFinder = class(TDataFinder)
private
m_DataIterator: TMovesDataIterator;
m_InsertionPoint: TInsertionPoint;
m_Address: TMoveTreeAddress;
protected
function RF1(const DataBag: TDataBag): boolean; override;
function RF2(const DataBag: TDataBag): boolean; override;
function RF3: boolean; override;
procedure RP4; override;
procedure RP5; override;
public
function Find(lwPosition: LongWord; const DataIterator: TMovesDataIterator;
out InsertionPoint: TInsertionPoint): boolean;
end;
TNextLinesBuilderDataFinder = class(TDataFinder)
private
m_Datas: TMovePosAddressArr;
m_wMovesCount: Word;
m_Address: TMoveTreeAddress;
function FGetChessRulesEngine: TChessRulesEngine;
procedure FCollectDatas;
function FF5(const DataBag: TDataBag; bJump: boolean): boolean;
property ChessRulesEngine: TChessRulesEngine read FGetChessRulesEngine;
protected
function RF1(const DataBag: TDataBag): boolean; override;
function RF2(const DataBag: TDataBag): boolean; override;
function RF3: boolean; override;
procedure RP4; override;
public
procedure Find(const APos: TChessPosition; const Address: TMoveTreeAddress;
out Datas: TMovePosAddressArr);
end;
TCoord = record
i, j: integer;
end;
const
BASE_FILE_EXT = 'mvt';
DB_VERSION = 1;
PROM_FIG_MARKER: array[TFigureName] of byte = ($00, $00, $40, $80, $C0, $00); // K, Q, R, B, N, P
MOVE_DATA_MARKER = $00;
MOVE_DATA_MASK = $3F;
NEAR_POINTER_DATA_MARKER = $80;
NEAR_POINTER_DATA_MASK = NEAR_POINTER_DATA_MARKER - 1;
FAR_POINTER_DATA_MARKER = $40;
FAR_POINTER_DATA_MASK = FAR_POINTER_DATA_MARKER - 1;
DATA_KIND_MASK = MOVE_DATA_MARKER or NEAR_POINTER_DATA_MARKER or FAR_POINTER_DATA_MARKER;
END_DATA_TAG: TDataBag = (btFirst: 0; btSecond: 0);
INITIAL_ADDRESS: TMoveTreeAddress = (lwPosition: 0; wOffset: 0);
CACHE_BUCKETS_SIZE = 119;
FIELD_SEQ: array[1..64] of TCoord = // 13617 kb
((i: 1; j: 1), (i: 1; j: 2), (i: 1; j: 3), (i: 1; j: 4),
(i: 1; j: 5), (i: 1; j: 6), (i: 1; j: 7), (i: 1; j: 8),
(i: 8; j: 8), (i: 8; j: 7), (i: 8; j: 6), (i: 8; j: 5),
(i: 8; j: 4), (i: 8; j: 3), (i: 8; j: 2), (i: 8; j: 1),
(i: 2; j: 1), (i: 2; j: 2), (i: 2; j: 3), (i: 2; j: 4),
(i: 2; j: 5), (i: 2; j: 6), (i: 2; j: 7), (i: 2; j: 8),
(i: 7; j: 8), (i: 7; j: 7), (i: 7; j: 6), (i: 7; j: 5),
(i: 7; j: 4), (i: 7; j: 3), (i: 7; j: 2), (i: 7; j: 1),
(i: 3; j: 1), (i: 3; j: 2), (i: 3; j: 3), (i: 3; j: 4),
(i: 3; j: 5), (i: 3; j: 6), (i: 3; j: 7), (i: 3; j: 8),
(i: 6; j: 8), (i: 6; j: 7), (i: 6; j: 6), (i: 6; j: 5),
(i: 6; j: 4), (i: 6; j: 3), (i: 6; j: 2), (i: 6; j: 1),
(i: 4; j: 1), (i: 4; j: 2), (i: 4; j: 3), (i: 4; j: 4),
(i: 4; j: 5), (i: 4; j: 6), (i: 4; j: 7), (i: 4; j: 8),
(i: 5; j: 1), (i: 5; j: 2), (i: 5; j: 3), (i: 5; j: 4),
(i: 5; j: 5), (i: 5; j: 6), (i: 5; j: 7), (i: 5; j: 8));
var
g_bFarPointerTests: boolean = FALSE;
////////////////////////////////////////////////////////////////////////////////
// TMoveTreeBase
constructor TMoveTreeBase.FCreate;
begin
inherited Create;
m_ChessRulesEngine := TChessRulesEngine.Create;
m_InitialPos := m_ChessRulesEngine.Position^;
m_PosCache := TMoveTreeBaseCache.FCreate(m_InitialPos, INITIAL_ADDRESS);
end;
constructor TMoveTreeBase.Create(const strBaseName: string);
begin
FCreate;
m_BaseStream := TMoveTreeStream.FCreateFileStream(FGetBaseFileName(strBaseName));
end;
constructor TMoveTreeBase.CreateForTest;
begin
FCreate;
m_BaseStream := TMoveTreeStream.FCreateMemoryStream;
end;
constructor TMoveTreeBase.CreateForTestFarJump;
begin
CreateForTest;
g_bFarPointerTests := TRUE;
end;
destructor TMoveTreeBase.Destroy;
begin
m_BaseStream.Free;
m_PosCache.Free;
m_ChessRulesEngine.Free;
inherited;
end;
class function TMoveTreeBase.Exists(const strBaseName: string): boolean;
begin
Result := FileExists(FGetBaseFileName(strBaseName));
end;
class function TMoveTreeBase.FGetBaseFileName(const strBaseName: string): TFileName;
begin
Result := strBaseName + '.' + BASE_FILE_EXT;
end;
function TMoveTreeBase.Add(const Moves: TMoveAbsArr): boolean;
var
Iterator: TMovesDataIterator;
InsertionPoint: TInsertionPoint;
begin
Result := FALSE;
m_PosCache.Clear;
if (Length(Moves) = 0) then
exit;
Iterator := TMovesDataIterator.FCreate(Moves);
try
if (FFindData(0, Iterator, InsertionPoint)) then
exit;
FSaveData(InsertionPoint, Iterator);
finally
Iterator.Free;
end;
FDoAdded;
Result := TRUE;
end;
procedure TMoveTreeBase.FSetOnAdded(OnAddedEvent: TNotifyEvent);
begin
if (not Assigned(self)) then
exit;
if (Assigned(FOnAdded) and Assigned(OnAddedEvent) and (@FOnAdded <> @OnAddedEvent)) then
raise EMoveTreeBase.Create('callback OnAdded() is already set')
else
FOnAdded := OnAddedEvent;
end;
procedure TMoveTreeBase.FDoAdded;
begin
if (Assigned(FOnAdded)) then
FOnAdded(self);
end;
function TMoveTreeBase.FFindData(lwPosition: LongWord;
const DataIterator: TMovesDataIterator; out InsertionPoint: TInsertionPoint): boolean;
begin
m_ChessRulesEngine.SetPosition(m_InitialPos);
with TInsertionPointDataFinder.Create(self) do
try
Result := Find(lwPosition, DataIterator, InsertionPoint);
finally
Free;
end;
end;
procedure TMoveTreeBase.FSaveData(const InsertionPoint: TInsertionPoint;
const DataIterator: TMovesDataIterator);
var
lwAddressOffset: LongWord;
DataOffsetHi, DataOffsetLow: TDataBag;
Address: TMoveTreeAddress;
bRes: boolean;
begin
lwAddressOffset := m_BaseStream.Size - (InsertionPoint.lwAddress2 - 1);
if (lwAddressOffset > 0) then
begin
if (_TDataBag.FConvertFromNearPointer(lwAddressOffset, DataOffsetLow)) then
FStartNearBranch(InsertionPoint, DataOffsetLow)
else if (_TDataBag.FConvertFromFarPointer(lwAddressOffset, DataOffsetHi, DataOffsetLow)) then
FStartFarBranch(InsertionPoint, DataOffsetHi, DataOffsetLow)
else
raise EMoveTreeBase.Create('Base file has become too big!');
end;
Address.FInit(m_BaseStream.Size, 0);
m_BaseStream.WriteBagToStreamEnd(DataIterator.GetLastDataBag);
while (DataIterator.HasNext) do
begin
with DataIterator.GetLastMove do
bRes := m_ChessRulesEngine.DoMove(i0, j0, i, j, prom_fig);
Assert(bRes);
inc(Address.wOffset);
m_PosCache.FAdd(m_ChessRulesEngine.Position^, Address);
m_BaseStream.WriteBagToStream(DataIterator.GetNextDataBag);
end;
m_BaseStream.WriteBagToStream(END_DATA_TAG);
m_BaseStream.WriteBagToStream(END_DATA_TAG); // a place holder for far jumps
end;
procedure TMoveTreeBase.FStartNearBranch(const InsertionPoint: TInsertionPoint;
const Data: TDataBag);
var
SavedData: TDataBag;
bRead: boolean;
begin
bRead := m_BaseStream.ReadBagFromStream(InsertionPoint.lwAddress1, SavedData);
Assert(bRead);
m_BaseStream.WriteBagToStreamEnd(SavedData);
m_BaseStream.WriteBagToStream(InsertionPoint.lwAddress1, Data);
end;
procedure TMoveTreeBase.FStartFarBranch(const InsertionPoint: TInsertionPoint;
const DataHi, DataLow: TDataBag);
var
SavedData1, SavedData2: TDataBag;
bRead: boolean;
begin
bRead := m_BaseStream.ReadBagFromStream(InsertionPoint.lwAddress1, SavedData1);
Assert(bRead);
bRead := m_BaseStream.ReadBagFromStream(InsertionPoint.lwAddress2, SavedData2);
Assert(bRead);
m_BaseStream.WriteBagToStreamEnd(SavedData1);
m_BaseStream.WriteBagToStream(SavedData2);
m_BaseStream.WriteBagToStream(InsertionPoint.lwAddress1, DataHi);
m_BaseStream.WriteBagToStream(InsertionPoint.lwAddress2, DataLow);
end;
procedure TMoveTreeBase.Find(const Pos: TChessPosition; out Moves: TMoveAbsArr);
var
Addresses: TMoveTreeAddressArr;
begin
if (m_PosCache.Get(Pos, Addresses)) then
Find(Pos, Addresses, Moves)
else
SetLength(Moves, 0);
end;
procedure TMoveTreeBase.Find(const Pos: TChessPosition;
const Addresses: TMoveTreeAddressArr; out Moves: TMoveAbsArr);
var
Datas: TMovePosAddressArr;
i, j: integer;
iMovesIndex: integer;
begin
SetLength(Moves, 0);
iMovesIndex := Low(Moves);
for i := Low(Addresses) to High(Addresses) do
begin
FFindData(Pos, Addresses[i], Datas);
SetLength(Moves, Length(Moves) + Length(Datas));
for j := Low(Datas) to High(Datas) do
begin
Moves[iMovesIndex] := Datas[j].move;
inc(iMovesIndex);
m_PosCache.FAdd(Datas[j].pos, Datas[j].address);
end;
end;
end;
procedure TMoveTreeBase.FFindData(const APos: TChessPosition;
const Address: TMoveTreeAddress; out Datas: TMovePosAddressArr);
begin
with TNextLinesBuilderDataFinder.Create(self) do
try
Find(APos, Address, Datas);
finally
Free;
end;
end;
////////////////////////////////////////////////////////////////////////////////
// TMovesDataIterator
constructor TMovesDataIterator.Create;
begin
raise Exception.Create(ClassName + ' cannot be instaniated directly!');
end;
constructor TMovesDataIterator.FCreate(const Moves: TMoveAbsArr);
begin
inherited Create;
m_Moves := Moves;
end;
function TMovesDataIterator.HasNext: boolean;
begin
Result := (m_iIndex < Length(m_Moves));
end;
function TMovesDataIterator.GetNextMove: TMoveAbs;
begin
Result := m_Moves[m_iIndex];
inc(m_iIndex);
end;
function TMovesDataIterator.GetLastMove: TMoveAbs;
begin
Result := m_Moves[m_iIndex - 1];
end;
function TMovesDataIterator.GetNextDataBag: TDataBag;
begin
Result.FConvertFromMove(GetNextMove);
end;
function TMovesDataIterator.GetLastDataBag: TDataBag;
begin
Result.FConvertFromMove(GetLastMove);
end;
////////////////////////////////////////////////////////////////////////////////
// TDataBag
procedure TDataBag.FConvertFromMove(const AMove: TMoveAbs);
begin
btFirst := ((AMove.j0 - 1) shl 3) or (AMove.i0 - 1);
btSecond := (((AMove.j - 1) shl 3) or (AMove.i - 1)) or PROM_FIG_MARKER[AMove.prom_fig];
end;
function TDataBag.FToMove: TMoveAbs;
const
COORD_MASK = $07;
PROM_FIG_MASK = $C0;
var
f: TFigureName;
begin
Result.i0 := (btFirst and COORD_MASK) + 1;
Result.j0 := ((btFirst shr 3) and COORD_MASK) + 1;
Result.i := (btSecond and COORD_MASK) + 1;
Result.j := ((btSecond shr 3) and COORD_MASK) + 1;
for f := Q to N do
begin
if (PROM_FIG_MARKER[f] = (btSecond and PROM_FIG_MASK)) then
begin
Result.prom_fig := f;
break;
end;
end;
end;
function TDataBag.FEquals(const Other: TDataBag): boolean;
begin
Result := ((btFirst = Other.btFirst) and (btSecond = Other.btSecond));
end;
function TDataBag.FIsMove: boolean;
const
_DATA_KIND_MASK = (DATA_KIND_MASK xor MOVE_DATA_MASK) and DATA_KIND_MASK;
begin
Result := (((btFirst and _DATA_KIND_MASK) = MOVE_DATA_MARKER) and
((btFirst and MOVE_DATA_MASK) <> btSecond));
end;
function TDataBag.FIsNearPointer: boolean;
const
_DATA_KIND_MASK = (DATA_KIND_MASK xor NEAR_POINTER_DATA_MASK) and DATA_KIND_MASK;
begin
Result := ((btFirst and _DATA_KIND_MASK) = NEAR_POINTER_DATA_MARKER);
end;
function TDataBag.FIsFarPointer: boolean;
const
_DATA_KIND_MASK = (DATA_KIND_MASK xor FAR_POINTER_DATA_MASK) and DATA_KIND_MASK;
begin
Result := ((btFirst and _DATA_KIND_MASK) = FAR_POINTER_DATA_MARKER);
end;
function TDataBag.FToNearPointer: Word;
begin
Result := ((btFirst and NEAR_POINTER_DATA_MASK) shl 8) or btSecond;
end;
function TDataBag.FToFarPointer(const HiData, LowData: TDataBag): LongWord;
begin
Result := ((((((HiData.btFirst and FAR_POINTER_DATA_MASK) shl 8) or HiData.btSecond) shl 8) or
LowData.btFirst) shl 8) or LowData.btSecond;
end;
function TDataBag.FConvertFromFarPointer(lwPointer: LongWord; out HiData, LowData: TDataBag): boolean;
const
MAX_VALUE = (FAR_POINTER_DATA_MARKER shl 24) - 1;
begin
Result := (lwPointer <= MAX_VALUE);
if (not Result) then
exit;
LowData.btSecond := lwPointer and $FF;
LowData.btFirst := (lwPointer shr 8) and $FF;
HiData.btSecond := (lwPointer shr 16) and $FF;
HiData.btFirst := ((lwPointer shr 24) and FAR_POINTER_DATA_MASK) or FAR_POINTER_DATA_MARKER;
end;
function TDataBag.FConvertFromNearPointer(lwPointer: LongWord; out Data: TDataBag): boolean;
const
MAX_VALUE = (NEAR_POINTER_DATA_MARKER shl 8) - 1;
begin
Result := (lwPointer <= MAX_VALUE) and (not g_bFarPointerTests);
if (not Result) then
exit;
Data.btSecond := lwPointer and $FF;
Data.btFirst := ((lwPointer shr 8) and NEAR_POINTER_DATA_MASK) or NEAR_POINTER_DATA_MARKER;
end;
function TDataBag.FIsEndDataTag: boolean;
begin
Result := ((btFirst = END_DATA_TAG.btFirst) and (btSecond = END_DATA_TAG.btSecond));
end;
////////////////////////////////////////////////////////////////////////////////
// TInsertionPoint
procedure TInsertionPoint.FInit(lwAddress: LongWord);
begin
lwAddress1 := lwAddress;
lwAddress2 := lwAddress;
end;
procedure TInsertionPoint.FInit(lwAAddress1, lwAAddress2: LongWord);
begin
lwAddress1 := lwAAddress1;
lwAddress2 := lwAAddress2;
end;
////////////////////////////////////////////////////////////////////////////////
// TMoveTreeBaseCache
constructor TMoveTreeBaseCache.Create;
begin
raise Exception.Create(ClassName + ' cannot be instaniated directly!');
end;
constructor TMoveTreeBaseCache.FCreate(const InitialPos: TChessPosition;
const InitialAddress: TMoveTreeAddress);
begin
inherited Create;
m_InitialPos := InitialPos;
m_InitialAddress := InitialAddress;
SetLength(m_Buckets, CACHE_BUCKETS_SIZE);
Clear;
end;
destructor TMoveTreeBaseCache.Destroy;
begin
FClearBuckets;
inherited;
end;
procedure TMoveTreeBaseCache.Clear;
begin
FClearBuckets;
FAdd(m_InitialPos, m_InitialAddress);
end;
procedure TMoveTreeBaseCache.FAdd(const APos: TChessPosition; const AAddress: TMoveTreeAddress);
var
iBucket: integer;
i: integer;
Item: TPosAddressItem;
begin
iBucket := FGetBucketIndex(APos);
if (not Assigned(m_Buckets[iBucket])) then
m_Buckets[iBucket] := TObjectList.Create;
for i := 0 to m_Buckets[iBucket].Count - 1 do
begin
Item := TPosAddressItem(m_Buckets[iBucket].Items[i]);
if (Item.Pos.Equals(APos)) then
begin
Item.FAddAddress(AAddress);
exit
end;
end;
m_Buckets[iBucket].Add(TPosAddressItem.FCreate(APos, AAddress));
end;
function TMoveTreeBaseCache.Get(const APos: TChessPosition; out AAddresses: TMoveTreeAddressArr): boolean;
var
iBucket: integer;
i: integer;
Item: TPosAddressItem;
begin
Result := FALSE;
iBucket := FGetBucketIndex(APos);
if (not Assigned(m_Buckets[iBucket])) then
exit;
for i := 0 to m_Buckets[iBucket].Count - 1 do
begin
Item := TPosAddressItem(m_Buckets[iBucket].Items[i]);
if (Item.Pos.Equals(APos)) then
begin
AAddresses := Item.Addresses;
Result := TRUE;
break;
end;
end;
end;
function TMoveTreeBaseCache.FGetBucketIndex(const Pos: TChessPosition): integer;
begin
Result := LongWord(FGetHashCode(Pos)) mod Length(m_Buckets);
end;
function TMoveTreeBaseCache.FGetHashCode(const Pos: TChessPosition): integer;
var
iMask: integer;
iHash1, iHash2: integer;
k: integer;
begin
if (Pos.color = fcBlack) then
iHash1 := 1
else
iHash1 := 0;
iMask := 2;
k := 1;
while ((iMask <> 0) and (k <= High(FIELD_SEQ))) do
begin
with FIELD_SEQ[k] do
begin
if (Pos.board[i, j] <> ES) then
iHash1 := iHash1 or iMask;
end;
iMask := iMask shl 1;
inc(k);
end;
iHash2 := 0;
iMask := 1;
k := 33;
while ((iMask <> 0) and (k <= High(FIELD_SEQ))) do
begin
with FIELD_SEQ[k] do
begin
if (Pos.board[i, j] <> ES) then
iHash2 := iHash2 or iMask;
end;
iMask := iMask shl 1;
inc(k);
end;
{$Q-}
Result := 19 * iHash2;
Result := Result + iHash1;
end;
procedure TMoveTreeBaseCache.FClearBuckets;
var
i: integer;
begin
for i := Low(m_Buckets) to High(m_Buckets) do
FreeAndNil(m_Buckets[i]);
end;
////////////////////////////////////////////////////////////////////////////////
// TPosAddressItem
constructor TPosAddressItem.Create;
begin
raise Exception.Create(ClassName + ' cannot be instaniated directly!');
end;
constructor TPosAddressItem.FCreate(const APos: TChessPosition; const AAddress: TMoveTreeAddress);
begin
inherited Create;
m_Pos := APos;
FAddAddress(AAddress);
end;
procedure TPosAddressItem.FAddAddress(const AAddress: TMoveTreeAddress);
var
i: integer;
begin
for i := Low(m_Addresses) to High(m_Addresses) do
begin
if (m_Addresses[i].Equals(AAddress)) then
exit;
end;
SetLength(m_Addresses, Length(m_Addresses) + 1);
m_Addresses[High(m_Addresses)] := AAddress;
end;
////////////////////////////////////////////////////////////////////////////////
// TMoveTreeAddress
procedure TMoveTreeAddress.FInit(lwAPosition: LongWord; wAOffset: Word);
begin
self.lwPosition := lwAPosition;
self.wOffset := wAOffset;
end;
function TMoveTreeAddress.Equals(const Other: TMoveTreeAddress): boolean;
begin
Result := ((lwPosition = Other.lwPosition) and (wOffset = Other.wOffset));
end;
////////////////////////////////////////////////////////////////////////////////
// TMovePosAddress
procedure TMovePosAddress.FInit(const AMove: TMoveAbs; const APos: TChessPosition;
const AAddress: TMoveTreeAddress);
begin
self.move := AMove;
self.pos := APos;
self.address := AAddress;
end;
////////////////////////////////////////////////////////////////////////////////
// TDataFinder
constructor TDataFinder.Create(ABase: TMoveTreeBase);
begin
inherited Create;
m_Base := ABase;
end;
function TDataFinder.FReadBagFromStream(out ABag: TDataBag): boolean;
begin
Result := m_Base.BaseStream.ReadBagFromStream(ABag);
end;
function TDataFinder.FReadBagFromStream(lwPosition: LongWord; out ABag: TDataBag): boolean;
begin
Result := m_Base.BaseStream.ReadBagFromStream(lwPosition, ABag);
end;
function TDataFinder.FJumpNear(const Data: TDataBag; out NextDataBag: TDataBag): boolean;
var
lwPositionBase, lwJumpPosition: LongWord;
DataBag: TDataBag;
bRead: boolean;
begin
lwPositionBase := m_lwPosition - 1;
lwJumpPosition := lwPositionBase + Data.FToNearPointer;
FReadBagFromStream(lwJumpPosition, DataBag);
Assert(DataBag.FIsMove or DataBag.FIsEndDataTag);
Result := RF1(DataBag);
if (Result) then
begin
m_lwLastPosition := m_lwPosition;
FReadBagFromStream(m_lwPosition, NextDataBag);
end
else
begin
bRead := FReadBagFromStream(NextDataBag);
Assert(bRead);
m_lwLastPosition := lwJumpPosition + 1;
end;
m_lwPosition := m_lwLastPosition + 1;
if (not Result) then
RP4;
end;
function TDataFinder.FJumpFar(const HiData: TDataBag; out NextDataBag: TDataBag): boolean;
var
LowData: TDataBag;
lwPositionBase, lwJumpPosition: LongWord;
DataBag: TDataBag;
bRead: boolean;
begin
lwPositionBase := m_lwPosition - 1;
FReadBagFromStream(m_lwPosition, LowData);
inc(m_lwPosition);
lwJumpPosition := lwPositionBase + _TDataBag.FToFarPointer(HiData, LowData);
FReadBagFromStream(lwJumpPosition, DataBag);
Assert(DataBag.FIsMove or DataBag.FIsEndDataTag);
FReadBagFromStream(NextDataBag);
m_lwLastPosition := lwJumpPosition + 1;
Result := RF1(DataBag);
if (Result) then
exit;
bRead := FReadBagFromStream(NextDataBag);
Assert(bRead);
inc(m_lwLastPosition);
m_lwPosition := m_lwLastPosition + 1;
RP4;
end;