Post by Tahnan in 4S in 1 comments

Viewing post in 4S in 1 comments

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.

...........
.K.K.K.K.K.
K...K...K..
.K.K.K.K.K.
......K....
K.K.K..K.K.

Hope that helps!

kschoice1 year ago

Thanks, I've been toying around this for a while but never got to the actual solution.

Karoo131 year ago

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?

Tahnan1 year ago

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.

moosemilkowen1 year ago

Can you post your solution for the one with the bunch of apples/one you had to use MS Paint to solve?

Tahnan1 year ago

Oh, dear. Since this was more than two months ago now, I'm sure I don't still have that solution saved anywhere. Sorry!

itch.io

Viewing post in 4S in 1 comments