The goal is to get all pieces to be white.

Click here to see the java source file.

Our research centers on the question, "for an n by m array of pieces, how many initial black/white configurations can be changed to all-white." For example, of the 2^16 initial configurations of the game shown here, 2^12 of the possible configurations can reach the all-white configuration.

We also are interested in maximizing the number of white pieces and have several results for grids and graphs.

  • For more information, visit the Fibonacci Polynomial Page
  • View the seminar on our work: Powerpoint Presentation