INSTANT INSANITY PUZZLE By Patrick K. Asaba. INSTANT INSANITY PUZZLE The Instant Insanity puzzle is played with four cubes. Each face of the cube is colored.

Slides:



Advertisements
Similar presentations
Review from this Lesson
Advertisements

Review from this Lesson
Top-Front-Side View Tutorial
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph-02.
What is an isometric drawing?
Nets and Space Shapes Please view this tutorial and answer the follow-up questions on loose leaf to turn in to your teacher.
Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013.
Section 1.7: Coloring Graphs
17.1 CompSci 102 Today’s topics Instant InsanityInstant Insanity Random WalksRandom Walks.
Problem of the Day Problem of the Day next Geometry - Connect the Dots
+ Graph Theory to the Rescue Using graph theory to solve games and problems Dr. Carrie Wright University of Arizona Teacher’s Circle November 17, 2011.
11-1 Space Figures and Cross Sections
The Instant Insanity Game
Section 2.1 Euler Cycles Vocabulary CYCLE – a sequence of consecutively linked edges (x 1,x2),(x2,x3),…,(x n-1,x n ) whose starting vertex is the ending.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Frank Carrano, © 2012.
Vocabulary Area Surface AreaVolume More vocabulary.
Chapter 4 Graphs.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
 Created in 1974 by a Professor of architecture named Erno Rubik  This was suppose to be an object that was not possible. It consists of 26 cubes 
Polyhedron A polyhedron is simply a three-dimensional solid which consists of a collection of polygons, joined at their edges. A polyhedron is said to.
Surface Area Return to table of contents.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Copyright © Zeph Grunschlag, More on Graphs.
One Point Perspective Design and Technology. One Point Perspective Task 3 Here are some high quality examples of what we are aiming to produce by the.
Identifying 3-D Figures Lesson 12 – 7. Vocabulary Three Dimensional (3 – D) Figure: Shapes that have a length, width, and depth/height Face – a flat surface.
Animations from Cabri 3D 1. Planes of symmetry of a cube Adrian Oldknow November 2004.
Make an isometric drawing of the cube structure below.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
Lecture 10: Graph-Path-Circuit
Copyright © 2010 Pearson Education, Inc. All rights reserved Sec
Geometry Review. 5. Draw two lines of symmetry for each shape. You may use your ruler. Write the answer on separate paper. Scoring Guidelines index
WARM-UP 1.Is the ordered pair (-6,-5) a solution to the inequality 2x -4y < 8? 2. Solve the linear inequalities: a.y > (3/5) x – 3 b.4x – 2y > -3.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
Graphs. Contents Terminology Graphs as ADTs Applications of Graphs.
Surface Area of Prisms. Vocabulary Surface Area: the sum of the areas of all the faces of a 3D figure Measured in square units (ex: ft 2, in 2, m 2, etc)
CSC 252: Algorithms October 28, 2000 Homework #5: Graphs Victoria Manfredi (252a-ad) notes: -Definitions for each of the graph concepts are those presented.
Nets & Drawings for Visualizing Geometry Section 1-1.
Graph Terms By Susan Ott. Vertices Here are 7 vertices without any edges Each Vertex is labeled a different color and number.
Unit 16 Engineering Drawing
Surface Area. Definitions: Surface Area – Is the sum of the areas of a three- dimensional figure’s surfaces. Net – Is the shape made when the surface.
Leda Demos By: Kelley Louie Credits: definitions from Algorithms Lectures and Discrete Mathematics with Algorithms by Albertson and Hutchinson graphics.
{. { { { { { { Describe what it means if a shape is flat. Can you think of any two- dimensional shapes?
CSC 252 Pallavi Moorthy Homework 5. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path.
Drawing Two Dimensional Shapes
Graphs. Representations of graphs : undirected graph An undirected graph G have five vertices and seven edges An adjacency-list representation of G The.
GEOMETRY LESSON 10-1 Space Figures and Nets
The YELLOW Cross Lesson 5 Lesson 4 Review Lesson Extension
Two views Here are two views of the same shape made up of coloured cubes. How many cubes are there in the shape? What’s the minimum number? Maximum number?
Analyze your set of squares and describe the side lengths you found.
Year 7 Graphics – Orthographic Projection
The MIDDLE Layer Lesson 4.
Section 13.2 The Ellipse.
Spanning Trees Longin Jan Latecki Temple University based on slides by
Chapter 5 Surface Area.
INSTANT INSANITY PUZZLE
Can you draw this picture without lifting up your pen/pencil?
Objective - To find the surface area of a rectangular prism.
Graphs Chapter 13.
Here are four triangles. What do all of these triangles have in common
Liquid Layers.
Quadratic Equations, Inequalities, and Functions
Graphs of Quadratic Functions Part 1
Graph Theory What is a graph?.
Are the buildings below three dimensional shapes?
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Spanning Trees Longin Jan Latecki Temple University based on slides by
Applied Combinatorics, 4th Ed. Alan Tucker
The Instant Insanity Puzzle
Presentation transcript:

INSTANT INSANITY PUZZLE By Patrick K. Asaba

INSTANT INSANITY PUZZLE The Instant Insanity puzzle is played with four cubes. Each face of the cube is colored with one of the four colors: red (R), white (W), blue (B) and green (G). Note: All front faces are WHITE The objective of the puzzle is to stack the cubes one on top of another so that on each long face of the resulting shape, all four colors show up exactly once. Determining the Instant Insanity solution is a very difficult task.

INSTANT INSANITY PUZZLE Determining how to arrange these four cubes in a stack that is an Instant Insanity solution is a very difficult task. The problem is that all the cubes are not the same. Observe that there are 24 symmetries of the cube, thus in doing this puzzle with four blocks which can each be placed in 24 different positions; that is: 24 4 = 331,776 possible stacks. Wow!!

Solving the Puzzle One way of solving puzzle is to play around with these four cubes until you can figure out the solution, however I promise you that this will drive you insane. The other way to look at this problem is by the decomposition principle:  Pick one pair of opposite faces on each cube for left and right sides of the stack so that these two sides of the stack will have one face of each color.  Then pick a different pair of opposite faces on each cube for the front and back sides of the stack so that these two sides will have one face of each.

Looking back In modeling the graph we use a Multigraph; – A multigraph is a generalized graph in which multiple edges are allowed, that is two or more edges can join the same two vertices; and loops are allowed, that is edges of the form (a, a). a { Multiple edges } A loop

Make one vertex for each of the four colors. For each pair of the opposite faces on cube i, create an edge with label i joining the two vertices representing the colors of these two opposite faces. For opposite faces: l 1 =blue, r 1 =white on cube 1, draw edge labeled 1 between blue and white; for f 1 =red, b 1 =red, draw a loop labeled 1 at red; and t 1 =green, u 1 =blue, drew edge labeled 1 between green and blue. GRAPH MODEL (cube 1)  This graph only presents cube

GRAPH MODEL (cube 2) For opposite faces: l 2 =white, r 2 =blue on cube 2, draw an edge labeled 2 between white and blue; for f 2 =white, b 2 =white, draw a loop labeled 2 at white; and for t 2 =white, u 2 =red, drew an edge labeled 2 between white and red. 22 2

GRAPH MODEL (cube 3) For opposite faces: l 3 =blue, r 3 =green on cube 3, draw an edge labeled 3 between blue and green; for f 3 =white, b 3 =red, draw an edge labeled 3 between white and red; and for t 3 =red, u 3 =red, drew a loop labeled 3 at red. 3 33

GRAPH MODEL (cube 4) For opposite faces: l 4 =green, r 4 =red on cube 4, draw an edge labeled 4 between green and red; for f 4 =white, b 4 =green, draw an edge labeled 4 between white and green; and for t 4 =blue, u 4 =green, drew an edge labeled 4 between blue and green

Graph Model of instant Insanity puzzle Now we can construct a single multiple graph with 4 vertices and all the 12 edges associated with the 4 cubes

Characterize the Solution  Now you restate decomposition principle in terms of subgraphs.  One subgraph will represent the left-right sides; and  The second Subgraph will represent the front-back sides.  The subgraphs must: use all four vertices. contain four edges, one from each cube. use each edge only once. have each vertex at degree 2.

SUBGRAPHS There are three subgraphs associated with our graph model. We are using edge-disjoint to find the subgraphs A BC

SUBGRAPHS Only two subgraphs meet the required standards. One of the subgraphs will represent the left/right sides and the second one will represent the front/back sides. Left/right sidesFront/back sides

Building the solution Now you can stack the cubes as labeled. Left/right sidesFront/back sides l l l l r r r r b b b b f f f f Solution!!!

Try this!!! Cube 1Cube 2Cube 3Cube 4 Find a multigraph for the set of cubes presented below. If there is a solution, find two subgraphs that solve the puzzle. Is there another solution? If so show it; and if not explain why not?

Solution This is a multigraph the for a different set of cubes

Solution  Now you restate decomposition principle in terms of subgraphs.  One subgraph will represent the left-right sides; and  The second Subgraph will represent the front-back sides.  Then label left/right and front/back to stack the cubes Front/back side Left/right side r r l l l l r r bf b b b f f f

Solution There is no other solution, since the third subgragh does not meet the required standards