-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCheckmate.pas
190 lines (152 loc) · 4.41 KB
/
Checkmate.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
{
Copyright (c) 2007 - 2019, David Skorvaga
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
}
{ Basic checkmate program: King and rook (blind computer) }
program Checkmate;
uses
ChessboardSquare,
UserInput,
GameOutput,
BoardRepresentation,
AI;
{ Print chessboard with all pieces in current position }
procedure PrintCurrentChessboard;
var
userKing, computerKing, computerRook: PSquare;
begin
userKing := GetUserKing;
computerKing := GetComputerKing;
computerRook := GetComputerRook;
PrintChessboard(userKing, computerKing, computerRook);
end;
{ Perform one user command and return if it is valid }
function PerformUserCommand: boolean;
var
userKing, computerKing: PSquare;
position: Square;
begin
ReadCommand;
if IsTerminating then
begin
Halt;
end;
userKing := GetUserKing;
computerKing := GetComputerKing;
if IsRestarting then
begin
ResetAI;
ResetRandomGame;
PrintNewGame;
PrintCurrentChessboard;
PerformUserCommand := false;
exit;
end;
position := userKing^;
ChangePositionByCommand(@position);
if not IsValidSquare(@position)
or ArePositionsNextToOther(computerKing, @position) then
begin
PerformUserCommand := false;
exit;
end;
if IsUserKingInCheckMovingUK(@position) then
begin
PrintMovedIntoCheck;
PrintCurrentChessboard;
PerformUserCommand := false;
exit;
end;
userKing^ := position;
PerformUserCommand := true;
end;
{ Perform user turn }
procedure ExecuteUserTurn;
begin
PrintCurrentChessboard;
repeat until PerformUserCommand;
end;
{ Identify game violation that intented move of computer piece may cause }
function GetAIGameViolation: GameViolation;
var
userKing, position: PSquare;
begin
position := GetNextIntendedPosition;
if IsPieceIntendedToMoveKing then
begin
userKing := GetUserKing;
if ArePositionsNextToOther(userKing, position) then
GetAIGameViolation := KingsNextToOther
else if IsUserKingInCheckMovingCK(position) then
GetAIGameViolation := KingInCheck
else
GetAIGameViolation := ValidArrangement;
end
else
begin
if IsUserKingInCheckMovingCR(position) then
GetAIGameViolation := KingInCheck
else
GetAIGameViolation := ValidArrangement;
end;
end;
{ TODO }
procedure ExecuteComputerTurn;
var
computerKing, computerRook: PSquare;
violation: GameViolation;
begin
computerKing := GetComputerKing;
computerRook := GetComputerRook;
repeat
ComputeNextMove(computerKing, computerRook);
violation := GetAIGameViolation;
ReportGameViolation(violation);
until not (violation = KingsNextToOther);
assert(IsValidSquare(GetNextIntendedPosition)); { TODO }
if IsPieceIntendedToMoveKing then
computerKing^ := GetNextIntendedPosition^
else
computerRook^ := GetNextIntendedPosition^;
if violation = KingInCheck then
begin
PrintCheck;
end;
end;
{ Set the game and repeat user's and computer's turns }
procedure RunGame;
begin
SetRandomGenerator;
ResetRandomGame;
PrintUsage;
PrintNewGame;
repeat
ExecuteUserTurn;
ExecuteComputerTurn;
until not MayUserKingMove;
PrintCurrentChessboard;
PrintCheckmate;
end;
begin
RunGame;
end.