comparing the random algorithm against the regular algorithm now the only thing to do is replace one of the getcomputermove(calls in the main part of the program with one of the new functions then you can run several games and see how often one algorithm wins over the other firstlet' replace ' algorithm with the one in getcomputermove(with getrandommove(on line xy getrandommove(mainboard' 'when you run the program with hundred games nowit will look something like thiswelcome to reversienter number of games to run game # scored points scored points game # scored points scored points game # scored points scored points skipped for brevity game # scored points scored points game # scored points scored points game # scored points scored points wins games ( %) wins games ( %)ties for games ( %of games total wowx won far more often than did that means that the algorithm in getcomputermove((take any available cornersotherwise take the space that flips the most tileswins more games than the algorithm in getrandommove((which makes moves randomlythis makes sensebecause making intelligent choices is usually better than just choosing things at random comparing the random algorithm against itself what if we changed ' algorithm to also use the algorithm in getrandommove()let' find out by changing ' function call on line from getcomputermove(to getrandommove(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