Re: grid pair puzzle

mcjason@xxxxxxxxx wrote:

On Jul 17, 2:06 am, mcja...@xxxxxxxxx wrote:
I saw something interesting about a grid pair puzzle problem that
might be interesting.

it's the problem where in a grid any size you say so many that are
pairs.

|1a|2a|3a|
|2b|1a|3b|
|4a|4b|5a|
|6a|5b|6b|

to make one move is to make the other of the pair move at the same
time, but to solve where it can move first is to figure out every way
it can be solved until you know the last one to move where the first
one chosen to move comes from. a recursive problem said usuallly. the
pairs switch each move.

if I figure each to be able to move with all involved in moving, and
for each they overlap the involved pieces that have to move. so if you
draw somehow how each can be solved with all that have to move
together where you say together with how you can solve the other ones
the way where each that solves a way is together but all that solve
are together with how they solve it makes what looks like a machine
that can move.

so if I pick one to move how it can be solved to move and draw how it
looks now by seeing how they solve now, it looks like if this were a
machine the entire machine has been rearranged where if you pick one
to move as the part of the machine to move, the whole machine is moved
to where that part of the machine moved. that's to draw how they solve
again.

it seems to be able to make a whole machine said with pairs on a board
move to any position the whole machine can be in for any part of the
machine moved. like, it seems to solve a whole machine .

so figure a machine out of these pairs to be a machine that works, see
it in how the ones that solve overlap the other ones that solve to use
the same involved in how any can move.

see it in how it draws again, it's the whole machine moved if one is
moved where it would be for that part of the machine moved.

like, it seems to make the whole machine say it's been running for a
while.

it looks like pairs in a grid can say any machine the way they can be
arranged, like each one that solves a way uses the same pieces as the
others that solve a way, so it looks togther as how they solve as
pieces together and other pieces together, together with eachother.
and to move one that solves any way that it does is to see all over
again how they solve together a new way, and it looks like the whole
machine has moved the way it is to move where only the part of the
machine you want moves.

it seems like any machine that can express a problem to solve can be
said with pairs, where the machine hasn't moved yet but is in original
position, but then in a completely different position it can be in,
just be moving one that solves. sticking with how they rearranged and
moving them again always is the same part of the machine, for the rest
to be different the way they solve but as the rest of the machine the
way it's moved connected the part moved.

can anyone back up how this seems to work?

Try stating the question in English. It looks vaguely like English at first, but
when I try to actually understand it I find myself unable to parse even one
sentence successfully.
--
Patrick Hamlyn posting from Perth, Western Australia
Windsurfing capital of the Southern Hemisphere
Moderator: polyforms group (polyforms-subscribe@xxxxxxxxxxx)
.

Relevant Pages

  • Re: grid pair puzzle
    ... for each they overlap the involved pieces that have to move. ... so if I pick one to move how it can be solved to move and draw how it ... it looks like pairs in a grid can say any machine the way they can be ... just be moving one that solves. ...
    (rec.puzzles)
  • moving pairs
    ... it's the problem where in a grid any size you say so many that are ... for each they overlap the involved pieces that have to move. ... so if I pick one to move how it can be solved to move and draw how it ... just be moving one that solves. ...
    (sci.math)
  • Re: moving pairs
    ... so if I pick one to move how it can be solved to move and draw how it ... just be moving one that solves. ... what won't loop on it's own unless the whole machine's set position is ... a whole machine that altogether has one position to be in, ...
    (sci.math)
  • moving pairs
    ... so if I pick one to move how it can be solved to move and draw how it ... just be moving one that solves. ... what won't loop on it's own unless the whole machine's set position is ... a whole machine that altogether has one position to be in, ...
    (comp.lang.c)
  • Re: moving pairs
    ... draw somehow how each can be solved with all that have to move ... just be moving one that solves. ... what won't loop on it's own unless the whole machine's set position is ... a whole machine that altogether has one position to be in, ...
    (comp.lang.c)