# Message #3966

From: Luna Peña <scarecrowfish@gmail.com>

Subject: Re: [MC4D] Fwd: Rubik-like puzzle

Date: Wed, 17 Jan 2018 01:02:56 +0000

I have come up with a method for both the 5,5,1,1 and the 6,6,2,2, as well

as a program that can solve any of the puzzles in Arnaud’s program

optimally. Unfortunately, it is now very late at night, and I don’t have

the time to detail it now, but I’ll be sure to share it tomorrow.

Also, you should let Arnaud know that if his ‘permute’ button just places

the beads in random locations, then it’s generating unsolvable positions. I

spent an hour trying to figure out how to do a 2-cyle on the 5,5,1,1, but

now I’m pretty sure it’s impossible, and after only using the random move

button, it doesn’t show up.

~Luna

On 16 Jan 2018 17:13, "Roice Nelson roice3@gmail.com [4D_Cubing]" <

4D_Cubing@yahoogroups.com> wrote:

Hi solution-wizards,

A friend of mine, Arnaud Chéritat, is looking for an efficient solution

algorithm for a class of twisty puzzles like the Hungarian rings

<https://www..jaapsch.net/puzzles/rings.htm> puzzle. It will be used for a

live solve where people play the role of the permuted dots. I wanted to

see if any of you might be able to help with this.. Details are below.

Best,

Roice

P.S. Arnaud makes awesome software and mathematical images. Check out his

site here: https://www.math.univ-toulouse.fr/~cheritat/

———- Forwarded message ———-

From: Arnaud Chéritat <arnaud.cheritat@gmail.com>

Date: Tue, Jan 16, 2018 at 2:11 AM

Subject: Rubik-like puzzle

To: Roice Nelson <roice3@gmail.com>

Dear Roice,

Cheers and happy new year! I am co-organizing in March an math festival

event with several stands, for one of them my idea is to embody the

following Rubick’s cube like puzzle with people following marks on the

floor :

https://www.math.univ-toulouse.fr/~cheritat/AppletsDivers/

AnneauxHongrois/page.html

For this I need a resolving algorithm that is not too long to implement. I

recall that you were part of a club or forum of puzzle solvers, would you

happen to know a solution, or somebody who knows one? How much time would

it take you to devise one if you wanted? I can come up with an algorithm

but it is pretty long to implement and you must keep track of many

movements on a sheet of paper (or have an excellent memory) because of

conjugations.

By default there is the 5,5,1,1 variant (the 4 numbers in a column of text

fields in the lower left).

I also like the 6,6,2,2, that I cannot solve quickly either.

I’d be happy to have a nice method for one of those two.

Of course you can look at many variants.

The 4,4,1,1 is easy, yet interesting.

The n,2,k,1 are easy, good for training maybe?

Best,

Arnaud.