I think the easiest solution would be to pick the nth optimal move 
from its vocabulary X amount of times whilst retaining all the 
lexicon, just making Quackle more fallible

Roy Miller


Reply via email to