Analyzes the performance of two algorithms (randomized selection and greedy algorithm) for solving TicTacToe puzzles by running a large number of trials.
saketpotluri / tictactoeanalysis Goto Github PK
View Code? Open in Web Editor NEWAnalyzes the performance of two algorithms (randomized selection and greedy algorithm) for solving TicTacToe puzzles by running a large number of trials.