Difference between revisions of "Faile"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Faile''' FILE:Faile It Happens Everyday.jpg|border|right|thumb| It Happens Everyday <ref>[https://en.wikipedia.org/wiki/FAILE_(artist_...") |
GerdIsenberg (talk | contribs) |
||
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[Engines]] * Faile''' | '''[[Main Page|Home]] * [[Engines]] * Faile''' | ||
− | |||
− | |||
'''Faile''',<br/> | '''Faile''',<br/> | ||
− | a [[Chess Engine Communication Protocol]] compatible [[Open Source | + | a [[Chess Engine Communication Protocol]] compatible [[:Category:Open Source|open source chess program]] under the [[Massachusetts Institute of Technology#License|MIT License]] by [[Adrien Regimbald|Adrien M. Regimbald]], written in [[C]] and last updated as version '''1.4.4''' in 2001. It is a good example of didactic programming, containing features similar to that of [[Gerbil]], coded in a way much more digestible for beginners. [https://en.wikipedia.org/wiki/The_Dragon_Reborn Faile] is the name of a character from the popular [https://en.wikipedia.org/wiki/The_Wheel_of_Time Wheel of Time] series by [https://en.wikipedia.org/wiki/Robert_Jordan Robert Jordan]. Adrien wanted to use a different name from the series, but it was taken, and he eventually settled on Faile <ref>[https://www.stmintz.com/ccc/index.php?id=116786 Why the name Faile?] by [[Adrien Regimbald]], [[CCC]], June 28, 2000</ref>. |
=Description= | =Description= | ||
Faile uses a [[Mailbox|12x12 mailbox]] board representation plus [[Piece-Lists|piece lists]], [[Negamax|negamax]] [[Alpha-Beta|alpha-beta]] with [[Transposition Table|transposition table]], [[Killer Heuristic|killer-]] and [[History Heuristic|history heuristic]], [[Captures|captures]] [[Move Ordering|ordered]] by material gain, [[Check Extensions|check extensions]], [[Null Move Pruning|null move pruning]] with [[Mate Threat Extensions|mate threat extensions]], and [[Quiescence Search|quiescence search]] inside an [[Iterative Deepening|iterative deepening]] framework. [[Evaluation]] considers [[Material|material]], [[Piece-Square Tables|piece-square tables]], [[Pawn Structure|pawn structure]], and some [[Evaluation of Pieces#Rook|rook]] and [[King Safety|king safety]] terms. | Faile uses a [[Mailbox|12x12 mailbox]] board representation plus [[Piece-Lists|piece lists]], [[Negamax|negamax]] [[Alpha-Beta|alpha-beta]] with [[Transposition Table|transposition table]], [[Killer Heuristic|killer-]] and [[History Heuristic|history heuristic]], [[Captures|captures]] [[Move Ordering|ordered]] by material gain, [[Check Extensions|check extensions]], [[Null Move Pruning|null move pruning]] with [[Mate Threat Extensions|mate threat extensions]], and [[Quiescence Search|quiescence search]] inside an [[Iterative Deepening|iterative deepening]] framework. [[Evaluation]] considers [[Material|material]], [[Piece-Square Tables|piece-square tables]], [[Pawn Structure|pawn structure]], and some [[Evaluation of Pieces#Rook|rook]] and [[King Safety|king safety]] terms. | ||
− | |||
− | |||
− | |||
=Publications= | =Publications= | ||
Line 34: | Line 29: | ||
'''[[Engines|Up one Level]]''' | '''[[Engines|Up one Level]]''' | ||
+ | [[Category:Open Source]] | ||
+ | [[Category:MIT]] | ||
+ | [[Category:XBoard]] | ||
+ | [[Category:WinBoard]] | ||
+ | [[Category:Mac]] | ||
+ | [[Category:Fiction]] | ||
+ | [[Category:Didactic]] |
Latest revision as of 17:12, 31 August 2020
Faile,
a Chess Engine Communication Protocol compatible open source chess program under the MIT License by Adrien M. Regimbald, written in C and last updated as version 1.4.4 in 2001. It is a good example of didactic programming, containing features similar to that of Gerbil, coded in a way much more digestible for beginners. Faile is the name of a character from the popular Wheel of Time series by Robert Jordan. Adrien wanted to use a different name from the series, but it was taken, and he eventually settled on Faile [1].
Contents
Description
Faile uses a 12x12 mailbox board representation plus piece lists, negamax alpha-beta with transposition table, killer- and history heuristic, captures ordered by material gain, check extensions, null move pruning with mate threat extensions, and quiescence search inside an iterative deepening framework. Evaluation considers material, piece-square tables, pawn structure, and some rook and king safety terms.
Publications
- Brian Schwab (2008). AI Game Engine Programming. Second Edition, amazon, covers Faile
- António Coelho (2016). FPGA Multiprocessor for Game Tree Searches. M.Sc. thesis, Instituto Superior Técnico, University of Lisbon, pdf » FPGA
Forum Posts
- Faile 1.4 Release by Adrien Regimbald, CCC, June 27, 2000
- Why the name Faile? by Adrien Regimbald, CCC, June 28, 2000
- Faile 1.4 Bug Fix by Adrien Regimbald, CCC, July 03, 2000
- Faile 1.4 - Fritz 32 bit Engine (fixed) by Adrien Regimbald, CCC, July 20, 2000
External Links
Chess Engine
Misc
References
- ↑ Why the name Faile? by Adrien Regimbald, CCC, June 28, 2000