Escape Level : "Langton Cubes (4 values)" by N7DOT

« back Browsing Levels: #3743 "Langton Cubes (4 values)"


prev: #3742 "Learn a trick 16.2"	next: #3744 "Langton Cubes (4 values)"

"Langton Cubes (4 values)" by N7DOT

added 14 Nov 2013 00:17

Solved 1/1

Cooked 0/1

Difficulty 3.00

Style 4.00

Rigidity 7.00

Shortest Solution
By N7DOT

On 14 Nov 2013 00:17

Comments (turn spoilers on)

18577 Langton Cubes (4 values) N7DOT (2227) Thu 14 Nov 2013 01:36

Moved to graveyard:
Back to the drawing board for anti-cooking purposes...

(also, I completed antoher implementation, but the solution is long enough due to the puzzle's length itself that I can't upload it yet)

18576 Langton Cubes (4 values) N7DOT (2227) Thu 14 Nov 2013 01:33

That is an oops! That's going to be a pain to fix... (I'm not going to settle for 3 values since that is too easy...)

18574 Langton Cubes (4 values) N7DOT (2227) Thu 14 Nov 2013 00:17

'Langton Cubes (4 values)' uploaded by N7DOT:
Here is a implementation of the puzzle mentioned earlier. The original version I was working on had 8 different values, but that was going to require a lot of tedious copying and remote destination setting in a huge jungle of a D-map. So I decided that I should at least make a simpler version that wasn't such a mess. And how much simpler it is.

Before I go any further, I should probably state what's being implemented in the first place! The puzzle is this:

Place N pairs of cards in a row with values 1 to N, and then rearrange the cards such that for any two cards with value X there are exactly X cards separating them.
In the case of N=4 (as it is here) there is only one solution, ignoring its reflection. This means that the rigidity should be very high; maybe around a 9.

Grey=1, Blue=2, Red=3, Green=4

(and I know, calling them cubes then cards is silly; cards are an easy way to try the puzzle yourself, and the cubes bit... well, I'll leave that to you)

Comments (turn spoilers on)

18577	Langton Cubes (4 values)	N7DOT (2227)	Thu 14 Nov 2013 01:36
	Moved to graveyard: Back to the drawing board for anti-cooking purposes... (also, I completed antoher implementation, but the solution is long enough due to the puzzle's length itself that I can't upload it yet)

18576	Langton Cubes (4 values)	N7DOT (2227)	Thu 14 Nov 2013 01:33
	That is an oops! That's going to be a pain to fix... (I'm not going to settle for 3 values since that is too easy...)

18574	Langton Cubes (4 values)	N7DOT (2227)	Thu 14 Nov 2013 00:17
	'Langton Cubes (4 values)' uploaded by N7DOT: Here is a implementation of the puzzle mentioned earlier. The original version I was working on had 8 different values, but that was going to require a lot of tedious copying and remote destination setting in a huge jungle of a D-map. So I decided that I should at least make a simpler version that wasn't such a mess. And how much simpler it is. Before I go any further, I should probably state what's being implemented in the first place! The puzzle is this: Place N pairs of cards in a row with values 1 to N, and then rearrange the cards such that for any two cards with value X there are exactly X cards separating them. In the case of N=4 (as it is here) there is only one solution, ignoring its reflection. This means that the rigidity should be very high; maybe around a 9. Grey=1, Blue=2, Red=3, Green=4 (and I know, calling them cubes then cards is silly; cards are an easy way to try the puzzle yourself, and the cubes bit... well, I'll leave that to you)