Hi guys,
Recently I made a "complex" 2D puzzle that can be played on webpage, called=
Lollipop. It can be found here:
http://nanma80.github.com/lollipop
The shape of the puzzle is a disk. Take the simpliest version with 3 axes f=
or example. The outmost ring never flips. Each piece in second ring can be =
turned by only one axis. Each piece in the third ring in the third ring can=
be turned by two axes. The inner most ring, the core, can be turned by all=
three axes.=20
The puzzle with four axes is more complicated. For example, there is a ring=
where the pieces can be turned by opposite axes, and another ring where th=
e pieces can be turned by three out of four axes.=20
The point is, for ANY subset of axes, the piece turned by and only by them =
can be found here. In a sense, this is the most "complete" puzzle with this=
number of axis in a 2D plane. All pieces are arranged by "type" into diffe=
rent rings.
It supports a batch input through a textbox. For complicated puzzles this i=
s indeed necessary.
This puzzle is obviously inspired by the Complex 3x3x3 puzzle proposed by M=
att Galla, Carl Hoff, Andreas Nortmann, et al on twistypuzzles.com. I espec=
ially thank Matt for inspiring discussions. I'm looking forward to meeting =
you again to talk about puzzles!
Nan
Very nice puzzle.
I tried a little bit and found in the baby version that the two sequences (=
12)^2 and (123)^2 give interesting results.
Ed
--- In 4D_Cubing@yahoogroups.com, "schuma"
>
> Hi guys,
>=20
> Recently I made a "complex" 2D puzzle that can be played on webpage, call=
ed Lollipop. It can be found here:
>=20
> http://nanma80.github.com/lollipop
>=20
> The shape of the puzzle is a disk. Take the simpliest version with 3 axes=
for example. The outmost ring never flips. Each piece in second ring can b=
e turned by only one axis. Each piece in the third ring in the third ring c=
an be turned by two axes. The inner most ring, the core, can be turned by a=
ll three axes.=20
>=20
> The puzzle with four axes is more complicated. For example, there is a ri=
ng where the pieces can be turned by opposite axes, and another ring where =
the pieces can be turned by three out of four axes.=20
>=20
> The point is, for ANY subset of axes, the piece turned by and only by the=
m can be found here. In a sense, this is the most "complete" puzzle with th=
is number of axis in a 2D plane. All pieces are arranged by "type" into dif=
ferent rings.
>=20
> It supports a batch input through a textbox. For complicated puzzles this=
is indeed necessary.
>=20
> This puzzle is obviously inspired by the Complex 3x3x3 puzzle proposed by=
Matt Galla, Carl Hoff, Andreas Nortmann, et al on twistypuzzles.com. I esp=
ecially thank Matt for inspiring discussions. I'm looking forward to meetin=
g you again to talk about puzzles!
>=20
> Nan
>
Thanks. I'll never try algorithms like 123123 ... Nice discovery!
Nan
--- In 4D_Cubing@yahoogroups.com, "Eduard"
>
> Very nice puzzle.
> I tried a little bit and found in the baby version that the two sequences=
(12)^2 and (123)^2 give interesting results.
> Ed
>=20
Hi all!
Today I've got a letter from Russell Sherrill (who has already solved 3^4=
,4^4,5^4 and 3^5 cubes) about his solve of 3^6! He is #5 in the list. Solve=
took about 175000 twists and about 5 hours. Congratulations!
Funny thing is that last for solves of 3^6 were done exactly every 6 mont=
hs - in September and March :)
Three hours later I've got another letter - from Philip Strimpel (#7 in 1=
20-cell solvers list). He solved the largest MHT633 puzzle - 52 colors! Bef=
ore that he wrote about a problem with the last corner peice (there was a k=
ind of orientation problem that may be seen in Magic Tiles sometimes) - but=
solved it in less than one day. Number of twists is more that 5.17 million=
s and total time of solve is almost 4 months (by timer)! Now Philip is Numb=
er One in the list of 52C solvers. Congratulations!
I'm working on the design of some completely different 4D game now. May b=
e, some day...
Andrey