Article View: rec.puzzles
Article #2753Re: Rubik's tour.
From: Hana Bizek
Date: Sun, 23 Jan 2000 00:00
Date: Sun, 23 Jan 2000 00:00
58 lines
4164 bytes
4164 bytes
Androcles wrote: > > Hana Bizek <hbizek@ameritech.net> wrote in message > news:38884C17.50BD@ameritech.net... > > Androcles wrote: > > > > > > Sorry Hana, no offense intended. I just had not heard you mention it, > > > that's all. :-) > > > Androcles > > > > I am not offended. Amused is more like it. > > > > The reason I did not mention the fact is that I felt it to be too > > obvious. Besides, the original purpose of my post was not to give a > > lecture, but to ask you if you know of someone, who creates > > 3-dimensional designs from Rubik's cubes. But I devote a whole chapter > > in my book to thie fact that elements in a Rubik's cube form a > > mathematical group. (The book has been published, so it is not a > > manuscript any more. :-) ) If you can get a hold of it, you will find > > group information in Chapter 2. > > > > Permit me to disclose one tidbit about myself. I studied some group > > theory as part of my PhD dissertation in theoretical solid-state > > physics. So I am not a mathematician, but simewhat close. :-) > > Hana a kostky > Okay, well, for amusement only: > There is a well-known little puzzle known as the "Knight's Tour". > The object of the puzzle is to have the (chess) knight visit all 64 squares > on the chessboard > once and once only, according to his usual move, being 1 square in x, two > squares in y, or 1 square in y and two in x. > First question: > After the knight has completed the tour, what is the least number of moves > needed to return to the starting position? > Second question: > Can this result be modified by taking a different tour? > Suppose we have Rubik's cube, and suggest a tour such that all possible > outcomes of the various configurations are presented. We begin with the > identity. > Question three, analogous to the knight's tour. > How many configurations are there, each to be visited once and once only? > Question four. > Is this possible? > Question five: > How many moves does it take to return to the identity? > Androcles I am sorry to respond this late, Androcles, but I needed to think things over. I am not familiar with the Knight's tour puzzle. Indeed, I have some hazy notion of how a knight moves, but your explanation of this point is good and I understand it. Please look ar these remarks as coming from a relative ignoramus, but if a tour is a continous parh across a chessboard, then you do not have that in case of a Pubik's cube. One sequence may position a certain cubie in ine place, anorther sequence may position it elsewhere on the whole cube.It's an entirely different approachh, and one that is not easily equated. Hana a kostky
Technical Details
Message-ID:
<388AF552.61B0@ameritech.net>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<387DD6C1.24CC@ameritech.net> <xuMh4.3648$j63.455581@news1.rdc2.pa.home.com> <3887BFD4.116B@ameritech.net> <NMSh4.3936$j63.485453@news1.rdc2.pa.home.com> <38884C17.50BD@ameritech.net> <M66i4.4432$j63.528634@news1.rdc2.pa.home.com>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10b299,cb2f33b9a8d8dd55 X-Google-Attributes: gid10b299,public X-Google-Thread: 102524,cb2f33b9a8d8dd55 X-Google-Attributes: gid102524,public X-Google-Thread: fa70b,cb2f33b9a8d8dd55 X-Google-Attributes: gidfa70b,public X-Google-Thread: fee76,cb2f33b9a8d8dd55 X-Google-Attributes: gidfee76,public X-Google-Thread: 1130d6,cb2f33b9a8d8dd55 X-Google-Attributes: gid1130d6,public X-Google-Thread: fc333,cb2f33b9a8d8dd55 X-Google-Attributes: gidfc333,public X-Google-Thread: 109d8a,cb2f33b9a8d8dd55 X-Google-Attributes: gid109d8a,public From: Hana Bizek <hbizek@ameritech.net> Subject: Re: Rubik's tour. Date: 2000/01/23 Message-ID: <388AF552.61B0@ameritech.net> X-Deja-AN: 576475958 Content-Transfer-Encoding: 7bit References: <387DD6C1.24CC@ameritech.net> <xuMh4.3648$j63.455581@news1.rdc2.pa.home.com> <3887BFD4.116B@ameritech.net> <NMSh4.3936$j63.485453@news1.rdc2.pa.home.com> <38884C17.50BD@ameritech.net> <M66i4.4432$j63.528634@news1.rdc2.pa.home.com> Content-Type: text/plain; charset=us-ascii X-Trace: nntp0.chicago.il.ameritech.net 948630943 199.179.165.66 (Sun, 23 Jan 2000 06:35:43 CDT) Organization: Ameritech.Net www.ameritech.net Complaints: abuse@ameritech.net MIME-Version: 1.0 Reply-To: hbizek@ameritech.net NNTP-Posting-Date: Sun, 23 Jan 2000 06:35:43 CDT Newsgroups: rec.puzzles,alt.math,sci.math,alt.math.recreational,alt.brain.teasers,misc.writing,cz.soc.mensa