Really clever idea! I can't seem to wrap my head around some of the puzzles though. It might help if the 1's you set persist after retrying, so I could make small changes and see the effects.
The Turing snake
You control a virtual snake in matrix of bits. Each part of the snake correspond to specific command (move, left, right,...) that will be executed only if its actual bit is 1. Set the proper bits on the matrix in order that the snake reach its targets.
This is a game made in one week-end for the GMTK jam 2019. The theme was "Only one". Here, set some bits to "one" is the only way to interact and progress. Like the classic Snake games, you spend all your time in only one simple map with only one element (the goal to reach). Finally, I tried to build some puzzle where you have to reach distant goal by only changing one bit of the matrix.
- Left click : switch a bit between 0 and 1.
- Space : run or retry if bocked. During run mode, the snake will move according to the commands that have a bit set to 1.
- Right click : In some levels, the snake has blue parts, click on it to change the command of this part of the snake.
This game was made with Unity and the music and sound with https://beepbox.co.
Log in with itch.io to leave a comment.
Thank you for your feedback ! You are right about the persisting state after retry. I would have liked to have time to implement it even for me when I was building some puzzles ^^
Ingenious idea, well done!
This is very good idea! It is a bit hard but very well done!