wli75

Hi, I didn't get the foobar challenge but I'm interested in this problem. In this loop, if a majority of the cells are 0, would it amount to exponential time...

Is my following understanding of your algorithm correct? When we first visit (1,0), we add to the queue (2,0) and (1,1). Then we visit (0,1), since (1,1) hasn't been marked...

I've never submitted this solution to foobar, but if you want to try it here you go: https://pastebin.com/1bwF10Lg Otherwise, you may consider modifying Dave's code with the instructions he listed...

I'm glad it works! So cost[i][j][0] stores the shortest path from (0,0) to (i,j) without removing a wall, and cost[i][j][1] stores the shortest path if a wall is removed. If...

The black edge is still there with a white background, but the isomap looks fine to me.  

Apologies for the delay. The black line issue happens to all images. I guess it's a problem with the texture. For now I'm still using eos's rendering and doing something...

I was using a regularisation of 15 in my previous example. You're right. I tried bumping it up to 100, and it works great on an image of 660x400 :D...

Apologies for the delay. I'm planning to look into this some time in late-April. I probably got some things mixed up with the resolutions of my test images.