使用直接镜像避免旋转位板
Avoiding Rotated Bitboards with Direct Lookup
摘要：
本文描述了一种不借助旋转位板而直接存取滑动块受攻击方格的方法。该技术涉及使用来自解释的高级语言的内置的散列数组来创建四个哈希表。首先通过掩蔽板的所需部分来隔离等级、文件和对角线占用。然后直接从哈希表中检索被攻击的方块。维护增量更新的旋转位板变得不必要，因为访问受攻击的方块所需的所有更新，映射和移位都是不必要的。最后，将旋转位板移动生成速度与直接哈希表查找方法进行了比较。
英文摘要：
This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level language. The rank, file, and diagonal occupancy are first isolated by masking the desired portion of the board. The attacked squares are then directly retrieved from the hash tables. Maintaining incrementally updated rotated bitboards becomes unnecessary as does all the updating, mapping and shifting required to access the attacked squares. Finally, rotated bitboard move generation speed is compared with that of the direct hash table lookup method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
