Thread: "Minimal number of pieces affected via a slice move in"

--------------38D397C073C7662E2113C78E
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit

To me, the answer is a clear YES.  You can do those slice moves
analogously to 3D, and they make sense.  It even works in MC4D as
implemented.

In the 3^4 hypercube puzzle in MC4D, f you hold down the 2 key as you
click a move with your mouse, your action will only affect slice 2 of
the puzzle.   I must made a macro with 1 move in it, an  M slice move. 
So, MC4D seems to think it's a valid single move, internally.


Marc

On 9/26/2019 5:59 AM, pauloliver.timmons@gmail.com [4D_Cubing] wrote:
>
> My question relates to three divisions per side.
> Is it possible to move just eight "pieces" in 4D? It looks like this
> should be possible by moving four 3-coloured cubies and four
> 2-coloured cubies (using either the smaller cube jnside or the larger
> outside cube). Slice move only so no 4-coloured pieces affected.
> Although this option is not implemented in the MC4D model ? But
> perhaps my understanding is flawed. Please can someone illuminate - I
> am particularly interested in higher than four dimensions also i.e.
> could one always move a layer just affecting eight pieces in isolation
> (ignoring the piece that exposed no stickers)
> Paul
>
>


--------------38D397C073C7662E2113C78E
Content-Type: text/html; charset=utf-8
Content-Transfer-Encoding: 8bit






To me, the answer is a clear YES.  You can do those slice moves
analogously to 3D, and they make sense.  It even works in MC4D as
implemented.



In the 3^4 hypercube puzzle in MC4D, f you hold down the 2 key as
you click a move with your mouse, your action will only affect slice
2 of the puzzle.   I must made a macro with 1 move in it, an  M
slice move.  So, MC4D seems to think it's a valid single move,
internally.

 

My question relates to three divisions per side.

Is it possible to move just eight "pieces" in 4D? It looks
like this should be possible by moving four 3-coloured
cubies and four 2-coloured cubies (using either the
smaller cube jnside or the larger outside cube). Slice
move only so no 4-coloured pieces affected.

Although this option is not implemented in the MC4D model
? But perhaps my understanding is flawed. Please can
someone illuminate - I am particularly interested in
higher than four dimensions also i.e. could one always
move a layer just affecting eight pieces in isolation
(ignoring the piece that exposed no stickers)

Paul

--------------DABF2C184009B93FBC0EC34D
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: quoted-printable

Dear Ed,

That's a fascinating report. I believe I remember you telling us of a small=
MT puzzle that you found particularly difficult because no 3-cycles are po=
ssible. Do you remember which that was? Also, which other small MT puzzles =
do you think are particularly difficult for their size?

Best,
-Melinda

On 9/28/2019 4:38 AM, 'Eduard Baumann' ed.baumann@bluewin.ch [4D_Cubing] wr=
ote:
>
> Fascination with=A0MagicTile an no end!
> MagicTile "Eucl KB {6,3} 16 e200" has a special interest. With 16 colours=
it is big enough to force _parity_ considerations.
> In fact I have done about 5500 moves in 10 days when I detected a _parity=
problem_ which forced me to restart!
>
> If after scrambling, where all parts move, you put attention only to the =
color neighbourhoods then you can realise an _implicit shift of the whole w=
hich impact the parity_ !
> The solution is that you bring each part exactly (absolutely) at his home=
position!
>
> If scrambling would include view changements then I think the puzzle is a=
lmost impossible to solve.
> I bring home each type of parts in a certain order and I do strictly _no =
preassembling_. This is the reason that I need about 3 times more moves tha=
n the very clever Micheal Gottlieb.


--------------DABF2C184009B93FBC0EC34D
Content-Type: text/html; charset=windows-1252
Content-Transfer-Encoding: quoted-printable



charset=3Dwindows-1252">


Dear Ed,



That's a fascinating report. I believe I remember you telling us of
a small MT puzzle that you found particularly difficult because no
3-cycles are possible. Do you remember which that was? Also, which
other small MT puzzles do you think are particularly difficult for
their size?



Best,

-Melinda

cite=3D"mid:F8F90C1CD16F497790BCE8FF372E10AE@LAB">

face=3D"Arial">Fascination with=A0MagicTile an n=
o
end!

=A0

MagicTile "Eu=
cl
KB {6,3} 16 e200" has a special interest. With 16 colours
it is big enough to force parity considerations. t>

In fact I hav=
e
done about 5500 moves in 10 days when I detected a parity
problem which forced me to restart!

If after scrambling, where all parts move, you put
attention only to the color neighbourhoods then you can
realise an implicit shift of the whole
which impact the parity !=A0v>

=A0

The solution is that you bring
each part exactly (absolutely) at his home position!



If scrambling would include view changements then I think
the puzzle is almost impossible to solve.

=A0

I bring home each type of part=
s
in a certain order and I do strictly no preassembling.
This is the reason that I need about 3 times more moves than
the very clever Micheal Gottlieb.