So, after seeing a bunch of the Enigmo screenshots and conversations, I thought to ask about a level I was having trouble with in Numba another game that's been released through the App store.
This got me thinking though. Since correct chains are always defined by the difference between each of the adjacent numbers being the same (except for the special case of doubling), is there a systematic way to look at these puzzles?
What I mean by this is that given a chain of items A-B-C for example, the difference between A and B will be the same as that between B and C (the case of doubling will be omitted until the end, and all analysis that does not specifically include doubling should be assumed to exclude it).
Examples:
Straight Run Tiles: 1-2-3-4-5 Differences: 1-1-1-1
Odd Run Tiles: 1-3-5-7-9 Differences: 2-2-2-2
Same Numbas Tiles: 5-5-5-5-5 Differences: 0-0-0-0
Reverse Run Tiles: 9-8-7-6-5 Differences: 1-1-1-1
Even Run Tiles: 2-4-6-8 Differences: 2-2-2
Incremental I Tiles: 2-5-8 Differences: 3-3
Incremental II Tiles: 1-5-9 Differences: 4-4
See, in all these cases the differences are the same. The only other difference patterns that are allowed other than all equal are 1-2-4-8 and all its subsets and reverses which are seen in the doubling and reverse doubling.
I played with this in excel and it's actually pretty easy to indicate all possible moves and chains following a move, but as a non-programmer, this involves some relatively serious redundancy on my part. Obviously things get a bit more complicated with chameleon squares, but since they always follow an identified pattern, I don't think that would add much more complexity.
So, anyone who knows anything about programming played with this at all?
The reason I'm asking is I'm incredibly stuck on level 46 of the puzzle mode.
- - 2r 2r - -
- 8r 7r 5r 4r -
- 2 2 7 5 -
- 4r 1r 2r 3r -
- 5 3 6 6 -
1 5r 1r 2r 6r 3
5 9 1 4 9 6
9 9 7r 8r 9 9
where "-" represent blank spaces and r indicates that a tile is a chameleon tile.
So, as I'm trying to figure this out from cumulative logic and heuristics, it occurred to me that someone could just run all the possible combinations. And now I'm curious: could this be done?
Rules:
1. you must clear all tiles from board
2. chains are at least 3 tiles in length
3. you can go left/right and up and down to connect tiles, but not diagonals
4. you can connect tiles such that the difference between each pair in the chain is the same or equals some subset of 1-2-4-8.
5. After each chain is cleared, the chameleon "r" tiles all increase by one with 9 rolling over to 1 and the tiles all fall down. They never move horizontally.
This got me thinking though. Since correct chains are always defined by the difference between each of the adjacent numbers being the same (except for the special case of doubling), is there a systematic way to look at these puzzles?
What I mean by this is that given a chain of items A-B-C for example, the difference between A and B will be the same as that between B and C (the case of doubling will be omitted until the end, and all analysis that does not specifically include doubling should be assumed to exclude it).
Examples:
Straight Run Tiles: 1-2-3-4-5 Differences: 1-1-1-1
Odd Run Tiles: 1-3-5-7-9 Differences: 2-2-2-2
Same Numbas Tiles: 5-5-5-5-5 Differences: 0-0-0-0
Reverse Run Tiles: 9-8-7-6-5 Differences: 1-1-1-1
Even Run Tiles: 2-4-6-8 Differences: 2-2-2
Incremental I Tiles: 2-5-8 Differences: 3-3
Incremental II Tiles: 1-5-9 Differences: 4-4
See, in all these cases the differences are the same. The only other difference patterns that are allowed other than all equal are 1-2-4-8 and all its subsets and reverses which are seen in the doubling and reverse doubling.
I played with this in excel and it's actually pretty easy to indicate all possible moves and chains following a move, but as a non-programmer, this involves some relatively serious redundancy on my part. Obviously things get a bit more complicated with chameleon squares, but since they always follow an identified pattern, I don't think that would add much more complexity.
So, anyone who knows anything about programming played with this at all?
The reason I'm asking is I'm incredibly stuck on level 46 of the puzzle mode.
- - 2r 2r - -
- 8r 7r 5r 4r -
- 2 2 7 5 -
- 4r 1r 2r 3r -
- 5 3 6 6 -
1 5r 1r 2r 6r 3
5 9 1 4 9 6
9 9 7r 8r 9 9
where "-" represent blank spaces and r indicates that a tile is a chameleon tile.
So, as I'm trying to figure this out from cumulative logic and heuristics, it occurred to me that someone could just run all the possible combinations. And now I'm curious: could this be done?
Rules:
1. you must clear all tiles from board
2. chains are at least 3 tiles in length
3. you can go left/right and up and down to connect tiles, but not diagonals
4. you can connect tiles such that the difference between each pair in the chain is the same or equals some subset of 1-2-4-8.
5. After each chain is cleared, the chameleon "r" tiles all increase by one with 9 rolling over to 1 and the tiles all fall down. They never move horizontally.
