Implement a computer program with Python Turtle that plays decent Reversi (or Othello). You can use Minimax tree, Monte Carlo or other algorithms to make this work.
Merge Sort algorithm is fast but it requires additional array and additional copying. Quick Sort is even faster than Merge Sort. Implement Quick Sort algorithm and animate it! Here is
Continuing from Mandelbrot Set project, use colorsys library to set the hue based on the number of iterations needed to go outside the boundary. The result can be an amazingly