skipped for brevity game # scored points scored points game # scored points scored points wins games ( %) wins games ( %)ties for games ( %of games total the more accurate statistics from the thousand-games run are about the same as the statistics from the hundred-games run it seems that choosing the move that flips the most tiles is better idea than choosing side move comparing the regular algorithm against the worst algorithm now set the player' algorithm on line to use getcomputermove(and the player' algorithm on line to getworstmove((which makes the move that flips over the least number of tiles)and run hundred games try changing the function calls and running the program again welcome to reversienter number of games to run game # scored points scored points game # scored points scored points skipped for brevity game # scored points scored points game # scored points scored points wins games ( %) wins games ( %)ties for games ( %of games total whoathe algorithm in getworstmove()which always chose the move that flips the fewest tileswill almost always lose to the regular algorithm this isn' really surprising at all (in factit' surprising that this strategy wins even of the time!comparing the regular algorithm against the worstcorner algorithm how about when we replace getworstmove(on line with getcornerworstmove()this is the same algorithm except it takes any available corner pieces before taking the worst move try changing the function calls and running the program again welcome to reversienter number of games to run game # scored points scored points game # scored points scored points skipped for brevity