Re: moving pairs
- From: Keith Thompson <kst-u@xxxxxxx>
- Date: Sat, 19 Jul 2008 13:16:23 -0700
mcjason@xxxxxxxxx writes:
On Jul 17, 5:23 am, mcja...@xxxxxxxxx wrote:[67 lines deleted]
I saw something interesting about a grid pair puzzle problem that
might be interesting.
[130 lines deleted]
can anyone back up how this seems to work?
it looks like a machine when you find each that work out the way it
[12 lines deleted]machine that anywhere can say go backwards, or anywhere before can be
read more »- Hide quoted text -
- Show quoted text -...
so see a pair as what has to move at the same time together. see each
each circuit is a part that moves any way on it own but together.
Have you noticed yet that you're the only one participating in this
thread?
When I read your initial flood of long articles, I honestly thought
that the text was computer-generated. I'm still not entirely
convinced that it isn't. (Google "travesty generator" if you don't
understand my point.)
As far as I can tell, you're discussing some kind of puzzle, but
nothing you've said appears to have anything to do with the C
programming language. Your question, if that's what it is, might be
topical in comp.programming or in one of the puzzles groups. It's
certainly not topical here.
--
Keith Thompson (The_Other_Keith) kst-u@xxxxxxx <http://www.ghoti.net/~kst>
Nokia
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"
.
- References:
- moving pairs
- From: mcjason
- Re: moving pairs
- From: mcjason
- moving pairs
- Prev by Date: Re: forward declarations and incomplete types
- Next by Date: Re: forward declarations and incomplete types
- Previous by thread: Re: moving pairs
- Next by thread: Moving bytes in memory
- Index(es):