to do - 'play' executable that applies the selected move to the board, creates a new board, then involkes 'global'. work out why bitsig stuff is so slow compared to movegen. maybe use a single 64-bit sig for English scrabble only add timings of various phases work out largest number of moves (or racks) that allow for relatively speedy evaluation - where to cut off do we truncate move list or just refuse to apply this technique if too many moves? it looks like I can generate 5M moves real fast but handling bitsigs is painfully slow in comparison. handle 'shape' - at least one example of every shape, as well as best moves.