Hashing+Dictionaries

toc
 * Home * Board Representation * Bitboards * Sliding Piece Attacks * Hashing Dictionaries**

This approach using associate arrays or hash tables was introduced in the ICGA Journal (June 2007) by Sam Tannous. Like other occupancy lookup approaches it works line-wise for ranks, files, diagonals and anti-diagonals. It uses hash arrays from an interpreted, high level language, Python:

=Avoiding Rotated Bitboards with Direct Lookup= Sam Tannous compared this approach to a Rotated Bitboards implementation in Python and found direct lookup favorable for move generation. In languages like C, targeting 64-bit cpus like x86-64, or even in Java, it is likely another story if one compares //Open Addressing with Double Hashing// with rotated or perfect hashing techniques like Kindergarten or even Magic Bitboards.

Abstract
Quoted from //Avoiding Rotated Bitboards with Direct Lookup//:

=External Links=
 * [|Sam Tannous homepage]

Class Libraries

 * [|UserDict - Class wrapper for dictionary objects] from [|Python Library Reference]
 * [|defaultdict objects] from [|Python Library Reference]
 * [|QMap Class Reference] from [|Qt On-line Reference Documentation]
 * [|CMap Class] from [|MFC Library Reference]

=References= =What links here?= include page="Hashing Dictionaries" component="backlinks" limit="20"
 * Up one Level**