25,161
edits
Changes
no edit summary
QuTeChess is quasi [[Bitboards|bitboard]] based using [[Tinker|Tinker's]] [[Sliding Piece Attacks#Tinker's Approach|approach]] in [[Move Generation|move generation]] of [[Sliding Pieces|sliding pieces]].
Based on the [[Bitboard Serialization|serialization]] of attacks on the otherwise empty board, it tests for [[Pseudo-Legal Move|pseudo legality]] by looking whether squares [[Square Attacked By#InBetween|between]] [[Origin Square|origin]] and [[Target Square|target]] are empty.
Its [[Search|search]] is a plain [[Alpha-Beta|alpha-beta]] without [[Transposition Table|transposition table]] inside an [[Iterative Deepening|iterative deepening]] loop.
The availability of ''changegenes.cpp'' suggests QuTeChess'
[[Point Value|piece values]] and a few random [[Evaluation|evaluation]] features could be [[Automated Tuning|tuned]] by an [[Genetic Programming#EvolutionaryComputation|evolutionary computation]] approach of [https://en.wikipedia.org/wiki/Differential_evolution differential evolution] <ref>* [[Borko Bošković]], [[Sašo Greiner]], [[Janez Brest]], [[Aleš Zamuda]], [[Viljem Žumer]] ('''2008'''). ''[https://link.springer.com/chapter/10.1007%2F978-3-540-68830-3_12 An Adaptive Differential Evolution Algorithm with Opposition-Based Mechanisms, Applied to the Tuning of a Chess Program]''. [https://link.springer.com/book/10.1007/978-3-540-68830-3 Advances in Differential Evolution], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]</ref>.
[[Category:Open Source]]
[[Category:UCI]]
[[Category:Chess Suffix]]
