a. Implement a version of search (either alpha-beta or Monte Carlo) that cuts off the search early if it finds a move that is “obviously” best (using Sunfish or some other game engine, or code of your own). Compare the performance of this version to the standard version. 

b. Do the same for a version that, when two moves are completely symmetric, considers only one of the two.