Rubik's Shells.

Similar documents
Tutorial 8: Practice Exam Questions

1-2 Geometric vectors

Workshops. Introduction. Project 1: Creating a Master Page. Getting and Using the Project Files. Skills and Tools: Master pages.

Answers to practice questions for Midterm 1

John O Gallagher. Twelve-Tone Improvisation A Method for Using Tone Rows in Jazz

Project 1: Creating and Using Multiple Artboards

Affine Transformations Computer Graphics Scott D. Anderson

Structural Features for Recognizing Degraded Printed Gurmukhi Script

23 Single-Slit Diffraction

10.2 Single-Slit Diffraction

Moon on one side, Sun on the other

Lecture 1: Turtle Graphics. the turtle and the crane and the swallow observe the time of their coming; Jeremiah 8:7

G Force Tolerance Sample Solution

Optimal time-delay spiking deconvolution and its application in the physical model measurement

Plug-in Board Editor for PLG150-DR/PLG150-PC

An Analysis of Interference as a Source for Diffraction

Meeting 1 Introduction to Functions. Part 1 Graphing Points on a Plane (REVIEW) Part 2 What is a function?

Workshops. Introduction. Project 1: Customizing the Desktop. Getting and Using the Project Files

Indexing Methods for Moving Object Databases: Games and Other Applications

In this project, you'll learn how to enter data using flash fill using the Flash Fill Options button and automatic recognition.

Chapter 1. Turtle Graphics. 1.1 Turtle Graphics. The turtle and the crane and the swallow observe the time of their coming Jeremiah 8:7

Project 1: Creating a Form with Content Controls

Industrial Data Communications - Fundamentals

Optimized Barrier Location for Barrier Coverage in Mobile Sensor Networks

Effect of Replica Placement on the Reliability of Large-Scale Data Storage Systems

Just change the sign of the -coordinate. Let s look at the triangle from our previous example and reflect

- Introduction P. Danziger. Linear Algebra. Algebra Manipulation, Solution or Transformation

Automatic Deployment and Formation Control of Decentralized Multi-Agent Networks

A Modified Playfair Cipher for a Large Block of Plaintext

A Robust Method of Facial Feature Tracking for Moving Images

Machining Free-Form Surface Cavities Using a Combination of Traditional and Non-Traditional Multi-Axis Machining Methods

Development of Redundant Robot Simulator for Avoiding Arbitrary Obstacles Based on Semi-Analytical Method of Solving Inverse Kinematics

2.1 Angles, Lines and Parallels & 2.2 Congruent Triangles and Pasch s Axiom

MathZoom, Summer, 2014

Lesson Element 11.02c Venn Diagrams. Instructions and answers for teachers

Math 2260 Exam #1 Practice Problem Solutions

STAT, GRAPH, TA- BLE, RECUR

1. GRAPHS OF THE SINE AND COSINE FUNCTIONS

Finding files and directories (advanced), standard streams, piping

Mixture models and clustering

Iterative Grid-Based Computing Using Mobile Agents

Lecture 12 March 16, 2010

Formats. SAS Formats under OpenVMS. Writing Binary Data CHAPTER 13

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms

Neural networks in the re-engineering process based on construction drawings

Kodak Retina II (type 122)

MICROCOLOUR MRD CONTROLLER

WHAT YOU SHOULD LEARN

Optidef A Latex library for optimization problems Version Jesus Lago May 23, 2018

A q!2 w!7!9!1 t y!4 u o

15.4 Constrained Maxima and Minima

Finding two vertex connected components in linear time

Chap5 The Theory of the Simplex Method

Solving Problems Using Quadratic Models. LEARN ABOUT the Math. concert, where n is the number of tickets sold.

Are you ready for Beast Academy 4B?

A dynamic programming algorithm for perceptually consistent stereo

Uniform spherical grids via equal area projection from the cube to the sphere

Fast and Scalable Conflict Detection for Packet Classifiers

State Stats Over 3,000 data measures covering all 50 states and the District of Columbia.

K d (490) models characterisation Issue 1 revision 0 Gilbert Barrot, ACRI-ST 05/jul/2006

Informats. SAS Informats under OpenVMS. Reading Binary Data CHAPTER 15

Unit 3 Day 8. Exponential Point-Ratio Form

Sec 4.1 Coordinates and Scatter Plots. Coordinate Plane: Formed by two real number lines that intersect at a right angle.

Practice: Large Systems Part 2, Chapter 2

TRUNK ADMIN PORTAL USER GUIDE

A function: A mathematical relationship between two variables (x and y), where every input value (usually x) has one output value (usually y)

Tutorial 5: XML. Informatics 1 Data & Analysis. Week 7, Semester 2,

Routing. 9: Intro to Routing Algorithms. Routing. Roadmap. Routing Algorithm classification: Static or Dynamic?

RES 3000 Version 3.0 CA/PMS Installation and Setup Instructions

Unit 1, Lesson 1: Moving in the Plane

COMPUTING CONSTRAINED DELAUNAY

REAL-TIME 3D GRAPHICS STREAMING USING MPEG-4

Step-By-Step Instructions To Create A Simple Single Level Roof

Parallelized Very High Radix Scalable Montgomery Multipliers

Extended Graph Rotation Systems as a Model for Cyclic Weaving on Orientable Surfaces

Math 102A Hw 3 P a (2 points)

Theory of Integers. CS389L: Automated Logical Reasoning. Lecture 13: The Omega Test. Overview of Techniques. Geometric Description

Doyle Spiral Circle Packings Animated

CS 1110 Final, December 9th, Question Points Score Total: 100

Optidef A Latex library for optimization problems Version Jesus Lago July 19, 2018

Brief 3ds max Shaping Tutorial

Geometric Model of Camera

FPGA IMPLEMENTATION OF ADAPTIVE TEMPORAL KALMAN FILTER FOR REAL TIME VIDEO FILTERING March 15, 1999

Volumes of Solids of Revolution

Coloring Eulerian triangulations of the Klein bottle


Array Dependence Analysis as Integer Constraints. Array Dependence Analysis Example. Array Dependence Analysis as Integer Constraints, cont

Comp Online Algorithms

Functions in C. Memory Allocation in C. C to LC3 Code generation. Next.. Complete and submit C to LC3 code generation. How to handle function calls?

On-line and off-line wheel/rail contact algorithm in the analysis of multibody railroad vehicle systems

In this section, we will study the following topics:

Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks

,

New Graphs of Finite Mutation Type

Contour Error Decoupling Compensation for Non-circular Grinding Qi-guang LI 1,a, Qiu-shi HAN 1, Wei-hua LI 2 and Bao-ying PENG 1

Transformation a shifting or change in shape of a graph

Skybox. Ruoqi He & Chia-Man Hung. February 26, 2016

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

Intersection of planar figures. Intersection of a parallelogram and a triangle

Example Lecture 12: The Stiffness Method Prismatic Beams. Consider again the two span beam previously discussed and determine

Transcription:

Ruik's Shells Ruik's Shells is a puzzle that consists of 4 intersecting rings, coloured heels ith 8 alls each, hich can rotat The heels are in to pairs; to axes ith a pair of heels on each, and the to axes are separated and at right angles to each other so that any heels from one axis has exactly one all in common ith any heel from the other axis. The oject of the puzzle is to separate the coloured alls, each colour into its on heel. There are 28 alls, 7 of each colour. There are 4 intersections, so 4 alls ill elong to to heels simultaneously. Each heel intersects to others, so in the solved state each heel ill have one intersection of its on colour, and the all at the other intersection matches that of the other heel. n interesting feature of this puzzle is that each axis also has a utton. y pressing a utton, the to heels on that axis permanently lock together. There are therefore 3 grades of difficulty; asic (no uttons pressed), Tough (one utton pressed), and hallenge (oth uttons pressed). Note that once pressed, the uttons can never e release lso, the puzzle is alays solvale, even if the uttons are pressed hen it is in a mixed stat Pressing a utton takes some force, so there is no danger of doing so accidentally. The numer of positions: There are 28 alls, hich can e arranged in at most 28! ays. This limit is not reached ecause they fall into 4 groups of 7 indistinguishale alls. This means the numer of positions is 28!/ 7! 4 = 472,518,347,558,400. It should also e mentioned that there are actually to solutions, ecause the alls at the intersections can e arranged in to ays. The ooklet that comes ith the puzzle has picture diagrams that sho various puzzle positions. These diagrams sho the alls in a cross, as if the rings ere cut open. The to solved positions are shon in the folloing diagrams. I have added the letters, g,, r to indicate the 4 colours, so it remains legile hen the page is printe Page 1 of 6

g g g g g g g r r r r r r r g g g g g g g r r r r r r r If your roser supports JavaScript, then you can play Ruik's Shells y clicking the link elo: JavaScript Ruik's Shells Notation: notation for the moves ill e useful, especially hen descriing the ay to solve the last fealls on or near the intersections. Look at one of the diagrams aov The to vertical lines ill e denoted y L and R, for the Left and Right column of alls. n up or don shift of one of these ill then e denoted y Lu, Ld, Ru or R Similarly, the up/don horizontal ros are U and, and their moves are Ul, Ur, l and r. If to heels are connected, then the letter indicating the heel ill e omitte Solution, asic game: The asic difficulty level (no uttons pressed) is very easy. Phase 1: Solve the outer alls In this phase everything ut the 4 intersections ill e solve hoose a heel/colour that you ant to solv It is usually est to choose one hich already has many alls of the right colour. I'll assume this it is heel U - if it isn't, you can alays reorient the puzzle so that it is. Find a all of the U colour, ut hich does not lie in the U heel. If the all lies in heel, then turn to ring it to an intersection. The all can noe thought of as lying in heel L or R instea If one of L or R is already solved, then choose the intersection ith the unsolved heel. Turn heel U to ring one of its rong alls to the intersection ith the heel that has the all of colour U. Turn the heel containing the all, ringing it into the U heel. Repeat steps -e, until the U heel is solved except for one or oth of the intersections. g. Repeat the aove method for a heel on the other axis. Repeat the aove method for each of the remaining heels. h. Phase 2: Solve the intersections. 1. o any move that does not distur any solved alls, and if possile, also solves one of the incorrect ones. 2. Step a can e repeated, choosing a heel from a different axis each time, until the puzzle is solve t the start of phase 2 there are essentially only 4 different positions for the 4 alls at the intersections. elo is a list of diagrams of these positions ith their solutions. Instead of colours, the letters,,, are use The alls hich are rong (i. not in the heel of the same colour) are shon in ol Page 2 of 6

Ur Ur l r Rd l l or Rd r Ru l Ld l Lu Ul r Solution, Tough game: The Tough difficulty level (one utton pressed) is more of a real puzzle ut still not too challenging. To heels are no fixed together, and can no longer move separately. I ill assume that the fixed heels are held so they are horizontal, and the free heels are therefore vertical. In our notation, the and U heels are fixed together. Phase 1: Solve the U heel Find a all of U colour hich does not lie in the U heel. If the all is in the heel, then turn the U heels to ring it to an intersection, then shift the all up into the U heel. ontinue ith step If the all is in the L heel, then: 1. If it is at the intersection of the L and heels, then first do L 2. Turn heels U until the intersection of L and U is clear (has no U all in it). 3. Turn heel L until the all is in the U heel. The all has noeen inserted in the U heel, so continue ith step If the all is in the R heel, then do much the same as step c: 1. If it is at the intersection of R and, then first do R 2. o heels U until the intersection of R and U is clear (has no U all in it). 3. Turn heel R until the all is in the U heel. The all has noeen inserted in the U heel, so continue ith step Repeat a-c until all the U alls are correctly placed in the U heel. (ctually you only need to place 6 adjacent alls as you don't need to solve the intersections yet.) Phase 2: Solve the heel Find a all of the colour hich is not in the U or heels. If the all lies in the R heel, then: 1. Turn heels U until the intersection of R and U is empty (not a U all). 2. Turn heel R until the all lies just elo the heel. 3. Turn heels U until the intersection of R and is empty (not a all), ut the intersection of L and U does have a U all. In other ords, ring out a U all that does not yet have a all elo it. 4. o moves l Ld r Ru. The all is no in position in the heel. ontinue ith step If instead the all lies in the L heel, then: 1. Turn heels U until the intersection of L and U is empty (not a U all). 2. Turn heel L until the all lies just elo the heel. 3. Turn heels U until the intersection of L and is empty (not a all), ut the intersection of L and U does have a U all. In other ords, ring out a U all that does not yet have a all elo it. 4. o moves r Rd l Lu. The all is no in position in the heel Repeat a-c until all the alls are correctly placed in the heel. (ctually you only need to place 6 adjacent alls as you don't need to solve the intersections yet.) Turn the U heels so that their only unsolved alls are at the intersections. Phase 3: Solve the free heels. Find a all in the R heel that does not elong ther Turn R to ring it to the intersection ith the U heel. Find a all in the L heel that does not elong ther Turn L to ring it to the intersection ith the U heel. Page 3 of 6

o moves Rd Rd r Ru l. Repeat steps a-c until all the L and R alls are solve Turn the R and L heels until the intersections are solved as ell. Solution, hallenge game: The hallenge difficulty level (to uttons pressed) is the most difficult. oth pairs of heels are no fixed together, and can no longer move separately. This solution depends on the simple move sequence l u r These move leaves the all at the intersection of and R in position, ut the seven alls adjacent to it are cycled anti-clockise around it. y doing the inverse, u l d r, the same alls are cycled around clockis Of course, this sequence can also e performed in a different orientation to cycle the alls around one of the other intersections. Phase 1: Solve 5 pairs of alls of one set of heels For no, only five adjacent pairs of alls on the U heels ill e solved, ecause this still allos you some movement hile solving the other set of heels. If you already have any pairs of U/ alls already solved, then turn the U heels to ring them just to the left of the intersections. You ill no put a all of the colour at the UL intersection as follos: 1. If there is a all somehere in the L heel, simply turn the LR heels to ring it to the UL intersection. 2. If there is a all somehere in the R heel, simply turn the LR heels to ring it to the UR intersection, and do moves l u r d and it ill e at the UL intersection. 3. If there is a all in the U heel, then do move l until it lies at the UL intersection, do move u, turn the U heels ack to their original position, and do move 4. If there is a all in the heel (that is not yet part of a solved), then do move l until it lies at the L intersection, do moves u u, turn the U heels ack to their original position, and do move o move l. Find a all of the colour of the U heel, and ring it to the UL intersection in the same ay as step aov o u r d l, to pair up the to alls. Repeat steps -e until there are 5 solved pairs. Phase 2: Solve 5 pairs of alls of the other set of heels Note that to solve the LR heels in this phase you ill have to mess up the pair of alls immediately to the right of the intersections, so if y chance you actually have six solved pairs of alls (instead of 5) on the U heels, one pair ill ecome mixe Rememer that the move sequence l u r d cycles the 7 alls that lie around the R intersection. If you already have any pairs of L/R alls already solved, then turn the LR heels to ring them just aove the intersections. You ill no put a all of the L colour at the UR intersection as follos: 1. If the all is one of the 8 that lie adjacent to the R intersection, then simply do repeat moves l u r d (or its inverse u l d r) until it lies at the UR intersection. 2. If the all is not one of the 8 that lie adjacent to the R intersection, then do u one or more times until it is. Then repeat the cycle l u r d until to ring the all to a position to the right of the intersections. No you can do d again until the LR heels are ack into their original position. The all can e rought to the UR intersection y doing l u r d once or tic o move u. Find a all of the colour of the R heel, and ring it to the position immediately to the right of the UR intersection in the much same ay as step aov Page 4 of 6

o d l u r, to pair up the to alls. Repeat steps -e until there are 5 solved pairs. Phase 3: Solve the remaining alls next to the intersections. The to alls immediately to the right and the to just elo the intersections are solved in this phas o l u r d as often as you like, to solve as many of the alls as is possil It is nearly alays possile to solve to of the four this ay, and quite often thre hoose one of the remaining unsolved positions adjacent to the intersections. Rotate the hole puzzle so that the position you ant to solve lies just elo the L intersection. Find a all at one of the intersections that is of the L colour (i. the colour that elongs at the position you are trying to solve). If there isn't such a all, then go ack to step, choosing a different position to solv Put the all into position y doing the appropriate move sequence elo: UL intersection: u l uu l dd r d l uuu r ddd r UR intersection: l u l uu l dd r d l uuu r ddd rr L intersection: l u l uu r dd r d l uuu l ddd rr R intersection: ll u r d r u l u l d r u r d l d r Repeat steps -e until only the intersections remain to e solve uluulddrdluuurdddr luluulddrdluuurdddrr luluurddrdluuuldddrr llurdrululdrurdldr Phase 4: Solve the alls at the intersections. ount ho many of the alls do not lie in the heel of the same colour. If only one all is rong, hold the puzzle so that this all is at the UL intersection, and it elongs in the R heel. (In the asic game, Ur ould solve this position). o moves u l dd l uu rr d l d r. If to alls are rong, hold the puzzle so that one of them lies at the UL intersection, and elongs in the R heel. (In the asic game, Ur l ould solve this position). o moves l d rr d ll u rr u. If three alls are rong, hold the puzzle so that the correct one lies at the UL intersection, and is of the colour of the U heel. o moves rr d l u l d rr u l If all four alls are rong, hold the puzzle so that they need to e cycled around counter-clockis o moves ll u rr uu ll d rr dd l. ulddluurrdldr ldrrdllurru rrdluldrruld llurruulldrrddl Home Links Guestook Page 5 of 6