166
edits
Changes
no edit summary
The idea of titboards is to eliminate [[BitScan|bitscans]]. Typical bitboard move generation techniques generate a bitboard, intersect it with the set of allowable [[Squares|squares]] (empty or enemy-occupied), and then [[Bitboard Serialization|serialize]] that into a list of moves. Titboards take a bitboard occupancy for each side for just one rank, file, or diagonal, and convert them to ternary representations and add them together. This index can determine which squares can actually be moved to, instead of just attacked. It is used in a lookup table of 3^7=2187 entries per [[Direction|direction]] per square.
Titboards are not typically used (there is no known engine that implements them). The reasons behind this are that they use a large amount of memory (more than [[Magic Bitboards]]), and they must keep another attack generation method beside them due to their inflexibility. Modern cpus also have built-in bitscan instructions, further obsoleting ternary boards.
=Speed=
