-
Notifications
You must be signed in to change notification settings - Fork 2
/
Unit1.pas
3819 lines (3569 loc) · 99.5 KB
/
Unit1.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
// Copyright 2011,2012 by Wu Hon Sum
// 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 3 of the License, or
// 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, see <http://www.gnu.org/licenses/>.
//
// newsgroup:news://my.newsgroup.com.hk/welcome.sum
// forum http://home.i-cable.com/wu/
// movedlist may be wrong need remove later
unit Unit1;
{$MODE Delphi}
interface
uses
SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, ExtCtrls, StdCtrls, Menus,ComCtrls,MTProcs,lclintf,MTPCPU,ClipBrd;
const
inf = 10000;
type
Tboard=array[0..9,0..9] of integer;
Tmovelist = array[1..20] of integer;
type
{ TForm1 }
TForm1 = class(TForm)
apple: TImage;
Chess2: TImage;
Chess1: TImage;
HumanFirstButton: TMenuItem;
HumanVsHumanButton: TMenuItem;
ComputerFirstButton: TMenuItem;
AboutButton: TMenuItem;
RuleButton: TMenuItem;
RedChess: TImage;
BlackChess: TImage;
Image1: TImage;
Image2: TImage;
Image3: TImage;
Image4: TImage;
Image5: TImage;
Image6: TImage;
Image7: TImage;
Image8: TImage;
Image9: TImage;
Image10: TImage;
Image11: TImage;
Image12: TImage;
Image13: TImage;
Image14: TImage;
Image15: TImage;
Image16: TImage;
Image17: TImage;
Image18: TImage;
Image19: TImage;
Image20: TImage;
Image21: TImage;
Image22: TImage;
Image23: TImage;
Image24: TImage;
Image25: TImage;
Image26: TImage;
Image27: TImage;
Image28: TImage;
Image29: TImage;
Image30: TImage;
Image31: TImage;
Image32: TImage;
Image33: TImage;
Image34: TImage;
Image35: TImage;
Image36: TImage;
Image37: TImage;
Image38: TImage;
Image39: TImage;
Image40: TImage;
Image41: TImage;
Image42: TImage;
Image43: TImage;
Image44: TImage;
Image45: TImage;
Image46: TImage;
Image47: TImage;
Image48: TImage;
Image49: TImage;
Image50: TImage;
Image51: TImage;
Image52: TImage;
Image53: TImage;
Image54: TImage;
Image55: TImage;
Image56: TImage;
Image57: TImage;
Image58: TImage;
Image59: TImage;
Image60: TImage;
Image61: TImage;
Image62: TImage;
Image63: TImage;
Image64: TImage;
Label1: TLabel;
Label2: TLabel;
Label3: TLabel;
Label4: TLabel;
MainMenu1: TMainMenu;
SaveButton: TMenuItem;
Closebutton: TMenuItem;
Restartbutton: TMenuItem;
LoadButton: TMenuItem;
Mode1: TMenuItem;
HumanVsComputer: TMenuItem;
ComputerVsHuman: TMenuItem;
HumanvsHuman: TMenuItem;
BackButton: TMenuItem;
StepListBox: TListBox;
SaveDialog1: TSaveDialog;
OpenDialog1: TOpenDialog;
BoardSetting: TMenuItem;
ClearButton: TButton;
MoveFirstRadioGroup: TRadioGroup;
CopyToClipboardButton: TButton;
ChessRadioGroup: TRadioGroup;
SetupBoard: TMenuItem;
CancelSetupBoard: TMenuItem;
FinishSetupboard: TMenuItem;
AiListBox: TListBox;
NornalDepth: TEdit;
Label5: TLabel;
EndgameDepth: TEdit;
Label6: TLabel;
Label7: TLabel;
ScoreLabel: TLabel;
AIDisplayScoreLabel: TLabel;
Redlabel: TLabel;
BlackLabel: TLabel;
ProgressBar1: TProgressBar;
Startposition2Button: TMenuItem;
Startposition3Button: TMenuItem;
Startposition4Button: TMenuItem;
Startposition1Button: TMenuItem;
ThinkstepEdit: TEdit;
StartpositionButton: TMenuItem;
Startposition6utton: TMenuItem;
StopThinkButton: TMenuItem;
Tojavaboardbutton: TMenuItem;
procedure AboutButtonClick(Sender: TObject);
procedure ComputerFirstButtonClick(Sender: TObject);
procedure FormClose(Sender: TObject; var CloseAction: TCloseAction);
procedure FormCreate(Sender: TObject);
procedure FormDestroy(Sender: TObject);
procedure HumanFirstButtonClick(Sender: TObject);
procedure HumanVsHumanButtonClick(Sender: TObject);
procedure HumanvsHumanClick(Sender: TObject);
procedure MenuItem1Click(Sender: TObject);
procedure RuleButtonClick(Sender: TObject);
procedure RedChessClick(Sender: TObject);
procedure BlackChessClick(Sender: TObject);
procedure ClosebuttonClick(Sender: TObject);
procedure SaveButtonClick(Sender: TObject);
procedure CopyToClipboardButtonClick(Sender: TObject);
procedure ChessRadioGroupClick(Sender: TObject);
procedure Chess2Click(Sender: TObject);
procedure ComputerVsHumanClick(Sender: TObject);
procedure HumanVsComputerClick(Sender: TObject);
procedure Chess1Click(Sender: TObject);
procedure SetupBoardClick(Sender: TObject);
procedure FinishSetupboardClick(Sender: TObject);
procedure CancelSetupBoardClick(Sender: TObject);
procedure LoadButtonClick(Sender: TObject);
procedure Deletechess(Sender: TObject);
procedure ClearButtonClick(Sender: TObject);
procedure BackButtonClick(Sender: TObject);
procedure Startposition2ButtonClick(Sender: TObject);
procedure Startposition3ButtonClick(Sender: TObject);
procedure Startposition4ButtonClick(Sender: TObject);
procedure Startposition1ButtonClick(Sender: TObject);
procedure StartpositionButtonClick(Sender: TObject);
procedure Startposition6uttonClick(Sender: TObject);
procedure StopThinkButtonClick(Sender: TObject);
procedure TojavaboardbuttonClick(Sender: TObject);
private
// mutistep:Boolean;
// mutiscore:Integer;
mutidepth:integer;
mutitemplist:Tstringlist;
mutisteplist:Tstringlist;
mutiscorelist:Tstringlist;
// mutiscore:array[0..20] of integer;
mutiSideisRed:Boolean;
mutiBoard:Tboard;
MyCriticalSection: TRTLCriticalSection;
StopThink:Boolean;
initboard,board:Tboard;
FirstIsRed:Boolean;
NotInBack:Boolean;
// RedMove:boolean;//use in Setupboard
// step:integer;
// MoveListA,MoveListB:TMemo;
RedNoMove:Boolean;
BlackNoMove:Boolean;
RealDepth:integer;
Redlist,Blacklist:TStringList;
AiMovelist:string;
movedlist:TStringList;
function Muti(const ComputerisRed:Boolean):string;
procedure DoSomethingParallel(Index: PtrInt; Data: Pointer; Item: TMultiThreadProcItem);
procedure MakeRedMove(const ABoard:Tboard;var temp:TStringList);
procedure MakeBlackMove(const ABoard:Tboard;var temp:TStringList);
// function MakeRedMoveAI(const ABoard:Tboard):TStringList;
// function MakeBlackMoveAI(const ABoard:Tboard):TStringList;
procedure MakeClick(t:Tstringlist;Player:string);
procedure Score(const Aboard:Tboard;var RedScore,BlackScore:integer);
procedure RedBoardUpdate(var Aboard:Tboard;LastChess:Integer);
procedure BlackBoardUpdate(var Aboard:Tboard;LastChess:Integer);
procedure Updateboard;
function AI(Aboard:Tboard;ComputerIsRed:Boolean):string;
function MinMax(Aboard:Tboard;SideIsRed:Boolean;depth:integer;var aithinkstep:string):integer;
function MinMaxRandom(Aboard:Tboard;SideIsRed:Boolean;depth:integer;var aithinkstep:string):integer;
function EvaluateScore(const Aboard:Tboard;const SideIsRed:Boolean):Integer;
function MinMaxStart(Aboard:Tboard;SideIsRed:Boolean;depth:integer;var aithinkstep:string):integer;
function MutiMinMaxStart(Aboard:Tboard;SideIsRed:Boolean;depth:integer;var aithinkstep:string):integer;
Procedure Scoresort(var scorelist:Tstringlist;var stepno:Tstringlist);
function ThinkNumber(Aboard:Tboard;SideIsRed:Boolean;depth:integer):integer;
Function BoardtoFen:String;
function MutiMinMax(Aboard:Tboard;const SideIsRed:Boolean;const depth:integer;var aithinkstep:string):integer;
{ Private declarations }
public
{ Public declarations }
end;
var
Form1: TForm1;
{
PicCompentName: array [1..64] of string =(
'Image1','Image2','image3','Image4','Image5',
'Image6','Image7','image8','Image9','Image10',
'Image11','Image12','image13','Image14','Image15',
'Image16','Image17','image18','Image19','Image20',
'Image21','Image22','image23','Image24','Image25',
'Image26','Image27','image28','Image29','Image30',
'Image31','Image32','image33','Image34','Image35',
'Image36','Image37','image38','Image39','Image40',
'Image41','Image42','image43','Image44','Image45',
'Image46','Image47','image48','Image49','Image50',
'Image51','Image52','image53','Image54','Image55',
'Image56','Image57','image58','Image59','Image60',
'Image61','Image62','image63','Image64');
}
// board:array[1..8,1..8] of integer = (
{
Initboard: Tboard = (
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,-1,1,0,0,0),
(0,0,0,1,-1,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0));
board:Tboard = (
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,-1,1,0,0,0),
(0,0,0,1,-1,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,0));
}
// 1 red ; -1 black ; 0 space
// eat chess-> new board->produce eat step -> eat chess...
PosMark:Tboard = (
(0,0,0,0,0,0,0,0,0,0),
(0,-199,3,-1,-1,-1,-1,3,-199,0),
(0,3,-1,-1,-1,-1,-1,-1,3,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,3,-1,-1,-1,-1,-1,-1,3,0),
(0,-199,3,-1,-1,-1,-1,3,-199,0),
(0,0,0,0,0,0,0,0,0,0)
);
{
BlackPosMark:Tboard = (
(0,0,0,0,0,0,0,0,0,0),
(0,200,2,-1,-1,-1,-1,2,200,0),
(0,2,-1,-1,-1,-1,-1,-1,2,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,-1,-1,-1,-1,-1,-1,-1,-1,0),
(0,2,-1,-1,-1,-1,-1,-1,2,0),
(0,200,2,-1,-1,-1,-1,2,200,0),
(0,0,0,0,0,0,0,0,0,0)
);
}
implementation
{$R *.lfm}
procedure TForm1.FormCreate(Sender: TObject);
var a,b:integer;
begin
mutitemplist := Tstringlist.Create;
mutisteplist := Tstringlist.Create;
mutiscorelist := Tstringlist.Create;
system.InitCriticalSection(MyCriticalSection);
randomize;
StopThink:=False;
// RedMove:=True;
for a:= 0 to 9 do
for b:= 0 to 9 do
Initboard[a][b]:=0;
board:=Initboard;
FirstIsRed:=True;
NotinBack:=True;
Redlist := TStringList.Create;
Blacklist := TStringList.Create;
movedlist := TStringList.Create;
RedNoMove:=False;
BlackNoMove:=false;
Image28.picture := Redchess.Picture;
Image29.picture := Redchess.Picture;
Image36.picture := Redchess.Picture;
Image37.picture := Redchess.Picture;
Image28.OnClick := Redchess.OnClick;
Image29.OnClick := Redchess.OnClick;
Image36.OnClick := Redchess.OnClick;
Image37.OnClick := Redchess.OnClick;
Redlist.Add('Image28');
Redlist.Add('Image29');
Redlist.Add('Image36');
Redlist.Add('Image37');
Label3.Caption:='0';
Label4.Caption:='0';
end;
function TForm1.Muti(const ComputerisRed:Boolean):String;
function test(const depth:integer;const cuted:Boolean;const fullthink:boolean):string;
var a,b,c,d,bestscore,cutnum:integer;templist,templist2:Tstringlist;OneDepthSideisRed:boolean;move,bestmove:string;//cut:Boolean;
begin
mutitemplist.clear;
mutiscorelist.clear;
// mutitemplist := Tstringlist.Create;
////mutisteplist := Tstringlist.Create;
//mutiscorelist := Tstringlist.Create;
templist := Tstringlist.Create;
templist2 := Tstringlist.Create;
AiListBox.clear;
if ComputerisRed = False then
begin
OneDepthSideisRed:=False;
if mutisteplist.count <> 0 then
begin
templist.AddStrings(mutisteplist);
//:= mutisteplist;
mutisteplist.clear;
end
else
MakeBlackmove(board,templist);
end
else begin
OneDepthSideisRed:=True;
if mutisteplist.count <> 0 then
begin
templist.AddStrings(mutisteplist);
// templist := mutisteplist;
mutisteplist.clear;
end
else
MakeRedmove(board,templist);
end;
mutiSideisRed := OneDepthSideisRed;
For a:= 0 to templist.Count-1 do
begin
mutiscorelist.add('-2000');
mutisteplist.add('.');
end;
For a:= 0 to templist.Count-1 do
begin
bestscore:= -inf;
mutiBoard := board;
if OneDepthSideisRed then
begin
Redboardupdate(mutiBoard,strtoint(templist[a]));
MakeBlackmove(mutiBoard,templist2);
end
else begin
Blackboardupdate(mutiBoard,strtoint(templist[a]));
MakeRedmove(mutiBoard,templist2);
end;
for b:= 0 to templist2.count -1 do
mutitemplist.Add(inttostr(a)+' '+templist[a]+' '+templist2[b]);
if templist2.count = 0 then
mutitemplist.Add(inttostr(a)+' '+templist[a]+' p');
end;
mutidepth:= depth;
ProcThreadPool.DoParallel(DoSomethingParallel,0,mutitemplist.count-1,nil);// address, startindex, endindex, optional data,max thread
for a:= 0 to mutiscorelist.count-1 do
mutiscorelist[a] := inttostr(-strtoint(mutiscorelist[a]));
scoresort(mutiscorelist,mutisteplist);
If (cuted = false) or (fullthink = True) then
begin
for a:= 0 to mutiscorelist.count-1 do
AiListBox.items.add(mutiscorelist[a]+':'+mutisteplist[a]);
b:= mutiscorelist.count-1;
for a:= b downto 1 do
begin
if strtoint(mutiscorelist[a]) < strtoint(mutiscorelist[0]) then
begin
mutiscorelist.Delete(a);
mutisteplist.Delete(a);
end
end;
a:=Random(mutisteplist.Count);
Result:='image'+ inttostr(8*strtoint(copy(mutisteplist[a],3,1))+strtoint(copy(mutisteplist[a],1,1))-8);
ThinkstepEdit.text := AiListBox.items[a];
AIDisplayScoreLabel.Caption:= mutiscorelist[0];
end
else begin
b:= mutisteplist.count div 2 +1;
c:= mutisteplist.count -1;
for a:= b to c do
mutisteplist.Delete(mutisteplist.Count-1);
for a:= 0 to mutisteplist.count-1 do
begin
b:= strtoint(copy(mutisteplist[a],1,1));
c:= strtoint(copy(mutisteplist[a],3,1));
mutisteplist[a] := inttostr(8*c+b-8);
end;
end;
templist.free;
templist2.free;
mutitemplist.clear;
mutiscorelist.clear;
//mutitemplist.free;
//mutiscorelist.free;
end;
var a,b,c,tempdepth:integer;
begin
// mutisteplist := Tstringlist.Create;
if ComputerIsRed = true then
begin
MakeRedMove(board,redlist);
c:= redlist.Count;
redlist.clear;
end
else begin
MakeBlackMove(board,blacklist);
c:= blacklist.Count;
blacklist.clear;
end;
score(board,a,b);
tempdepth:= strToint(Endgamedepth.text);
if a+b + tempdepth > 64 then
tempdepth:= 64-a-b
else
tempdepth:= strToint(Nornaldepth.Text);
if (c > 4) and (a + b < 46) then
begin
//nornally tempdepth:= strtoint(NornalDepth.text)-2;
tempdepth:= tempdepth-4;
test(tempdepth,true,false);
// use mutisteplist to store cuted step
tempdepth:= tempdepth + 2;
// tempdepth:= strtoint(NornalDepth.text)-2;
Result:=test(tempdepth,false,false);
end
else begin
tempdepth := tempdepth - 2;
// tempdepth:= strtoint(NornalDepth.text)-2;
Result:=test(tempdepth,true,True);
end;
mutisteplist.clear;
// mutisteplist.free;
end;
procedure TForm1.AboutButtonClick(Sender: TObject);
begin
ShowMessage('Copyright 2011,2012 by Wu Hon Sum'+#13+
'This program is free software: you can redistribute it and/or modify'+#13+
'it under the terms of the GNU General Public License as published by'+#13+
'the Free Software Foundation, either version 3 of the License, or'+#13+
'any later version.');
end;
procedure TForm1.ComputerFirstButtonClick(Sender: TObject);
begin
HumanVsHumanButton.Click;
ComputerVsHuman.Click;
end;
procedure TForm1.FormClose(Sender: TObject; var CloseAction: TCloseAction);
begin
mutitemplist.free;
mutisteplist.free;
mutiscorelist.free;
system.DoneCriticalSection(MyCriticalSection);
end;
procedure TForm1.DoSomethingParallel(Index: PtrInt; Data: Pointer; Item: TMultiThreadProcItem);
var Aboard:Tboard;a,B,C,D,mutitscore:integer;stepno,tempstring,tempstring2,tempstring3,aithinkstep:string;SideisRed:Boolean;
begin
// system.EnterCriticalsection(MyCriticalSection);
tempstring := mutitemplist[index];
// system.LeaveCriticalsection(MyCriticalSection);
For a := 2 to length(tempstring) do
if tempstring[a] = ' ' then break;
stepno := copy(tempstring,1,a-1);
tempstring := copy(tempstring,a+1,length(mutitemplist[index])-a);
For a := 2 to length(tempstring) do
if tempstring[a] = ' ' then break;
tempstring2 := copy(tempstring,1,a-1);
tempstring := copy(tempstring,a+1,2);
d:= strtoint(tempstring2);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
Dec(b);
c:=8;
end;
aithinkstep := inttostr(c)+','+inttostr(b);
Aboard:= board;
if tempstring[1] <> 'p' then
begin
d:= strtoint(tempstring);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
Dec(b);
c:=8;
end;
aithinkstep := aithinkstep+'->'+inttostr(c)+','+inttostr(b);
if mutisideisRed = True then
begin
RedboardUpdate(Aboard,strtoint(tempstring2));
Blackboardupdate(Aboard,strtoint(tempstring));
end
else begin
Blackboardupdate(Aboard,strtoint(tempstring2));
RedboardUpdate(Aboard,strtoint(tempstring));
end;
if mutidepth > 5 then
mutitscore := -MutiMinMaxStart(Aboard,mutiSideIsRed,mutidepth,aithinkstep)
else
mutitscore := -MutiMinMax(Aboard,mutiSideIsRed,mutidepth,aithinkstep);
end
else begin
aithinkstep := aithinkstep + '->PASS';
if mutisideisRed = True then
RedboardUpdate(Aboard,strtoint(tempstring2))
Else
Blackboardupdate(Aboard,strtoint(tempstring2));
mutitscore := -MutiMinMax(Aboard,mutiSideIsRed,mutidepth+1,aithinkstep);
end;
a := strtoint(stepno);
system.EnterCriticalsection(MyCriticalSection);
if mutitscore > strtoint(mutiscorelist[a]) then
begin
mutiscorelist[a] := inttostr(mutitscore);
mutisteplist[a] := aithinkstep;
end;
system.LeaveCriticalsection(MyCriticalSection);
{
AAboard:=Aboard;
d:= strtoint(mutitemplist[index]);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
b:=b-1;
c:=8;
end;
oldaithinkstep := inttostr(c)+','+inttostr(b);
For a:= 0 to Templist.Count-1 do
begin
Aboard:=AAboard;
d:= strtoint(Templist[a]);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
b:=b-1;
c:=8;
end;
aithinkstep :=oldaithinkstep + '->'+ inttostr(c)+','+inttostr(b);
if mutisideisRed = True then
BlackboardUpdate(Aboard,strToint(Templist[a]))
else
RedboardUpdate(Aboard,strToint(Templist[a]));
mutitscore := -MutiMinMax(Aboard,mutiSideIsRed,mutidepth-2,aithinkstep);
if mutitscore > bestscore then
begin
bestscore := mutitscore;
bestaithinkstep := aithinkstep;
end;
end;
Templist.free;
system.EnterCriticalsection(MyCriticalSection);
mutiscorelist.Add(inttostr(-bestscore));
mutisteplist.Add(bestaithinkstep);
system.LeaveCriticalsection(MyCriticalSection);
}
end;
function TForm1.MutiMinMaxStart(Aboard:Tboard;SideIsRed:Boolean;depth:integer;var aithinkstep:string):integer;
var a,b,c,d,bestvalue, value:integer;templist:tstringlist;tempboard:Tboard;scorelist,steplist:Tstringlist;aithinksteplist:Tstringlist;oldaithinkstep:string;//bestaithinkstep:string;
//var a,b,c,bestvalue, value:integer;templist:tstringlist;tempboard:Tboard;sameboard:boolean;
begin
//一般來說，這裡有一個判斷棋局是否結束的函數，
//一旦棋局結束就不必繼續搜索了，直接返回極值。
//但由於黑白棋不存在中途結束的情況，故省略。
Score(Aboard,a,b);
if a = 0 then
begin
if SideIsRed then
result:= 2000
else
result:= -2000;
exit;
end;
if b = 0 then
begin
if SideIsRed then
result:= -2000
else
result:= 2000;
exit;
end;
if (depth<=0) or (a+b>63) then //葉子節點
begin
result:= EvaluateScore(Aboard,SideIsRed);//直接返回對局面的估值
exit;
end;
// if SideIsRed then
bestvalue:=-INF;//初始最佳值設為負無窮
// else
// bestvalue:=INF;
//生成走法
templist:=tstringlist.Create;
if SideIsRed Then
// templist:=MakeRedMoveAI(Aboard)
MakeRedMove(Aboard,templist)
else
// templist:=MakeBlackMoveAI(Aboard);
MakeBlackMove(Aboard,templist);
if templist.Count = 0 then
begin
if SideIsRed Then
MakeBlackMove(Aboard,templist)
else
MakeRedMove(Aboard,templist);
if templist.Count = 0 then // both red and black no move
begin
templist.Free;
// result:=0;
result:= EvaluateScore(Aboard,SideIsRed);//直接返回對局面的估值
exit;
end;
// templist.Free;
// if a + b > 63 then begin
// result:= -EvaluateScore(Aboard,not SideIsRed);
// exit;
// end
// else begin
result := -mutiMinMaxStart(Aboard,Not SideIsRed,depth,aithinkstep);//);//搜索子節點，注意前面的負號
// result := -MinMaxSecond(Aboard,Not SideIsRed,depth);//);//搜索子節點，注意前面的負號
// if a+ b < 40 then
// result := result + 100;
templist.Free;
exit;
end;
tempboard:=Aboard;
scorelist := Tstringlist.Create;
steplist := Tstringlist.Create;
oldaithinkstep:=aithinkstep+'->';
For a:= 0 to templist.Count-1 do
begin
// Application.ProcessMessages;
aithinkstep:='';
// 走一步棋;//
//局面aboard 隨之改變
Aboard:=tempboard;
steplist.Add(templist[a]);
if SideIsRed Then
RedboardUpdate(Aboard,strToint(templist[a]))
else
BlackboardUpdate(aboard,strToint(templist[a]));
value:= -mutiMinMax(Aboard,Not SideIsRed,depth -2,aithinkstep);//);//搜索子節點，注意前面的負號
scorelist.add(inttostr(value));
end;
Scoresort(scorelist,steplist);
aithinksteplist:=Tstringlist.Create;
// for a := scorelist.Count div 2 to scorelist.Count do
// ProgressBar1.StepIt;// need modied
For a:=0 to scorelist.count div 2 do //need modied
begin
// 走一步棋;//
//局面aboard 隨之改變
Aboard:=tempboard;
aithinkstep:='';
d:= strtoint(steplist[a]);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
b:=b-1;
c:=8;
end;
aithinkstep := aithinkstep+intTostr(c)+','+intTostr(b) ;
if SideIsRed Then
RedboardUpdate(Aboard,strToint(steplist[a]))
else
BlackboardUpdate(aboard,strToint(steplist[a]));
value:= -mutiMinMax(Aboard,Not SideIsRed,depth-1,aithinkstep);//);//搜索子節點，注意前面的負號
// Aboard:=Tempboard;//撤銷剛才的一步;//恢復局面
// for display move value need modied;
d:= strtoint(steplist[a]);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
b:=b-1;
c:=8;
end;
// AiListBox.items.Add(intTostr(c)+','+intTostr(b)+' '+intTostr(value));
if value = bestvalue then
aithinksteplist.Add(aithinkstep)
else if value > bestvalue then
begin
aimovelist:=steplist[a]+' '+intTostr(value);
aithinksteplist.Clear;
// support random best move
aithinksteplist.Add(aithinkstep);
// bestaithinkstep:=aithinkstep;
// end of display value
// if sideIsRed then
// begin
// if value > bestvalue then
// begin
bestvalue:=value;
// if depth = Realdepth then
// aimovelist.Add(templist[a]+' '+intTostr(value));
end;
// end;
end;
{
else begin
if value < bestvalue then
begin
bestvalue:=value;
if depth = Realdepth then
aimovelist.Add(templist[a]+' '+intTostr(value));
end;
end;
end;
}
b:=Random(aithinksteplist.Count);
AiMovelist := inttostr(8*strtoint(copy(aithinksteplist[b],3,1))+strtoint(copy(aithinksteplist[b],1,1))-8) + ' '+inttostr(bestvalue);
aithinkstep := oldaithinkstep + aithinksteplist[b];
Result:= bestvalue;
// aithinkstep:=bestaithinkstep;
scorelist.free;
steplist.free;
templist.Free;
aithinksteplist.free;
end;
function TForm1.MutiMinMax(Aboard:Tboard;const SideIsRed:Boolean;const depth:integer;var aithinkstep:string):integer;
var a,b,c,d,bestvalue, value:integer;templist:tstringlist;tempboard:Tboard;oldaithinkstep,bestaithinkstep:string;
//var a,b,c,bestvalue, value:integer;templist:tstringlist;tempboard:Tboard;sameboard:boolean;
begin
//一般來說，這裡有一個判斷棋局是否結束的函數，
//一旦棋局結束就不必繼續搜索了，直接返回極值。
//但由於黑白棋不存在中途結束的情況，故省略。
// bestaithinkstep:=aithinkstep;
a:=0;
b:=0;
Score(Aboard,a,b);
if a = 0 then
begin
if SideIsRed then
result:= 2000
else
result:= -2000;
exit;
end;
if b = 0 then
begin
if SideIsRed then
result:= -2000
else
result:= 2000;
exit;
end;
if (depth<=0) or (a+b>63) or StopThink then //葉子節點
begin
result:= EvaluateScore(Aboard,SideIsRed);//直接返回對局面的估值
exit;
end;
templist := Tstringlist.Create;
bestvalue:=-INF;//初始最佳值設為負無窮
//生成走法
// templist:=tstringlist.Create;
if SideIsRed Then
// templist:=MakeRedMoveAI(Aboard)
MakeRedMove(Aboard,templist)
else
// templist:=MakeBlackMoveAI(Aboard);
MakeBlackMove(Aboard,templist);
if templist.Count = 0 then
begin
if SideIsRed Then
MakeBlackMove(Aboard,templist)
else
MakeRedMove(Aboard,templist);
if templist.Count = 0 then // both red and black no move
begin
templist.Free;
result:= EvaluateScore(Aboard,SideIsRed);//直接返回對局面的估值
exit;
end;
aithinkstep := aithinkstep +'->PASS';
result := -MutiMinMax(Aboard,Not SideIsRed,depth,aithinkstep);//);//搜索子節點，注意前面的負號
templist.Free;
exit;
end;
tempboard:=Aboard;
oldaithinkstep :=aithinkstep;
For a:= 0 to templist.Count-1 do
begin
// Application.ProcessMessages;
aithinkstep := oldaithinkstep;
d:= strtoint(templist[a]);
b:= d div 8 +1 ;
c:= d mod 8;
if c = 0 then
begin
b:=b-1;
c:=8;
end;
aithinkstep := aithinkstep+'->'+intTostr(c)+','+intTostr(b);
// 走一步棋;//
//局面aboard 隨之改變
Aboard:=tempboard;
if SideIsRed Then
RedboardUpdate(Aboard,strToint(templist[a]))
else
BlackboardUpdate(aboard,strToint(templist[a]));
value:= -MutiMinMax(Aboard,Not SideIsRed,depth-1,aithinkstep);//);//搜索子節點，注意前面的負號
if value > bestvalue then
begin
bestvalue:=value;
bestaithinkstep := aithinkstep;
end;
end;
templist.Free;
aithinkstep :=bestaithinkstep;
Result:= bestvalue;
end;
procedure TForm1.MakeRedMove(const aBoard:Tboard;var temp:TStringList);
var b,c,d:integer;
Label nextpeace;
begin
// aBoard is for ai work
temp.clear;
for b:=1 to 8 do
for c:=1 to 8 do
begin
if aboard[b,c] <> 0 then
goto nextpeace;
//from left to right
if c < 7 then if aboard[b][c+1] = -1 then
begin
for d:=2 to 7 do
begin
if c+d < 9 then
begin
if aboard[b][c+d] = 1 then
begin
temp.Add(IntTostr(8*c+b-8));
goto nextpeace;
end
else if aboard[b][c+d] <> -1 then break;
end;
end;
end;
if c > 2 then // from right to left
begin
if aboard[b][c-1] = -1 then
begin
for d:=2 to 7 do
begin
if c-d > 0 then
begin
if aboard[b][c-d] = 1 then
begin
temp.Add(IntTostr(8*c+b-8));
goto nextpeace;
end
else if aboard[b][c-d] <> -1 then break;
end;
end;
end;
end;
if b < 7 then //from top to bottom
begin
if aboard[b+1][c] = -1 then
begin
for d:= 2 to 7 do
begin
if b+d < 9 then
begin
if aboard[b+d][c] = 1 then
begin
temp.Add(IntTostr(8*c+b-8));
goto nextpeace;;
end
else if aboard[b+d][c] <> -1 then break;
end;
end;
end;
end;
if b > 2 then //from bottom to top
begin
if aboard[b-1][c] = -1 then
begin
for d := 2 to 7 do
begin
if b - d > 0 then
begin
if aboard[b-d][c] = 1 then
begin
temp.Add(IntTostr(8*c+b-8));
goto nextpeace;;
end
else if aboard[b-d][c] <> -1 then break;
end;
end;
end;
end;
if (b < 7) and (c < 7) then //from left top and right bottom
begin
if aboard[b+1][c+1] = -1 then
begin