25,161
edits
Changes
no edit summary
* [[Fritz Reul]] ('''2009'''). ''New Architectures in Computer Chess'', Ph.D. Thesis, Chapter 3, Magic Hash Functions for Bitboards, [https://pure.uvt.nl/ws/files/1098572/Proefschrift_Fritz_Reul_170609.pdf pdf]
* [[Maurizio Monge]] ('''2010'''). ''On perfect hashing of numbers with sparse digit representation via multiplication by a constant''. [https://arxiv.org/abs/1003.3196 arXiv:1003.3196]
* [[Niklas Fiekas]] ('''2020'''). ''[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)
=Forum Posts=
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70341 On the establishment of domains wherein magic numbers can and cannot exist] by [[Bruce Newman]], [[CCC]], March 28, 2019
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73071 Hashtable packing (e.g. to optimize magic bitboards) is strongly NP-complete]] by [[Niklas Fiekas]], [[CCC]], February 13, 2020 <ref>[https://en.wikipedia.org/wiki/Strong_NP-completeness Strong NP-completeness from Wikipedia]</ref>
=External Links=
