25,161
edits
Changes
FCP
,Created page with "'''Home * Engines * FCP''' '''FCP''', (Forth Chess Program)<br/> a chess engine by Ian Osgood, written as an exercise in learning the Forth programm..."
'''[[Main Page|Home]] * [[Engines]] * FCP'''
'''FCP''', (Forth Chess Program)<br/>
a chess engine by [[Ian Osgood]], written as an exercise in learning the [[Forth]] programming language, originally derived from [[Tom Kerrigan|Tom Kerrigan's]] simple chess program [[TSCP]] 1.71. At the time it was started, there were no other chess programs in Forth which used modern search techniques. FCP retains the values of small footprint (< 64K) and code clarity.
Normally, FCP is used from the Forth command line. There are also drivers for working in [[Chess Engine Communication Protocol|XBoard]] and running [[Extended Position Description|EPD]] [[Test-Positions|test suites]].
=Enhancements=
Although FCP started with a nearly identical [[Evaluation Function|evaluation function]] as an aid to detecting bugs when porting from [[C]] to Forth, FCP diverged from TSCP in many ways <ref>[https://www.stmintz.com/ccc/index.php?id=252881 TSCP enhancements (Re: Short chess programs)] by [[Ian Osgood]], [[CCC]], September 19, 2002</ref>:
* [[0x88]]
* [[Piece-Lists|Piece lists]]
* Track king positions for faster [[Check|check]] detection
* Procedural [[Move Generation|move generation]] with loop unrolling
* [[Alpha-Beta|Alpha-beta]] with [[Aspiration Windows|aspiration windows]]
* Using the open parameter [[Stack|stack]] allows only passing [[Alpha|alpha]] to [[Search|search]] and [[Quiescence Search|quiescence]] (the alpha from the ancestor node is -beta for this node)
* [[Killer Heuristic|Killer heuristic]]
* [[Null Move Pruning|Null move pruning]]
* [[Check Extensions|Check extensions]]
* [[Incremental Updates|Incremental]] [[Material|material]] and [[Pawn Structure|pawn evaluation]]
* [[Opening Book]]
=See also=
* [[Brainless (Forth)|Brainless]] by [[David Kühling]]
* [[TSCP]]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=252881 TSCP enhancements (Re: Short chess programs)] by [[Ian Osgood]], [[CCC]], September 19, 2002
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=29692 Go FORTH and multiply with FCP...] by [[Christopher Conkie]], [[CCC]], September 08, 2007
: [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=29692&start=9 Re: Go FORTH and multiply with FCP...] by [[Ian Osgood]], [[CCC]], September 08, 2009
=External Links=
* [http://www.quirkster.com/iano/forth/FCP.html FCP home page]
* [http://www.complang.tuwien.ac.at/forth/appbench.zip Forth application benchmark suite (ZIP)] contains both FCP and another Forth chess program called [[Brainless (Forth)|Brainless]] by [[David Kühling]] <ref>[http://sourceforge.net/projects/forth-brainless/ brainless | Free Games software downloads at SourceForge.net]</ref>
=References=
<references />
'''[[Engines|Up one Level]]'''
[[Category:Open Source]]
[[Category:Forth]]
[[Category:Acronym]]
'''FCP''', (Forth Chess Program)<br/>
a chess engine by [[Ian Osgood]], written as an exercise in learning the [[Forth]] programming language, originally derived from [[Tom Kerrigan|Tom Kerrigan's]] simple chess program [[TSCP]] 1.71. At the time it was started, there were no other chess programs in Forth which used modern search techniques. FCP retains the values of small footprint (< 64K) and code clarity.
Normally, FCP is used from the Forth command line. There are also drivers for working in [[Chess Engine Communication Protocol|XBoard]] and running [[Extended Position Description|EPD]] [[Test-Positions|test suites]].
=Enhancements=
Although FCP started with a nearly identical [[Evaluation Function|evaluation function]] as an aid to detecting bugs when porting from [[C]] to Forth, FCP diverged from TSCP in many ways <ref>[https://www.stmintz.com/ccc/index.php?id=252881 TSCP enhancements (Re: Short chess programs)] by [[Ian Osgood]], [[CCC]], September 19, 2002</ref>:
* [[0x88]]
* [[Piece-Lists|Piece lists]]
* Track king positions for faster [[Check|check]] detection
* Procedural [[Move Generation|move generation]] with loop unrolling
* [[Alpha-Beta|Alpha-beta]] with [[Aspiration Windows|aspiration windows]]
* Using the open parameter [[Stack|stack]] allows only passing [[Alpha|alpha]] to [[Search|search]] and [[Quiescence Search|quiescence]] (the alpha from the ancestor node is -beta for this node)
* [[Killer Heuristic|Killer heuristic]]
* [[Null Move Pruning|Null move pruning]]
* [[Check Extensions|Check extensions]]
* [[Incremental Updates|Incremental]] [[Material|material]] and [[Pawn Structure|pawn evaluation]]
* [[Opening Book]]
=See also=
* [[Brainless (Forth)|Brainless]] by [[David Kühling]]
* [[TSCP]]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=252881 TSCP enhancements (Re: Short chess programs)] by [[Ian Osgood]], [[CCC]], September 19, 2002
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=29692 Go FORTH and multiply with FCP...] by [[Christopher Conkie]], [[CCC]], September 08, 2007
: [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=29692&start=9 Re: Go FORTH and multiply with FCP...] by [[Ian Osgood]], [[CCC]], September 08, 2009
=External Links=
* [http://www.quirkster.com/iano/forth/FCP.html FCP home page]
* [http://www.complang.tuwien.ac.at/forth/appbench.zip Forth application benchmark suite (ZIP)] contains both FCP and another Forth chess program called [[Brainless (Forth)|Brainless]] by [[David Kühling]] <ref>[http://sourceforge.net/projects/forth-brainless/ brainless | Free Games software downloads at SourceForge.net]</ref>
=References=
<references />
'''[[Engines|Up one Level]]'''
[[Category:Open Source]]
[[Category:Forth]]
[[Category:Acronym]]
