Differences

This shows you the differences between two versions of the page.

--- chess:programming:links [2022/06/01 12:21] – peter
+++ chess:programming:links [2022/06/01 13:21] (current) – peter
@@ Line 51: / Line 51: @@
 https://www.chessprogramming.org/SBAMG
+http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4781
+https://www.madchess.net/2018/10/28/madchess-3-0-beta-build-39-bitboards/
+http://www.rivalchess.com/magic-bitboards/
+https://groups.google.com/g/comp.lang.asm.x86/c/3pVGzQGb1ys?pli=1
+https://www.chessprogramming.org/Looking_for_Magics
@@ Line 165: / Line 175: @@
 https://wandbox-org.translate.goog/permlink/DKLoL1qKgiwTrugE?_x_tr_sl=ja&_x_tr_tl=en&_x_tr_hl=en-GB&_x_tr_pto=nui,sc
+http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogIEEE64Float
@@ Line 401: / Line 414: @@
 ===== de Bruijn sequence =====
+[Good]
+https://datagenetics.com/blog/october22013/index.html
+[Good]
+https://www.chessprogramming.org/De_Bruijn_Sequence
+https://www.chessprogramming.org/De_Bruijn_Sequence_Generator
+https://www.stmintz.com/ccc/index.php?id=339184
 https://www.sciencedirect.com/science/article/pii/S0012365X15002873
@@ Line 464: / Line 489: @@
 https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.1038.9096&rep=rep1&type=pdf
+http://supertech.csail.mit.edu/papers/debruijn.pdf
+https://docplayer.net/167480236-Using-de-bruijn-sequences-to-index-a-1-in-a-computer-word-charles-e-leiserson-harald-prokop-keith-h-randall-mit-laboratory-for-computer-science-cam.html
+https://www.chessprogramming.org/De_Bruijn_Sequence_Generator
+https://www.chessprogramming.org/De_Bruijn_Sequence
+https://stackoverflow.com/questions/21888140/de-bruijn-algorithm-binary-digit-count-64bits-c-sharp
+https://stackoverflow.com/questions/21888140/de-bruijn-algorithm-binary-digit-count-64bits-c-sharp/21888542#21888542