Marquette University

Department of Mathematics, Statistics and Computer Science

Wim Ruitenburg's Spring 2004 MATH025.1001


Invariants

Usually when one tries to prove that something is possible, one proves it by constructing a solution. This is not always the case, but it is a fairly common rule. How do we prove that something is impossible? One way is by finding invariants. Below we give an example. In class we discussed the other `invariant' case involving hexagonal boards and three kinds of pieces, red, white, and blue ones. I know that I disappoint you all with this, but I decided that I will not discuss that example on the exam.

Last updated: May 2004
Comments & suggestions: wimr@mscs.mu.edu