Instant Insanity is a NP-Complete Problem involving stacking blocks with multi-coloured sides. The goal is for none of the sides of the tower to repeat a colour.

This is a programmatic solution to the MinimumObstacle Proeblem. It states, given a stack of blocks, what is the minimum blocks to be removed from the tower such that no side of the tower has repeating colours. Basically, given a random stack of blocks, we have to turn it into a viable solution to an Insatant Insanity problem in the least amount of steps.