Really great. Every level is really nice in its own way though they're all so different that the difficulty sort of felt like it went all over the place... I took great use of the level select screen.
Very interesting concept. It is a pity that by the time you get to certain levels, you have completely forgotten about certain interactions introduced in the beginning (happened to me for recognizing blocks as minesweeper and sudoku Right-Click).
I cannot believe how well this game worked. (Except maybe Level 23, which I had to write a Python script to solve for me after playing around in MSPaint for an hour or two.)
def fill_grid(grid=None, has_path=None):
if grid is None:
grid = get_base_grid()
if has_path is None:
has_path = {c for c in grid if 0 in c}
while True:
Oh wait that's probably not the solution you wanted. So, sure, in the interests of helping people keep advancing through this--because this was far and away the hardest one in there, including the one where I had to screenshot the apples and draw lines over it in MSPaint--the answer is below, with the mines marked with periods and the sudoku marked with X. But everything is ROT13, so you may need to decrypt it first.
Well that's pretty readable even with the encryption lol, maybe use K and X. I came up with the same solution so it might be unique, very interesting that such a thing has a unique solution. What did your code do, find the positions or push things into place or something else?
I'll spare you my code; the pseudocode is something like:
def fill_grid(grid_so_far, known_paths):
while true:
if all grid spaces are filled and there are 19 Xs in the grid, print and quit
if there aren't enough empty spaces left to reach 19 Xs, return
find the northeastmost space that hasn't been filled
make a new grid where that space has an X and every space around it has a .
if <check_for_path> is true:
fill_grid(new_grid_so_far, new_known_paths)
# if we get here, that must have failed at some step, so...
make that space a "." instead
def check_for_path(grid, known_paths):
for every space in the grid:
if it's already in known_paths, we're good;
otherwise, if it's a ".", crawl through the grid and make sure it's either:
connected by other "." to something that *does* have a known path to the edge
(in which case, add it to the set of things with known paths),
or at least is connected to an empty space
return false if some "." was blocked from the edge, otherwise true
and then run fill_grid() with a grid that has dots along the north and east edge, and all of those dots have (of course) a path to the edge.
Usually I'd guess that there's another symmetric solution, but the "north and east edges only" constraint may prevent that.
← Return to game
Comments
Log in with itch.io to leave a comment.
you can also use the snake one the targets in lvl 15 if you want :3
Very cool concept! Delightful seeing how the games interact! The interactions are very satisfying!
Why do I need to go so far around with the snake? I know what to do already. Does it need to be so far..
how to solve lv1
Minesweeper was my favorite :
how do i beat the one with a buncha apples
i got stuck at 2
are you still stuck?
i want the souurce
Is Level 8 even possible ? I tried so hard and I keep losing on 4 apples.
me too!
Really great. Every level is really nice in its own way though they're all so different that the difficulty sort of felt like it went all over the place... I took great use of the level select screen.
Very interesting concept. It is a pity that by the time you get to certain levels, you have completely forgotten about certain interactions introduced in the beginning (happened to me for recognizing blocks as minesweeper and sudoku Right-Click).
I cannot believe how well this game worked. (Except maybe Level 23, which I had to write a Python script to solve for me after playing around in MSPaint for an hour or two.)
Could you post the solution somewhere ? I gave up.
Sure!
def fill_grid(grid=None, has_path=None): if grid is None: grid = get_base_grid() if has_path is None: has_path = {c for c in grid if 0 in c} while True:Oh wait that's probably not the solution you wanted. So, sure, in the interests of helping people keep advancing through this--because this was far and away the hardest one in there, including the one where I had to screenshot the apples and draw lines over it in MSPaint--the answer is below, with the mines marked with periods and the sudoku marked with X. But everything is ROT13, so you may need to decrypt it first.
Hope that helps!
Thanks, I've been toying around this for a while but never got to the actual solution.
Well that's pretty readable even with the encryption lol, maybe use K and X. I came up with the same solution so it might be unique, very interesting that such a thing has a unique solution. What did your code do, find the positions or push things into place or something else?
I'll spare you my code; the pseudocode is something like:
def fill_grid(grid_so_far, known_paths): while true: if all grid spaces are filled and there are 19 Xs in the grid, print and quit if there aren't enough empty spaces left to reach 19 Xs, return find the northeastmost space that hasn't been filled make a new grid where that space has an X and every space around it has a . if <check_for_path> is true: fill_grid(new_grid_so_far, new_known_paths) # if we get here, that must have failed at some step, so... make that space a "." instead def check_for_path(grid, known_paths): for every space in the grid: if it's already in known_paths, we're good; otherwise, if it's a ".", crawl through the grid and make sure it's either: connected by other "." to something that *does* have a known path to the edge (in which case, add it to the set of things with known paths), or at least is connected to an empty space return false if some "." was blocked from the edge, otherwise true
and then run fill_grid() with a grid that has dots along the north and east edge, and all of those dots have (of course) a path to the edge.
Usually I'd guess that there's another symmetric solution, but the "north and east edges only" constraint may prevent that.
Can you post your solution for the one with the bunch of apples/one you had to use MS Paint to solve?
Oh, dear. Since this was more than two months ago now, I'm sure I don't still have that solution saved anywhere. Sorry!
Can I get a hint? It seems like two of the blocks are against the wall and can't be moved, so I don't see how it is possible
These boxes are clickable.
Thanks!
你还说自己不会出题？