XIII International Scientific Conference «Electronics and Applied Physics»

OPTIMIZING INDEX RANGE OF “MULTIPLY-RIGHT-SHIFT” PERFECT HASH FUNCTION ON THE EXAMPLE OF INTELLECTUAL BOARD GAMES

Not scheduled

15m

Faculty of Radio Physics, Electronics and Computer Systems

Oral Computer Engineering

Speaker

Mr Morozov Oleksii

Description

The process of building and optimizing perfect-hash function so called “magic bitboards” were analyzed. The datastructure of board-games algorythms are mostly 64-bit integer and multiply-right-shift method of building perfect hash function is very natural for modern hardware. The main goal of optimization – decrease the size of lookup-tables to L1 cache of processor.