[r-t] Exhausted search spaces

[Ian Broster]

> Yeah.  I make a list of the 120 possible lead heads, and compute a table  
> of what the next lead head will be for each type of lead end (plain,  
> bob, single), and which leads are false against which other leads.   
> That, together with other overheads of program start-up takes about  
> 5-10ms.  From then on, I only deal with lead ends in this table by index.

Yes, that's exactly the same as my program.


> However, I think I've found the problem.  I spent plenty of time getting  
> a nice fast inner loop and then wrote the world's slowest piece code for  
> formatting the touch.  D'oh.

Well done :)

i.


-- 
Ian Broster