Rotational Puzzles on Graphs
|
|
- Deborah Ball
- 5 years ago
- Views:
Transcription
1 Rotational Puzzles on Graphs On this page I will discuss various graph puzzles, or rather, permutation puzzles consisting of partially overlapping cycles. This was first investigated by R.M. Wilson in his paper titled 'Graph Puzzles, Homotopy, and the Alternating Group' [J. Combin. Theory (Series B) 16 (1974) ] Most of what I write below has parallels in that paper, though I solve a subtly different problem, and decided to do it in my own way. You will need to have some knowledge of permutations and permutation parity to understand this page, and to understand the proofs some elementary knowledge of permutation groups and group theory is needed. Graph puzzles Even and odd parities From large to small Two-faced puzzles (1+,1,1+) (2+,2+,3+) (0,2+,1+) (1,2+,1) (1,2,2+) (1,3,3+) (1,4+,2+) (2,3+,2) (2,2,2) (1,3,2) Extending the special cases Conclusion Comparison to sliding piece puzzles Graph puzzles Suppose we have some graph, for example the one shown on the right. That is to say, there are several points (called nodes or vertices) in the flat plane, and there are lines (called edges) connecting pairs of these points. (See the Cayley Graphs page for a more detailed explanation.) Suppose further that the graph is connected, that every node has at least two edges, and that there are no loops (i.e. no edges that connect a node to itself). This is the case for the example graph on the right. There are now two ways of turning such a graph into a permutation puzzle. Sliding type of graph puzzle: Page 1 of 10
2 A graph can be turned into a slide puzzle. In this case pieces are placed on all the nodes, except that one node is left empty. A move consists of sliding a piece along an edge to the empty node. For example, the standard Fifteen puzzle is based on a 4x4 grid graph, as shown on the right, with the corner node initially empty. The example graph could be turned into a sliding piece puzzle looking much like the Nineball puzzle. It can also be done with square tiles, as shown on the far right. Of course, most graphs cannot be realised with square tiles, though using beads or balls inside tracks will often work. Rotational type of graph puzzle: A graph can be turned into a rotational puzzle by putting a puzzle piece on every node, not leaving any nodes empty. The graph has several faces - in the case of this example there are two faces, one on the left and one on the right, both having 8 nodes around them. A move consists of shifting along all the pieces around a face clockwise (or anti-clockwise) to the next node. The example graph would result in a physical puzzle like the one shown on the right. It has two looped tracks containing 8 beads, and the two loops share 3 beads between them. Note that we assume the puzzle has only one type of piece. The Rubik's Cube for example has edges and corners. The positioning of these can be analysed separately with this theory, but positioning them all at the same time is not dealt with. On the right you see how the edges of the Rubik's cube form a graph puzzle. Also shown is the graph for the Dino cube. Note that the graphs are exactly the same, except that different faces are allowed to move. The Rubik's graph only allows the square faces to move, the Dino graph only the triangular faces. The sliding type of puzzle is very similar to the rotational type. Suppose you slide the pieces so that the blank space goes around one face, returning to its starting spot. This has the effect of the pieces in that face, just as if it was a rotational puzzle without the empty node. If the blank is not in the face you want to turn, you can bring it to the face, go around it, and take the same route back. This cycles around all but one of the pieces in that face. This is subtly different from the rotational puzzle, where all the pieces in a face take part in a turn. The methods I use for rotational puzzles will also apply with minor adjustments to the sliding puzzles. Richard M. Wilson's paper dealt exclusively, and exhaustively with the sliding puzzles, so I will only examine the rotational type of puzzle on the rest of this page. Even and odd parities Suppose we have a graph in which all the faces have an odd number of nodes. Every move in our puzzle is then a cycle involving an odd number of pieces, and such cycles have even parity. In this kind of graph puzzle, clearly no odd permutations are possible. The best we can hope to do is to be able to perform any even permutation. As we shall see later, in most graphs all even permutations can indeed be achieved. Page 2 of 10
3 Suppose instead that we have a graph that contains at least one face with an even number of pieces, i.e. there is some move that is an odd permutation. If we can prove that at all even permutations are possible, then by using that odd move we can also get all odd permutations. In other words, every permutation becomes possible, regardless of parity. The proof follows: Parity Lemma: Let A n be the alternating group of n items, i.e. it is the group of all even permutations of n items. Let p be some permutation (of some or all of those n items) that has odd parity. Let G=<A n,p>, i.e. let G be the group generated by the elements of A n and p. Then G=S n. Proof: Let q be any element in S n. If q is an even permutation, then it is in A n and hence in G=<A n,p>. If on the other hand q is an odd permutation, then r=qp is an even permutation. Since r then lies in A n and thus in G, so does q=rp -1. Therefore G contains q regardless of its parity, i.e. G contains the whole of S n. But G is a subgroup of S n so it must actually be equal. What remains now is to find a way to use the moves to produce all the even permutations. From large to small When playing with permutation puzzles, you may have noticed that the more faces a puzzle has, the easier it is to solve some part of it. You have more degrees of freedom, and you can use the unsolved area of the puzzle to move the pieces about the way you want them. It is only at the end, when you have only one or two unsolved faces that it becomes really hard. Conversely, if you can solve those last one or two faces, then you are surely accomplished enough to be able to solve the whole puzzle. The same holds for these graph puzzles a well. If you can solve those last two faces completely without using the other faces, then you can use that knowledge to solve the whole puzzle. This can be stated more formally as follows: Extension Lemma: Let A n be the alternating group of n items (n>2), i.e. it is the group of all even permutations of n items. Let c be the cycle (k k+1 k+2... m), where k n<m. Then <A n,c> contains A m. In order to prove this, we need the following lemma: Lemma: A n is generated by the 3-cycles (1 2 x) for x=3..n. Proof: Let T n ={(1 2 x) x=3..n} be the set of supposed generators of A n. We need to show that A n =<T n >. It is obviously true when n=3. For larger n it can be proved by induction. Suppose the lemma holds for some value of n. Let p be any permutation in A n+1. Suppose p sends item n+1 to some item k. Then q = p (1 2 k) (1 2 n+1) 2 will send n+1 back to itself. In other words, q can be considered an even permutation of items 1 to n only, and as such, it lies in A n =<T n > and hence certainly lies in <T n+1 >. Therefore, p = q (1 2 n+1) (1 2 k) 2 will also lie in <T n+1 >. This shows that A n+1 is a subset of <T n+1 >, and it is easy to see they must be equal. By induction the lemma therefore holds for all values of n>2. Now we can prove the Extension Lemma: Proof of Extension Lemma: Let's first assume that k>2. Using conjugation of (1 2 n) with c, we find that: c -i (1 2 n) c i = (1 2 n+i), for any 0 i m-n. This shows that <A n,c> contains all 3-cycles (1 2 x) with x=3..m. Therefore it must contain A m. Suppose now that k=2, i.e. c is the cycle ( m). Then (1 2 3) c -i (1 3 2) c i (1 2 3) c -i (1 2 3) c i (1 3 2) = (1 2 3) (1 3+i 2+i ) (1 2 3) (1 2+i 3+i ) (1 3 2) = (1 2 2+i) for i>1. Page 3 of 10
4 Therefore we again have all 3-cycles of the form (1 2 x) with x=3..m, so <A n,c> contains A m. Finally, suppose now that k=1, i.e. c is the cycle ( m). Then let d = c(1 3 2) = ( m). By applying the first case above to d, we find that <A n,c>=<a n,d> contains A m. In other words, if we can use just a few faces and get every even permutation of their pieces, then we can add another adjacent face and get every even permutation of this larger set of pieces. By adding the faces one by one, we can then get every even permutation of the whole puzzle. Note that in the formulation of this lemma I have assumed that the added face only has one area of overlap with the rest. This is hardly a restriction however. If you can do every even permutation on a set of pieces, then you can certainly do every even permutation on a subset of those pieces. You can therefore just remove the extra overlaps from the set so that your set and the added face have only one overlap. As long as the set still has at least three pieces, it will still work. From the above it is clear that we need to examine the smallest cases first, i.e. the graphs involving only two faces. If those two faces allow for all even permutations, then the Extension Lemma shows the whole puzzle allows all even permutations. Two-faced puzzles I will now assume that we only have two faces that share only one section. Most rotational puzzles have a pair of faces like that. If however every pair of intersecting faces on your puzzle has 2 or more overlaps, then the theory below does not apply. I will return to this point later on. Any rotational graph puzzle with two faces that have one shared section can be specified using 3 numbers: - the number of pieces unique to the first face - the number of pieces shared by the two faces - the number of pieces unique to the second face I will use the notation (x,y,z) to specify the puzzle with y pieces shared between the two faces, x and z pieces unique to the two faces. In the sections below, this general (x,y,z) problem is split into many separate cases which are mostly handled in very similar ways, though there are differences in the details. Each time we will establish a 3-cycle, preferably of three adjacent pieces. Applying the Extension Lemma to the combination of that 3-cycle (or actually A 3 ) and a turn of one affected face, it follows that all even permutations in that face can be achieved. Then another application of the Extension Lemma shows that the two faces together allow every even permutation of the whole set of pieces. The cases we will treat like this are: (1+,1,1+) (2+,2+,3+) (0,2+,1+) (1,2+,1) (1,2,2+) (1,3,3+) (1,4+,2+) (2,3+,2) At the very end there are two unusual special cases which do not allow all even permutations: (2,2,2) (1,3,2) Page 4 of 10
5 Case (1+,1,1+) Let's start with the simplest case - the two faces have only one piece in common. Call the two faces a and b. The same two letters are also used for clockwise moves of those faces As you may have expected with moves that have little overlap, commutation is a fruitful technique. The commutator aba -1 b -1 of a and b is a 3-cycle, as illustrated here. As mentioned before, we can apply the Extension Lemma to show that the 3-cycle and a turn of one face itself combine to make every even permutation of the pieces in that face possible. Applying the Extension Lemma once more shows that in the two faces combined, any even permutation of the whole set of pieces can be achieved. There are many examples of this type of puzzle. For example, the Pyraminx and the Dino Cube are (2,1,2) puzzles, the Octahedron is a (3,1,3) puzzle, and the Alexander's Star is a (4,1,4) puzzle. The 'edge' pieces of the Turnstile form a (5,1,5) puzzle. Case (2+,2+,3+) Let's move on to the more complicated case where the two faces have several adjacent pieces in common. Again a commutator is useful, but this time aba -1 b -1 does not give a 3-cycle. Instead it does a double swap: We can now conjugate this in order to make face a be affected by only a single swap, the other swap having been parked out of the way in the unshared part of face b. The move sequence b 2 a(aba -1 b -1 )a -1 b -2 does this. Face a now has only one adjacent swap in it: Let's call the previous sequence p. Commutating this with a, we get a 3-cycle in face a which doesn't affect any pieces from face b at all. Page 5 of 10
6 Now that we have this 3-cycle, the same reasoning as before shows every permutation of the whole puzzle is possible. Unfortunately, there is a tacit assumption in the above proof. It is assumed that face b has at least 3 pieces that are not part of face a, and that face a has at least 2 pieces not part of face b. Of course we can turn the puzzle around and apply the same moves with the faces a and b swapped. Therefore the only cases left are when a and b both have exactly 2 unshared pieces, the case where one or both faces only have a single unshared piece, and the case where one face has no unshared piece at all. An example of a puzzle of this type is the Impossiball. Any pair of adjacent faces is a (3,2,3) puzzle. Case (0,2+,1+) In this case all the pieces of one face are also part of the other face. I doubt there will ever be a mechanical puzzle that has this configuration with more than 2 shared pieces, but it has to be included here for completeness. At first sight it is surprising that the commutator is so simple - aba -1 b -1 is simply a 3-cycle: It is easy to conjugate this by a to get a 3-cycle of adjacent pieces a(aba -1 b -1 )a -1 : Obviously this assumes that face b has at least one unshared piece. If it hadn't, then the two faces would have the same effect, and there would really only be one face. Case (1,2+,1) First we'll see what we get when the faces each have a single unshared piece. This turns out to be a fairly easy case. The move sequence ab is a 3-cycle. It is easy to conjugate it into a 3-cycle in only one face, namely b - 1 (ab)b: Case (1,2,2+) Next we'll see what we get when only one of the faces, say face a, has a single unshared piece. If Page 6 of 10
7 the face has 3 pieces (two shared with b) it is very simple. A move of face a already is a 3-cycle, so all even permutations of its 3 pieces are trivially possible. We can immediately apply the Extension Lemma to get every even permutation of the whole puzzle. This reasoning actually works for the (1,2,1) case as well, though that was already handled in the previous case. An example of a puzzle of this type is the Skewb Diamond. The corners of any pair of adjacent faces form a (1,2,1) puzzle. Case (1,3,3+) Suppose there are exactly 3 shared pieces. As with the (2+,2+,3+) case, the effect of the commutator is two swaps. The pieces can't be parked in quite the same way as before, but if face b has at least 3 unshared pieces, it is still not too hard to create a 3-cycle. Conjugating the commutator with b, we get b (aba - 1 b -1 ) b -1, which does one swap in face a, and the other swap in face b's unshared pieces. Combining that with the commutator a -1 b -1 ab we get a 3-cycle and two swaps: Doing that permutation twice, the two swaps disappear, leaving a pure 3-cycle in face a. As before, this is enough to show that every even permutation can be achieved. We temporarily disturbed three of the unshared pieces of face b while constructing our 3-cycle. This method therefore does not work if b has only 2 unshared pieces. The special case (1,3,2) is still open, but it will be dealt with later. Case (1,4+,2+) Finally suppose there are 4 or more pieces shared amongst the two faces. We can combine the commutator ab -1 a -1 b and its mirror image a -1 bab -1 to get a 3-cycle and two swaps: Applying this permutation twice, the swaps disappear, leaving only a 3-cycle: Page 7 of 10
8 At this point we might be able to solve the puzzle already, but I would prefer to have a more useful 3-cycle, consisting of 3 adjacent pieces in one face. Conjugation by a -1 b -1 ab gives the following 3-cycle: Pre-multiplying it by aba -1 b -1 gives a 3-cycle of adjacent pieces in face a. As before, this is enough to show that every even permutation can be achieved. Case (1,4+,2+) cycle 3 Case (2,3+,2) This is by far the trickiest case so far. If we label the locations 1 to n as in the picture on the right, then: a = ( n-1 n) b = (n n ) c = a'bab' = (1 3)(5 6) d = a'b'ab = (2 5)(3 n) e = aba'b' = (1 n)(4 5) f = a' d a = (2 6)(3 4) g = c' d c = (2 6)(1 n) By combining those various double swaps, we get a 3-cycle in one face: efg = (4 5)(3 4) = (3 4 5) Case (2,2,2) The only two-faced graphs that don't fall under one of the previous cases are (2,2,2) and (1,3,2). Up till now, every graph we encountered allowed all even permutations to be performed on its pieces. The (2,2,2) graph is different however. Only 5!=120 positions can be achieved instead of the 6!=720 that you would normally expect when permuting six pieces. This case is so unusual, and the proof quite tricky, that I have put it on a separate web page about the Two-generator corners group. Case (1,3,2) Label the 6 pieces in the (1,3,2) puzzle as in the picture on the right. Its moves are then a=(1234), b=(65432). Similarly, label the 6 pieces of a (2,2,2) puzzle as shown, and then its moves are A=(1234), B=(1456). Note that B = b -1 a -1, A=a, and conversely, a=a, b=a -1 B -1. Every move sequence on one Page 8 of 10
9 of these graphs can thus be converted and performed on the other. This proves (1,3,2) puzzle has exactly the same set of positions as the (2,2,2). Extending the special cases The two special cases (2,2,2) and (1,3,2) are the only ones where not all even permutations can be achieved. If a third face is added to these two, can every even permutation be achieved then? If the third face and one of the other two form one of the previously described non-special puzzles, then every even permutation is possible. Therefore the third face must form a special case (2,2,2) or (1,3,2) with any face it intersects with. This leaves only very few possibilities. Suppose we extend the (2,2,2) case with another face that has 4 nodes. The only ways to do it so that any overlapping pair of faces form a (2,2,2) puzzle are shown on the right. The first case may be familiar to you on the Rubik's Cube. There is a move sequence LU'R'UL'U'RU which is a 3-cycle of corners in the U face. This establishes that, as usual, all even permutations are possible in the first graph. Since a 4-cycle is an odd permutation, the Parity Lemma shows that all permutations, odd and even, are possible. The second graph puzzle is just like positioning the corners of a cube, and the third graph corresponds to the Roundy puzzle. In both of these and in the fourth graph all permutations are possible as well. The third graph above, of the Roundy puzzle, has one more face than the (2,2,2) graph but still has only 6 nodes. The added face just connects up the two sides of the (2,2,2) graph to form a triangular cylinder. It is also possible to put them together with a twist, forming a Möbius strip. This does not introduce any new positions however, since then L 2 R L 2 is a turn of that face. There are many other 4-cycles in the group, all of which could be added to the graph as a face without changing the number of puzzle positions. Any added face that introduces new nodes to the graph will however allow all permutations to be generated. Suppose we extend the (1,3,2) case with a new face that adds at least one node to the graph. Whichever way we extend it with a square face, there will always be two faces that form a puzzle of the type (3,1,3), (3,1,4), (1,3,1), or (2,2,3). If we extend it by a face with 5 nodes, the only ways that don't obviously give all even permutations are shown on the right. The added face forms a (1,3,2) puzzle with the existing square face. Using the correspondence noted in the (1,3,2) section, these graphs puzzles are found to be equivalent to ones with only square faces. These have already been shown to allow all permutations. Conclusion Nearly every permutation puzzle with two or more rotating faces allows every even permutation to be achieved. Furthermore, if any face contains an even number of pieces, then all odd permutations are also possible. There are trivial exceptions to this rule, such as puzzles with only one face, but the only non-trivial exceptions are the two puzzles, both with exactly six pieces, shown on the right. These two puzzles have only 5! positions instead of the 6! positions you would normally expect. Comparison to sliding piece puzzles In Richard M. Wilson's paper the sliding piece puzzles on general graphs were analysed. He came to a similar conclusion as above, namely that nearly every sliding piece puzzle on a graph allows all even permutations, and if there is any cycle with an odd number of nodes then all odd permutations are possible too. There are trivial exceptions of course, namely graphs that just consist of a single cycle, and also separable graphs, i.e. graphs where Page 9 of 10
10 removal of a single node can split it into disconnected parts. The only non-trivial exception he found is the graph shown on the far right, which has only 5! permutations with the blank in the centre. That graph neatly corresponds to one of the exceptional graphs I found for the rotational puzzles, namely the (2,2,2) graph shown on the near right. Wilson's graph is the same except that it has an extra node in the middle that holds the blank space. The graph on the near right is second exceptional graph I found, namely the (1,3,2) graph. Next to it is the corresponding sliding puzzle graph, where a node has been added in the middle to hold the blank space. A closer look however reveals that it is in fact exactly the same as Wilson's graph, except that the blank is at a different place. When discussing two-faced puzzle, I assumed that the faces have only one section in common. There are puzzles however which don't any pair of faces like that, i.e. every pair of intersecting faces have two or more overlapping sections. For example, puzzles such as the Rubik's Rings / Hungarian Rings are not covered by the theory as outlined here. The reason is that its (planar) graph has three faces, but only two can be moved in the real puzzle. Furthermore, those two faces overlap in two places rather than one. If it were a sliding puzzle however, then the blank could go around the middle face as well and so allow any even permutation. For the theory of generalised Hungarian Rings, see Singmaster's Cubic Circular 5/6, p9-10. Another example of such a puzzle is the Equator / Hungarian Globe. In this puzzle we clearly cannot get every even permutation since pairs of opposite tiles will always remain opposite. After all this, there remains lots of unexplored territory. Here are some things that you may want to look into yourself. What happens if the faces have centres with a visible orientation? In most cases I used commutators and conjugations, which don't affect face centre orientations. Then the centres can be solved first before doing the pieces. However case (1,2+,1) in particular was not done that way. What happens if there are several independent sets of pieces on each face, e.g. just like corners and edges on the cube? You would have a different graph for each type of piece, and the corresponding faces of the graphs would usually have the same number of nodes, just a different amount of overlap with the neighbouring faces. What can happen if all adjoining faces have more than one overlap? I already gave two examples above, but another neat case is given by the three moves/faces ( ), ( ), and ( ) which generate only 24 positions (hint: think rolling die). What happens if a move is not a single cycle? Examples include the Topspin, or the corners of the Rubik's Domino, as well as many others. Many of them involve 180 degree turns, giving lots of 2-cycles. Home Links Guestbook Page 10 of 10
Dino Cube / Rainbow Cube / Brain Twist
Dino Cube / Rainbow Cube / Brain Twist Page 1 of 5 Picture kindly supplied by Hendrik Haak The Dino Cube is a cube shaped puzzle, and like the Skewb, it has eight axes of rotation centred around the corners.
More informationMegaminx.
Megaminx Page 1 of 5 This is a variant of the Rubik's cube, in the shape of a dodecahedron. It is a very logical progression from the cube to the dodecahedron, as can be seen from the fact that the mechanism
More informationThe puzzle (also called the "Twisting Tri-Side Puzzle" in the UK) consists of intersecting discs of 6 (rounded) triangular tiles each which can rotate. There are two versions. The "Handy" and the "Challenge".
More informationGrade 7/8 Math Circles. Visual Group Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start
More informationPart I: The Swap Puzzle
Part I: The Swap Puzzle Game Play: Randomly arrange the tiles in the boxes then try to put them in proper order using only legal moves. A variety of legal moves are: Legal Moves (variation 1): Swap the
More informationRubik's Triamid. Introduction
http://www.geocities.com/abcmcfarren/math/r90/trmd0.htm Rubik's Triamid Introduction Scramble the Puzzle Take the Triamid completely apart by breaking it down to its individual components (10 pieces and
More informationRubik's Magic Main Page
Rubik's Magic Main Page Main Page General description of Rubik's Magic Links to other sites How the tiles hinge The number of flat positions Getting back to the starting position Flat shapes Making your
More informationRubik's Magic Transforms
Rubik's Magic Transforms Main Page General description of Rubik's Magic Links to other sites How the tiles hinge The number of flat positions Getting back to the starting position Flat shapes Making your
More informationGrade 7/8 Math Circles. Visual Group Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start
More informationTopspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time
Salem State University Digital Commons at Salem State University Honors Theses Student Scholarship Fall 2015-01-01 Topspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time Elizabeth Fitzgerald
More informationDeterminants, Part 1
Determinants, Part We shall start with some redundant definitions. Definition. Given a matrix A [ a] we say that determinant of A is det A a. Definition 2. Given a matrix a a a 2 A we say that determinant
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationPyraminx Crystal. The number of positions: Links to other useful pages: Notation:
The is a dodecahedron shaped puzzle by Uwe Mèffert. It is similar to the megaminx in that it has twelve pentagonal faces that can turn, but the cuts lie slightly deeper. The cut of a face cuts go through
More informationarxiv: v1 [cs.cc] 21 Jun 2017
Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik
More informationSlicing a Puzzle and Finding the Hidden Pieces
Olivet Nazarene University Digital Commons @ Olivet Honors Program Projects Honors Program 4-1-2013 Slicing a Puzzle and Finding the Hidden Pieces Martha Arntson Olivet Nazarene University, mjarnt@gmail.com
More informationRubik s Revenge Solution Hints Booklet. Revenge - The Ultimate Challenge 2. Meet Your Revenge 3. Twisting Hints 5. General Hints 8. Notation System 12
Rubik s Revenge Solution Hints Booklet Revenge - The Ultimate Challenge 2 Meet Your Revenge 3 Twisting Hints 5 General Hints 8 Notation System 12 Revenge Sequences 19 Solving Rubik s Revenge 28 More Revenge
More informationThe puzzle consists of three intersecting discs. As such it is similar to Trio, and the two-disc puzzles Turnstile and Rashkey. Unlike those puzzles however, the pieces are shaped so that they often prevent
More informationExploring Concepts with Cubes. A resource book
Exploring Concepts with Cubes A resource book ACTIVITY 1 Gauss s method Gauss s method is a fast and efficient way of determining the sum of an arithmetic series. Let s illustrate the method using the
More informationCounting Problems
Counting Problems Counting problems are generally encountered somewhere in any mathematics course. Such problems are usually easy to state and even to get started, but how far they can be taken will vary
More informationThe mathematics of Septoku
The mathematics of Septoku arxiv:080.397v4 [math.co] Dec 203 George I. Bell gibell@comcast.net, http://home.comcast.net/~gibell/ Mathematics Subject Classifications: 00A08, 97A20 Abstract Septoku is a
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationTile Number and Space-Efficient Knot Mosaics
Tile Number and Space-Efficient Knot Mosaics Aaron Heap and Douglas Knowles arxiv:1702.06462v1 [math.gt] 21 Feb 2017 February 22, 2017 Abstract In this paper we introduce the concept of a space-efficient
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More informationThe Place of Group Theory in Decision-Making in Organizational Management A case of 16- Puzzle
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728,p-ISSN: 2319-765X, Volume 7, Issue 6 (Sep. - Oct. 2013), PP 17-22 The Place of Group Theory in Decision-Making in Organizational Management A case
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationRubik's Missing Link
http://www.geocities.com/abcmcfarren/math/rdml/rubmlk0.htm Rubik's Missing Link Notation For this solution, you must hold the puzzle horizontally, which is a lot cooler than using the term vertically.
More informationSome results on Su Doku
Some results on Su Doku Sourendu Gupta March 2, 2006 1 Proofs of widely known facts Definition 1. A Su Doku grid contains M M cells laid out in a square with M cells to each side. Definition 2. For every
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 2: Algorithms - Part II 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical
More informationAll Levels. Solving the Rubik s Cube
Solving the Rubik s Cube All Levels Common Core: Objectives: Mathematical Practice Standards: 1. Make sense of problems and persevere in solving them. 2. Reason abstractly and quantitatively. 3. Construct
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationLower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
ÂÓÙÖÒÐ Ó ÖÔ ÐÓÖØÑ Ò ÔÔÐØÓÒ ØØÔ»»ÛÛÛº ºÖÓÛÒºÙ»ÔÙÐØÓÒ»» vol.?, no.?, pp. 1 44 (????) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings David R. Wood School of Computer Science
More informationSolitaire Games. MATH 171 Freshman Seminar for Mathematics Majors. J. Robert Buchanan. Department of Mathematics. Fall 2010
Solitaire Games MATH 171 Freshman Seminar for Mathematics Majors J. Robert Buchanan Department of Mathematics Fall 2010 Standard Checkerboard Challenge 1 Suppose two diagonally opposite corners of the
More informationGraphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA
Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department
More informationCounting Things Solutions
Counting Things Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 7, 006 Abstract These are solutions to the Miscellaneous Problems in the Counting Things article at:
More informationCounting Things. Tom Davis March 17, 2006
Counting Things Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 17, 2006 Abstract We present here various strategies for counting things. Usually, the things are patterns, or
More informationBishop Domination on a Hexagonal Chess Board
Bishop Domination on a Hexagonal Chess Board Authors: Grishma Alakkat Austin Ferguson Jeremiah Collins Faculty Advisor: Dr. Dan Teague Written at North Carolina School of Science and Mathematics Completed
More informationRubik's Cube Solution
Rubik's Cube Solution This Rubik's Cube solution is very easy to learn. Anyone can do it! In about 30 minutes with this guide, you'll have a cube that looks like this: Throughout this guide, I'll be using
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationLaunchpad Maths. Arithmetic II
Launchpad Maths. Arithmetic II LAW OF DISTRIBUTION The Law of Distribution exploits the symmetries 1 of addition and multiplication to tell of how those operations behave when working together. Consider
More informationPuck The puck is a puzzle in the shape of a hockey puck, i.e. a thick disk. In the centre are two semicircular parts, and around these are 12 segment pieces. The centre can rotate with respect to the segments,
More informationSolving the Rubik s Cube
the network Solving the Rubik s Cube Introduction Hungarian sculptor and professor of architecture Ernö Rubik invented the Rubik s Cube in 1974. When solved, each side of the Rubik s Cube is a different
More informationX = {1, 2,...,n} n 1f 2f 3f... nf
Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.
More informationTwo Flipping Puzzles...
Mugged by a puzzle... Two Flipping Puzzles... Colin Wright Pure Maths Day Keele University While swapping puzzles during the Recreational Maths Colloquium in January 2015 I was presented with the question
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationCS103 Handout 25 Spring 2017 May 5, 2017 Problem Set 5
CS103 Handout 25 Spring 2017 May 5, 2017 Problem Set 5 This problem set the last one purely on discrete mathematics is designed as a cumulative review of the topics we ve covered so far and a proving ground
More informationI.M.O. Winter Training Camp 2008: Invariants and Monovariants
I.M.. Winter Training Camp 2008: Invariants and Monovariants n math contests, you will often find yourself trying to analyze a process of some sort. For example, consider the following two problems. Sample
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationTHE 15-PUZZLE (AND RUBIK S CUBE)
THE 15-PUZZLE (AND RUBIK S CUBE) KEITH CONRAD 1. Introduction A permutation puzzle is a toy where the pieces can be moved around and the object is to reassemble the pieces into their beginning state We
More informationMathematical Olympiad for Girls
UKMT UKMT UKMT United Kingdom Mathematics Trust Mathematical Olympiad for Girls Tuesday 2nd October 208 Organised by the United Kingdom Mathematics Trust These are polished solutions and do not illustrate
More informationarxiv: v2 [math.ho] 23 Aug 2018
Mathematics of a Sudo-Kurve arxiv:1808.06713v2 [math.ho] 23 Aug 2018 Tanya Khovanova Abstract Wayne Zhao We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns,
More informationSolutions of problems for grade R5
International Mathematical Olympiad Formula of Unity / The Third Millennium Year 016/017. Round Solutions of problems for grade R5 1. Paul is drawing points on a sheet of squared paper, at intersections
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
More informationSquare 1. Transform the Puzzle into a Cube
http://www.geocities.com/abcmcfarren/math/sq1/sq1xf.htm 05/29/2007 12:41 AM Square 1 A Rubik's Cube on Acid "Ohhh... I'm sooooo wasted!" Transform the Puzzle into a Cube Step I: Get the puzzle into 3 distinct
More informationMissing Sequence. You have 10 minutes to complete this test. Select the square that comes next in the sequence.
Missing Sequence Select the square that comes next in the sequence. 1. 2. 3. Similarities 4. 5. 6. Analogies 7. 8. ` 9. Odd one out 10. 11. 12. Complete the grid 13. 14. 15. Answers 1. A- The pattern along
More informationTilings with T and Skew Tetrominoes
Quercus: Linfield Journal of Undergraduate Research Volume 1 Article 3 10-8-2012 Tilings with T and Skew Tetrominoes Cynthia Lester Linfield College Follow this and additional works at: http://digitalcommons.linfield.edu/quercus
More informationRubik's Domino R B F+ F2 F-
http://www.geocities.com/abcmcfarren/math/rdml/rubdom1.htm 12/12/2006 12:40 PM Rubik's Domino Circa 1981: I was at a K-mart waiting in line to buy a handful of commodities, and there they were... an entire
More informationMath Circles: Graph Theory III
Math Circles: Graph Theory III Centre for Education in Mathematics and Computing March 0, 013 1 Notation Consider a Rubik s cube, as shown in Figure 1. The letters U, F, R, L, B, and D shall refer respectively
More informationChapter 5. Drawing a cube. 5.1 One and two-point perspective. Math 4520, Spring 2015
Chapter 5 Drawing a cube Math 4520, Spring 2015 5.1 One and two-point perspective In Chapter 5 we saw how to calculate the center of vision and the viewing distance for a square in one or two-point perspective.
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More information1 P a g e
1 P a g e Dear readers, This Logical Reasoning Digest is docket of Questions which can be asked in upcoming BITSAT Exam 2018. 1. In each of the following questions, select a figure from amongst the four
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationI want next to tell you a story about a chain letter.
I want next to tell you a story about a chain letter. 1 I want next to tell you a story about a chain letter. The next story begins from powers of 2; starting from 2 0 =1,2 1 =2,2 2 =4,2 3 =8,2 4 = 16,
More informationMAS336 Computational Problem Solving. Problem 3: Eight Queens
MAS336 Computational Problem Solving Problem 3: Eight Queens Introduction Francis J. Wright, 2007 Topics: arrays, recursion, plotting, symmetry The problem is to find all the distinct ways of choosing
More informationSolving Megaminx puzzle With Group Theory 2018 S. Student Gerald Jiarong Xu Deerfield Academy 7 Boyden lane Deerfield MA Phone: (917) E
Solving Megaminx puzzle With Group Theory 2018 S. Student Gerald Jiarong Xu Deerfield Academy 7 Boyden lane Deerfield MA 01342 Phone: (917) 868-6058 Email: Gxu21@deerfield.edu Mentor David Xianfeng Gu
More informationCoin-Moving Puzzles. arxiv:cs/ v1 [cs.dm] 31 Mar Introduction. Erik D. Demaine Martin L. Demaine Helena A. Verrill
Coin-Moving Puzzles Erik D. Demaine Martin L. Demaine Helena A. Verrill arxiv:cs/0000v [cs.dm] Mar 00 Abstract We introduce a new family of one-player games, involving the movement of coins from one configuration
More informationA few chessboards pieces: 2 for each student, to play the role of knights.
Parity Party Returns, Starting mod 2 games Resources A few sets of dominoes only for the break time! A few chessboards pieces: 2 for each student, to play the role of knights. Small coins, 16 per group
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More informationCheckpoint Questions Due Monday, October 7 at 2:15 PM Remaining Questions Due Friday, October 11 at 2:15 PM
CS13 Handout 8 Fall 13 October 4, 13 Problem Set This second problem set is all about induction and the sheer breadth of applications it entails. By the time you're done with this problem set, you will
More informationMinimal tilings of a unit square
arxiv:1607.00660v1 [math.mg] 3 Jul 2016 Minimal tilings of a unit square Iwan Praton Franklin & Marshall College Lancaster, PA 17604 Abstract Tile the unit square with n small squares. We determine the
More informationLAMC Beginners Circle April 27, Oleg Gleizer. Warm-up
LAMC Beginners Circle April 27, 2014 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Take a two-digit number and write it down three times to form a six-digit number. For example, the two-digit number
More informationKnots in a Cubic Lattice
Knots in a Cubic Lattice Marta Kobiela August 23, 2002 Abstract In this paper, we discuss the composition of knots on the cubic lattice. One main theorem deals with finding a better upper bound for the
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More informationIntroduction to Pentominoes. Pentominoes
Pentominoes Pentominoes are those shapes consisting of five congruent squares joined edge-to-edge. It is not difficult to show that there are only twelve possible pentominoes, shown below. In the literature,
More informationNew Toads and Frogs Results
Games of No Chance MSRI Publications Volume 9, 1996 New Toads and Frogs Results JEFF ERICKSON Abstract. We present a number of new results for the combinatorial game Toads and Frogs. We begin by presenting
More informationModeling a Rubik s Cube in 3D
Modeling a Rubik s Cube in 3D Robert Kaucic Math 198, Fall 2015 1 Abstract Rubik s Cubes are a classic example of a three dimensional puzzle thoroughly based in mathematics. In the trigonometry and geometry
More informationA GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction
GRPH THEORETICL PPROCH TO SOLVING SCRMLE SQURES PUZZLES SRH MSON ND MLI ZHNG bstract. Scramble Squares puzzle is made up of nine square pieces such that each edge of each piece contains half of an image.
More informationThe Problem. Tom Davis December 19, 2016
The 1 2 3 4 Problem Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 19, 2016 Abstract The first paragraph in the main part of this article poses a problem that can be approached
More informationPROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES
PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationBinary representation 0 (000) 2 1 (001) 2 2 (010) 2 3 (011) 2 4 (100) 2 5 (101) 2 6 (110) 2 7 (111) 2
This story begins from powers of 2; starting from 2 0 =1,2 1 =2,2 2 =4,2 3 =8,2 4 = 16, 2 5 = 32, 2 6 = 64, 2 7 = 128, 2 8 = 256, 2 9 = 512, and 2 10 = 1024 are the first few values. The other day I received
More informationChapter 2: Cayley graphs
Chapter 2: Cayley graphs Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Spring 2014 M. Macauley (Clemson) Chapter 2: Cayley graphs
More informationOverview. Equipment. Setup. A Single Turn. Drawing a Domino
Overview Euronimoes is a Euro-style game of dominoes for 2-4 players. Players attempt to play their dominoes in their own personal area in such a way as to minimize their point count at the end of the
More informationLecture 16b: Permutations and Bell Ringing
Lecture 16b: Permutations and Bell Ringing Another application of group theory to music is change-ringing, which refers to the process whereby people playing church bells can ring the bells in every possible
More informationTOPIC 2: HOW TO COUNT
TOPIC 2: HOW TO COUNT Problems and solutions on 'How many ways?' (Combinatorics). These start with very simple situations and illustrate how the methods can be extended to more difficult cases. 2. How
More informationRemember that represents the set of all permutations of {1, 2,... n}
20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.
More informationThe Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials
More informationMathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170
2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
More informationAdventures with Rubik s UFO. Bill Higgins Wittenberg University
Adventures with Rubik s UFO Bill Higgins Wittenberg University Introduction Enro Rubik invented the puzzle which is now known as Rubik s Cube in the 1970's. More than 100 million cubes have been sold worldwide.
More informationMATHEMATICS S-152, SUMMER 2005 THE MATHEMATICS OF SYMMETRY Outline #1 (Counting, symmetry, Platonic solids, permutations)
MATHEMATICS S-152, SUMMER 2005 THE MATHEMATICS OF SYMMETRY Outline #1 (Counting, symmetry, Platonic solids, permutations) The class will divide into four groups. Each group will have a different polygon
More informationHeuristic Search with Pre-Computed Databases
Heuristic Search with Pre-Computed Databases Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Use pre-computed partial results to improve the efficiency of heuristic
More informationNotes for Recitation 3
6.042/18.062J Mathematics for Computer Science September 17, 2010 Tom Leighton, Marten van Dijk Notes for Recitation 3 1 State Machines Recall from Lecture 3 (9/16) that an invariant is a property of a
More informationarxiv: v1 [math.gt] 21 Mar 2018
Space-Efficient Knot Mosaics for Prime Knots with Mosaic Number 6 arxiv:1803.08004v1 [math.gt] 21 Mar 2018 Aaron Heap and Douglas Knowles June 24, 2018 Abstract In 2008, Kauffman and Lomonaco introduce
More informationThe first task is to make a pattern on the top that looks like the following diagram.
Cube Strategy The cube is worked in specific stages broken down into specific tasks. In the early stages the tasks involve only a single piece needing to be moved and are simple but there are a multitude
More informationRubik 4x4x4 "Revenge"
Rubik 4x4x4 "Revenge" a.k.a. Rubik's Master Cube "Rubik's Revenge"; Patented by P. Sebesteny 1983. (plastic, 2.5 inches) D-FantiX 4x4x4 Stickerless; purchased from Amazon.com, 2017. (plastic, 2.3 inches)
More informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
More informationCrossing Game Strategies
Crossing Game Strategies Chloe Avery, Xiaoyu Qiao, Talon Stark, Jerry Luo March 5, 2015 1 Strategies for Specific Knots The following are a couple of crossing game boards for which we have found which
More informationCSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)
CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n
More informationarxiv: v2 [math.gt] 21 Mar 2018
Tile Number and Space-Efficient Knot Mosaics arxiv:1702.06462v2 [math.gt] 21 Mar 2018 Aaron Heap and Douglas Knowles March 22, 2018 Abstract In this paper we introduce the concept of a space-efficient
More informationMATH302: Mathematics & Computing Permutation Puzzles: A Mathematical Perspective
COURSE OUTLINE Fall 2016 MATH302: Mathematics & Computing Permutation Puzzles: A Mathematical Perspective General information Course: MATH302: Mathematics & Computing Permutation Puzzles: A Mathematical
More information