Yes!, these strategies make sense: - I could for example, run a tic-tac-toe game against the game tree algorithms and test it instead of nine-men morris game wh

Yes!, these strategies make sense: - I could for example, run a tic-tac-toe game against the game tree algorithms and test it instead of nine-men morris game which is more complicated. I never thought of that! - I wonder if there is a systematic procedure than can enumerate the fixed properties for algorithms. I guess this is the hard part in formal verification theory.