A New Technique to Solve the Instant Insanity Problem
Author(s) -
Salar Y. Alsardary,
Hwee Jung Kim,
Julie George
Publication year - 2016
Publication title -
journal of advances in mathematics
Language(s) - English
Resource type - Journals
ISSN - 2347-1921
DOI - 10.24297/jam.v11i10.805
Subject(s) - instant , colored , mathematics , insanity , graph , perl , computer science , discrete mathematics , programming language , quantum mechanics , physics , composite material , materials science , psychiatry , psychology
Instant Insanity [1] consists of four cubes, each of whose six faces are colored with one of the four colors: red, blue, white, and green. The object is to stack the cubes in such a way that each of the four colors appears on each side of the resulting column. See figure 1 below[2]. Traditionally, this could be solved using graph theory.However, in this article, we introduce a new technique to solve the problem without using graph theory. We also used a Perl programming language to implement the new approach for the Instant Insanity.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom