The Instant Insanity Game

Slides:



Advertisements
Similar presentations
Chapter 8 Topics in Graph Theory
Advertisements

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.
17.1 CompSci 102 Today’s topics Instant InsanityInstant Insanity Random WalksRandom Walks.
+ 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.
Applied Discrete Mathematics Week 12: Trees
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.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
1 Section 8.4 Connectivity. 2 Paths In an undirected graph, a path of length n from u to v, where n is a positive integer, is a sequence of edges e 1,
Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Frank Carrano, © 2012.
D1: Matchings.
Chapter 4 Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
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.
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.
Place Value Kim Burns. Chip-Trading Games Use chip-trading games to teach place value. These games stress the idea of exchanging many for one. The values.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 Graphs.
Chapter 14 Graphs. © 2004 Pearson Addison-Wesley. All rights reserved Terminology G = {V, E} A graph G consists of two sets –A set V of vertices,
Copyright © Zeph Grunschlag, More on Graphs.
1 Spanning Trees Longin Jan Latecki Temple University based on slides by David Matuszek, UPenn, Rose Hoberman, CMU, Bing Liu, U. of Illinois, Boting Yang,
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
6-1 Lesson 6-1 Example 1 Find the number of faces, vertices, and edges. Identify the figure. 1.How many faces? Example
17.1 CompSci 102 Today’s topics Instant InsanityInstant Insanity TreesTrees –Properties –Applications Reading: Sections Reading: Sections
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.
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Lecture 10: Graph-Path-Circuit
Graph Theory Hamilton Paths Hamilton Circuits and.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver Chapter 13: Graphs Data Abstraction & Problem Solving with C++
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
© 2006 Pearson Addison-Wesley. All rights reserved 14 A-1 Chapter 14 Graphs.
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Graphs. Contents Terminology Graphs as ADTs Applications of Graphs.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
Table of Contents Equations: Solving Graphically Example 1: Solve graphically. First get all nonzero terms on one side. Second, enter the expression on.
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.
Leda Demos By: Kelley Louie Credits: definitions from Algorithms Lectures and Discrete Mathematics with Algorithms by Albertson and Hutchinson graphics.
Timetable Problem solving using Graph Coloring
Hex: a Game of Connecting Faces. Player 1 Player 2 Players take turns placing blue chips (player 1) and red chips (player 2). Player 1 plays first. Player.
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
Applied Discrete Mathematics Week 14: Trees
Euler and Hamiltonian Graphs
The MIDDLE Layer Lesson 4.
Spanning Trees Longin Jan Latecki Temple University based on slides by
Chapter 5 Surface Area.
Spanning Trees Discrete Mathematics.
Based on slides by Y. Peng University of Maryland
INSTANT INSANITY PUZZLE
Solving the Rubik’s® 2x2 Cube
Can you draw this picture without lifting up your pen/pencil?
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graphs Chapter 13.
Discrete Math II Howon Kim
Connectivity Section 10.4.
Graph Theory What is a graph?.
Chapter 14 Graphs © 2006 Pearson Addison-Wesley. All rights reserved.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Spanning Trees Longin Jan Latecki Temple University based on slides by
CHAPTER 15 Graph Theory.
Applied Discrete Mathematics Week 13: Graphs
The Instant Insanity Puzzle
Solving the Rubik’s® 2x2 Cube
Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.
Graph with 7 nodes and 16 edges
Presentation transcript:

The Instant Insanity Game By Sarah Graham

What is it? The instant insanity game consists of four cubes which are colored differently on each face with the colors red, white, blue, and green. The object of the game is given four of these blocks the player is to figure out how to stack the four blocks on top of one another so as to obtain four different colored faces on each side of the stack. There are many different games and many different solutions. The problem with this game is in using four blocks which can each be placed in 24 different positions in the stack the possibility of stacks is: 242 = 331,776 possible stacks That is a lot of stacks!

How do you solve it? One way is to play around with the cubes for hours until you figure it out. However, there is a math approach using graphs and graph theory: One way to look at this problem is by the decomposition principle: Start with just looking at the left side and right side of the stack Then rotate the blocks to align the back and front to solve the puzzle Sounds easy right?…Let’s make a graph

Recall: The Multigraph A multigraph is a graph in which it is permitted for several edges to join the same pair of vertices. Loop edges, where an edge connects in a loop back to the same vertex, is also allowed. A B C D

One Instant Insanity Game R G B W 1 2 3 4

Now for this puzzle we will create a multigraph Now for this puzzle we will create a multigraph. There will be four vertices each representing the four colors of the faces. Connect the vertices with edges when they are opposite from each other. Label the cubes. 1 2 3 4 Cube 1 R G B W

To Solve: Find a labeled factor. A labeled factor is a simple disjoint circuit or factor of the graph where each term (cube number) appears once. 1 2 3 4 1 2 3 4 1 2 3 4

Make a Stack Now arrange the blocks according to the subgraphs we constructed. The arrow points to the block face that faces right. B G 1 2 3 4 1 2 3 4 R W B W R G

Insane Yet? Graph-theoretic Formulation of Instant Insanity: Find two edge-disjoint labeled factors in the graph of the Instant Insanity puzzle, one for left-right sides and one for front-back sides Use the clockwise traversal procedure to determine the left-right and front-back arrangements of each cube.

In the previous labeled factor graphs no two were disjoint because they all contained the same 1 edge. 1 2 3 4 1 Another factor 4 3 2

Here is a solution: 4 1 4 1 2 3 2 3

Try it out: Find all Instant Insanity solution to the game with the multigraph: 1 2 3 4

Answer: 1 2 3 4 1 2 3 4 and

More fun with Insanity!