KC+Chess

toc
 * Home * Engines * KC Chess**

a chess program written by R. Kevin Phillips and Craig S. Bruce in 1990 for their undergraduate final project at the [|University of New Brunswick]. KC Chess is written in Turbo Pascal to run under MS-DOS computers. It has a Mailbox board representation, its search its based on static evaluation of move score differences rather than positions and passes a bound for backward pruning, missing the deep cutoffs of alpha-beta. There was no iterative deepening nor quiescence search, MaxDepth aka level of play is preset at initialization time somehow based on the expected time to use.
 * KC Chess**,

=Pseudo Code= Source code and report of the program with pseudo code are available from Craig Bruce's sites code format="pascal" CutoffSearch (Player, Depth, CutoffValue); If Depth = 0 Then return (0); Else BestScore := -infinity; Generate the move list for Player as per current board setup; For each legal move in the move list do           Make the current move and get MoveScore; SubTreeCutoffValue := MoveScore - BestScore; Score := MoveScore - CutoffSearch (enemy of Player, Depth - 1,                                              SubTreeCutoffValue); UnMake the current move; If Score > BestScore then BestScore := Score; If BestScore >= CutoffValue then exit the For loop; End For; Return (BestScore); End If; End CutoffSearch; code =Summary= Excerpt from the readme file

Excerpt from the report :

=See also=
 * Source Sample

=Forum Posts=
 * [|Working with moves or with positions] by Guillem Barnolas, rgcc, February 22, 1998

=External Links=
 * [|KC Chess: Kevin & Craig's Chess Program]
 * [|KC-Chess Report]
 * [|pieces.txt]

=References= =What links here?= include page="KC Chess" component="backlinks" limit="20"
 * Up one level**