flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
Picnic 28 Jul 2008, 19:18
Hello,
This is something i wrote in Flat Assembler v1.67.28 Four Bit Mazes is a simple but challenging puzzle for Windows XP, will probably not run properly in older Windows. All these mazes use just four binary bits to create a sixteen-state maze, yet some mazes are very easy, and some very difficult depending on what rule was used during maze construction. This version with nine levels is a remake of Andrea's Gilbert Java applet and the challenge is to switch off four lights. Details of all rules are listed below but can you work out each rule without seeing it? And does actually knowing the rule make the challenge any easier? (the name of each maze may give you a hint). The Rules ------------- All OK: is a training challenge. You can always push any button, which just clicks the associated light on and off. Wrong move reset: is a simple four-move challenge. But one wrong move and you go back to the start. PIN code: also has a four-move solution, but this time you do not get immediate feedback that you went down the wrong path. The maze forks like a tree, and just one "leaf" is the exit. Memory: is a real memory test, requiring fifteen moves to solve, passing through all states. Again, one wrong move and you go back to the start. Deeper & deeper: is a progressive maze. As you switch a light off a maximum of one light will come back on giving you a feeling of progress through the maze. Four-Bit maze: is a non-progressive maze. More than one light may come back on in this maze so it's harder to tell how well you're doing. No sense: is even less progressive than Four-Bit, the change of lights is totally unrelated to the button that you push. Karnaugh: is like walking through a Karnaugh diagram. As in All OK each button only affects its own light, and you can turn lights both off and on, but this time not all buttons will be enabled. One way: is similar to Karnaugh. However once you have moved forward by pushing a button, the button will always be left disabled so you cannot simply reverse you last move to try different options.
Last edited by Picnic on 30 Mar 2012, 22:00; edited 1 time in total |
|||||||||||
![]() |
|
edfed 28 Jul 2008, 19:34
![]() |
|||
![]() |
|
Picnic 28 Jul 2008, 20:03
Well, it's a puzzle edfed, a small one.
|
|||
![]() |
|
vid 28 Jul 2008, 20:05
Nice one!
Are you sure the last one is 16-state? (since button can be disabled) |
|||
![]() |
|
Picnic 29 Jul 2008, 15:58
Thanks vid.
Nice remark, level nine is queer. |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2025, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.