Difference between revisions of "Turbo Chess"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
(9 intermediate revisions by the same user not shown) | |||
Line 17: | Line 17: | ||
* [[Principal Variation Search]] | * [[Principal Variation Search]] | ||
* [[Quiescence Search]] | * [[Quiescence Search]] | ||
+ | * [[Move Ordering]] | ||
+ | # [[PV-Move]] | ||
+ | # [[Captures|Capture of Last Moved Piece]] | ||
+ | # [[Killer Move|Killer Moves]] | ||
+ | # [[Captures|Remaining Captures]] in [[MVV-LVA|MVV/LVA Order]] | ||
+ | # [[Promotions]] | ||
+ | # [[Castling]] | ||
+ | # [[Quiet Moves|Quiet Moves]] | ||
+ | # [[En passant]] | ||
==[[Evaluation]]== | ==[[Evaluation]]== | ||
− | * [[Score#Grain|Score Grain]]: 1/256 | + | * [[Score#Grain|Score Grain]]: 1/256 of a [[Pawn Advantage, Win Percentage, and Elo|pawn unit]] |
− | + | * [[Oracle#Pre-processing|Pre-processed]] [[Piece-Square Tables]] considering <ref>The tables are calculated at the beginning of the search using the evaluation function described earlier, [[#book|book]] pp. 69</ref> | |
** [[Material]] | ** [[Material]] | ||
** [[Mobility]] | ** [[Mobility]] | ||
+ | ** [[King Safety]] | ||
** [[Pawn Structure]] | ** [[Pawn Structure]] | ||
− | ** [[Blockade of Stop]] | + | ** [[Blockade of Stop#Development|Blockade of Stop]] |
** [[Tarrasch Rule]] | ** [[Tarrasch Rule]] | ||
** [[Mop-up Evaluation]] | ** [[Mop-up Evaluation]] | ||
Line 32: | Line 42: | ||
=See also= | =See also= | ||
+ | * [[Enterprise]] | ||
* [[KChess]] | * [[KChess]] | ||
* [[Pascal#TurboPascal|Turbo Pascal]] | * [[Pascal#TurboPascal|Turbo Pascal]] | ||
* [[Turbostar]] | * [[Turbostar]] | ||
+ | * [[Zorland Chess]] | ||
=Publications= | =Publications= | ||
Line 55: | Line 67: | ||
[[Category:Pascal]] | [[Category:Pascal]] | ||
[[Category:Namesake]] | [[Category:Namesake]] | ||
+ | [[Category:8086]] | ||
+ | [[Category:DosEngine]] | ||
+ | [[Category:Chess Suffix]] | ||
+ | [[Category:Didactic]] |
Revision as of 11:06, 27 September 2020
Turbo Chess,
an didactic chess program by Kaare Danielsen [2],
written in Turbo Pascal and published as source code in 1985 on disk along with the book Turbo GameWorks by Borland International. Borland later translated the program into C++ and used it as an example program for the for the Borland C++ compiler [3].
Contents
Features
Board Representation
Search
- PV-Move
- Capture of Last Moved Piece
- Killer Moves
- Remaining Captures in MVV/LVA Order
- Promotions
- Castling
- Quiet Moves
- En passant
Evaluation
- Score Grain: 1/256 of a pawn unit
- Pre-processed Piece-Square Tables considering [5]
- Draw Evaluation
Namesake
See also
Publications
- Kaare Danielsen (1985). Turbo GameWorks. Borland International, pdf from bitsavers.org
- Don Beal (1986). Turbo GameWorks: Tools for Turbo Pascal. (Review) ICCA Journal, Vol. 9, No. 2, pp. 88
Forum Posts
- origin of Chess from old Turbo Pascal Turbo GameWorks by Douglas Houston, borland.public.delphi.non-technical, June 4, 2000
- Re: origin of Chess from old Turbo Pascal Turbo GameWorks by Kaare Danielsen, borland.public.delphi.non-technical, February 29, 2016
- Some correspondence with Kaare Danielsen... by Fernando, Hiarcs Forum, February 17, 2017 » KChess
External Links
References
- ↑ Kaare Danielsen (1985). Turbo GameWorks. Borland International
- ↑ Resume for Kaare Danielsen
- ↑ Re: origin of Chess from old Turbo Pascal Turbo GameWorks by Kaare Danielsen, borland.public.delphi.non-technical, February 29, 2016
- ↑ Features are based on the description in the book
- ↑ The tables are calculated at the beginning of the search using the evaluation function described earlier, book pp. 69
- ↑ Turbo Chess - World of Spectrum