Moderators: hgm, Rebel, chrisw
Code: Select all
$ wc bozochess.pas
8225 29038 269365 bozochess.pas
The EPD code is not yet there; when implemented, it will use the "New EPD" format. This is the same as the original EPD format except that the the half move clock and full move number always appear as the fifth and sixth tokens on a line. So the first six fields of an EPD record are exactly the same as the six fields of the corresponding FEN record.sje wrote:3) Bozochess supports the modern chess data interchange formats (SAN, FEN, EPD, PGN); it does not support the EDN (English Descriptive Notation) used in Chess 0.5.
A minor correction: having reviewed the original Pascal compiler, I note that all non-external identifiers had TEN characters of significance. (Sixty bits per word, six bits per character.)sje wrote:4) Bozochess routine names are not constrained to the six character limit from the Old Days Pascal. There has been considerable effort to use meaningful and somewhat long names which can be decoded without help from a cheat sheet.
No longer entirely true; there are three exceptions: the bitboard type, the board type, and the search limit type. None of these has any machine dependencies. The code gives further details.sje wrote:7) There is not a single damn variant field list in the entire program. No machine dependency kludges here.
The code works with either old style Borland strings (max 255 character length) or the newer ansistrings (unrestricted length).sje wrote:8) The poor string processing of the Old Days Pascal is gone. Exactly how this will be replaced is still uncertain, but might use the ansistring type seen in Free Pascal.
Any chance the ep field could be there only if there is an en passant capture?sje wrote:The EPD code is not yet there; when implemented, it will use the "New EPD" format. This is the same as the original EPD format except that the the half move clock and full move number always appear as the fifth and sixth tokens on a line. So the first six fields of an EPD record are exactly the same as the six fields of the corresponding FEN record.sje wrote:3) Bozochess supports the modern chess data interchange formats (SAN, FEN, EPD, PGN); it does not support the EDN (English Descriptive Notation) used in Chess 0.5.
YES This has already been implemented. A superfluous en passant target square can't even make it into the program; the search won't produce one at any node, and any user FEN input is similarly filtered.jwes wrote:Any chance the ep field could be there only if there is an en passant capture?sje wrote:The EPD code is not yet there; when implemented, it will use the "New EPD" format. This is the same as the original EPD format except that the the half move clock and full move number always appear as the fifth and sixth tokens on a line. So the first six fields of an EPD record are exactly the same as the six fields of the corresponding FEN record.sje wrote:3) Bozochess supports the modern chess data interchange formats (SAN, FEN, EPD, PGN); it does not support the EDN (English Descriptive Notation) used in Chess 0.5.
Code: Select all
[] f4 e6 Kf2 Qf6 f5 g5
Playing: 1 f4
Playing: 1... e6
Playing: 2 Kf2
Playing: 2... Qf6
Playing: 3 f5
Playing: 3... g5
[] dfen
FEN: rnb1kbnr/pppp1p1p/4pq2/5Pp1/8/8/PPPPPKPP/RNBQ1BNR w kq - 0 4
Code: Select all
procedure CpcFindMate(var cpc: cpctype; fullmovecount: Integer);
var
ply: plytype;
depth: Integer;
function MateNode(var mywindow: windowtype; var mypv: variationtype): svtype;
var
isdefending: Boolean;
gms: gmstype;
index: Integer;
subwindow: windowtype;
subsv: svtype;
subpv: variationtype;
function AnotherTry: Boolean; inline;
var
myresult: Boolean;
begin
if isdefending then
myresult := IsSvLosing(mywindow.alfa)
else
myresult := not IsSvMating(mywindow.alfa);
AnotherTry := myresult
end; { AnotherTry }
begin
with cpc, ssc, gms do
begin
{CpcTraceCV(cpc);}
Inc(nodecount);
if depth = 0 then
if PosIsCheckmate(currpos) then
mywindow.alfa := svlosein0
else
mywindow.alfa := sveven
else
begin
VariationInit(subpv);
if depth = 1 then
PosGenOnlyChecks(currpos, gms)
else
begin
PosGenerate(currpos, gms);
PosApplyOrderAntiMobility(currpos, gms);
GmsSortByScore(gms)
end;
isdefending := Odd(ply);
index := 0;
Inc(ply); Dec(depth);
while (index < movecount) and WindowIsOpen(mywindow) and AnotherTry do
begin
WindowShiftDn(mywindow, subwindow);
VariationRecycle(subpv);
VariationAppendMove(currvar, moves[index]);
PosExecute(currpos, moves[index]);
subsv := CalcSvUp(MateNode(subwindow, subpv));
PosRetract(currpos);
VariationRecycleTail(currvar);
if subsv > mywindow.alfa then
begin
mywindow.alfa := subsv;
if subsv < mywindow.beta then
begin
VariationRecycle(mypv);
VariationAppendMove(mypv, moves[index]);
VariationAppend(mypv, subpv)
end
end;
Inc(index)
end;
Dec(ply); Inc(depth);
VariationTerm(subpv)
end
end;
MateNode := mywindow.alfa
end; { MateNode }
begin
with cpc, ssc do
begin
ply := 0; depth := (fullmovecount * 2) - 1;
predsv := MateNode(rootwindow, predvar);
TimerStop(ssctimer); usedusec := TimerCurrent(ssctimer);
if IsSvMating(predsv) then
begin
VariationNotate(predvar, rootpos);
st := stforcedmate
end
else
begin
VariationRecycle(predvar);
st := stlimitdepth
end
end
end; { CpcFindMate }
Code: Select all
procedure GmsSortByScore(var gms: gmstype);
var
index: Integer;
tempmoves: array [gitype] of movetype;
altindex, saveindex: array [gitype] of Integer;
altsv, savesv: array [gitype] of svtype;
procedure SortScoreSegment(start, count: Integer);
var
start0, start1: Integer;
count0, count1: Integer;
tempindex: Integer;
tempsv: svtype;
fill: Integer;
pick0, pick1: Integer;
pick0limit, pick1limit: Integer;
begin
if count > 1 then
begin
{ At least two records need sorted }
if count = 2 then
begin
{ Sort two records }
if altsv[start] < altsv[start + 1] then
begin
{ Simple exchange }
tempindex := altindex[start];
altindex[start] := altindex[start + 1];
altindex[start + 1] := tempindex;
tempsv := altsv[start];
altsv[start] := altsv[start + 1];
altsv[start + 1] := tempsv
end
end
else
begin
{ Sort more than two records; start with split calculation }
count0 := count div 2; count1 := count - count0;
start0 := start; start1 := start0 + count0;
{ Sort the two segments }
SortScoreSegment(start0, count0);
SortScoreSegment(start1, count1);
{ Set up to merge the results of two segments }
fill := start;
pick0 := start0; pick1 := start1;
pick0limit := pick0 + count0; pick1limit := pick1 + count1;
{ Fill while at least one unpicked record in each segment }
while (pick0 < pick0limit) and (pick1 < pick1limit) do
begin
if altsv[pick0] > altsv[pick1] then
begin
savesv[fill] := altsv[pick0]; saveindex[fill] := altindex[pick0];
Inc(pick0)
end
else
begin
savesv[fill] := altsv[pick1]; saveindex[fill] := altindex[pick1];
Inc(pick1)
end;
Inc(fill)
end;
{ Add any remaining records from the first segment }
while pick0 < pick0limit do
begin
savesv[fill] := altsv[pick0]; saveindex[fill] := altindex[pick0];
Inc(pick0); Inc(fill)
end;
{ Add any remaining records from the second segment }
while pick1 < pick1limit do
begin
savesv[fill] := altsv[pick1]; saveindex[fill] := altindex[pick1];
Inc(pick1); Inc(fill)
end;
{ Copy to result }
for fill := start to (start + count - 1) do
begin
altsv[fill] := savesv[fill]; altindex[fill] := saveindex[fill]
end
end
end
end; { SortScoreSegment }
begin
with gms do
if movecount > 1 then
begin
for index := 0 to movecount - 1 do
begin
tempmoves[index] := moves[index];
altindex[index] := index; altsv[index] := moves[index].sv
end;
SortScoreSegment(0, movecount);
for index := 0 to movecount - 1 do
moves[index] := tempmoves[altindex[index]]
end
end; { GmsSortByScore }
Code: Select all
[] help
Enter a command, or a sequence of one or more SAN chess moves
Commands:
bench Run the benchmark
d Display everything
db Display board (ANSI color)
dbbdb Display bitboard database
dbmono Display board (monochrome)
dfen Display FEN
dm Display moves
dp Display position
dpgn Display PGN
dpi Display program identification
echo Echo parameters
exit Exit program
ffperft Summing over FEN <file> data, run perft to <depth>
g Search for a move and then play it
gg Play both sides until the end of the game
help Show help
loadfen Load FEN from a <file>
loadpgn Load PGN from a <file>
mate Search for a checkmate in <n> full moves
new New game
noop No operation
perftbulk Run perft to <depth> with bulk counting
perftfull Run perft to <depth> with each node visited
perfttran Run perft to <depth> with transposition help
rg Generate and display a single random game
rgdump Dump to a <file> <n> random games
rgstat Generate a report for <number> random game(s)
rm Retract move
rmp Retract move pair
s Search for a move but do not play it
savefen Save FEN to a <file>
savepgn Save PGN to a <file>
selftest Run the self test
sfen Set FEN <mpd> <good> <cavs> <epsq> <hmvc> <fmvn>
stag Set PGN <tagname> to <tagvalue>
test Run developer test
[] d
BozoChess 2011.11.17
bRbNbBbQbKbBbNbR
bPbPbPbPbPbPbPbP
:: :: :: ::
:: :: :: ::
:: :: :: ::
:: :: :: ::
wPwPwPwPwPwPwPwP
wRwNwBwQwKwBwNwR
FEN: rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1
Played moves count: 0
Move count: 20
Moves: Na3 Nc3 Nf3 Nh3 a3 a4 b3 b4 c3 c4 d3 d4 e3 e4 f3 f4 g3 g4 h3 h4
Material: White: +40.600 Black: +40.600 Total: +81.200
Hashes: Main: a8932a4a2da7cb33 Pawn: 031e4f8f595d6880 Game: a8932a4a2da7cb33
Elapsed time: 000.00:00:03.473
[Event "Unknown event"]
[Site "Unknown site"]
[Date "2011.11.17"]
[Round "-"]
[White "Unknown player"]
[Black "Unknown player"]
[Result "*"]
*
[] sfen 1B1bk3/7R/1r5p/1Pp1p3/2NP1N2/1RP2Pp1/2QK4/8 w - - 2 52
[] mate 4
Found mate in 4
PV: 52 Rh8+ Ke7 53 Qh7+ Kf6 54 Qg6+ Ke7 55 Qg7#
Count: 5361 Time: 000.00:00:00.098 Frequency: 54704
[] sfen 1B6/2r5/8/p1bQ4/2p1P1Pp/P2P3P/1P1k2BK/R2b1R2 w - - 5 49
[] mate 4
Found mate in 4
PV: 49 Raxd1+ Ke2 50 Bf3+ Ke3 51 Rde1+ Kd2 52 Re2#
Count: 2570 Time: 000.00:00:00.037 Frequency: 69459
[] sfen 1B6/6k1/8/4pB2/7Q/3r4/2K5/3Q2q1 b - - 3 99
[] mate 4
Found mate in 4
PV: 99... Qxd1+ 100 Kb2 Qb3+ 101 Ka1 Rd1+ 102 Bb1 Rxb1#
Count: 169 Time: 000.00:00:00.007 Frequency: 24142
Code: Select all
1nb2b1n/rp4r1/2B5/p2p1pP1/1p1Pp1Pp/1RP4K/P1k1Q3/R1B3N1 b - d3 0 38
1nb2bkr/7p/2P5/p3pP1n/P2P1P1P/K5p1/2q5/1NQ1N2R w - e6 0 40
3R2n1/5pr1/p6b/2P3pk/PrP1Q1Pp/1P2pP2/4P3/3K1BNR b - g3 0 41
3n4/p4p2/1pb1R3/1rNk1P2/1PPp2P1/b2Q2P1/P2P4/1RBK4 b - c3 0 48
8/n3R3/5p2/p4krP/P3Pp1P/1b3Q2/1pP4N/4RK2 b - e3 0 55
rn3bnr/pb1q2p1/3p1pPk/2p1p2p/2pP4/PP3P1P/4P1R1/RNBQKB2 b Q d3 0 17
rnbq2nr/1p1p4/1Ppp4/p4p1p/2kPPpPb/PRP5/5P1P/3QKB1R b - e3 0 23
Code: Select all
rn1q2nr/5pB1/p7/PppP1kpP/6b1/1Q1K3N/1PP1Pb2/RN3B1R w - c6 0 20
Code: Select all
{ BozoChess: a simple bitboard chess program in Pascal }
{
The following BSD License governs the distribution and use of this program:
Copyright (c) 2011 by the author, S. J. Edwards
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* 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.
* Neither the name of the author nor the names of any 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 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.
}
Code: Select all
gail:bozochess sje$ wc *.pas
11473 33848 333207 bozochess.pas
gail:bozochess sje$ grep \; *.pas | wc -l
4841
gail:bozochess sje$ grep procedure *.pas | wc -l
330
gail:bozochess sje$ grep function *.pas | wc -l
177