I've come up with many problems:
- How do you limit the number of moves it takes to get from entrance to exit? And if you don't, you would have to double the size of the array, but how do you make it to the set size?
- No matter what I put into the recursion, it's only running twice, someones three times at most. How the heck do I fix that?
And then another problem..which, yeah. Wait..no...if i reuse the method that I wrote for the solving of the maze, I would not have to OH MY GAWD I WOULDN'T...
OH MY GOSH I THINK I HAVE A SOLUTION!
DON'T BOTHER TRACKING AND REMEMBERING WHERE YOU WERE BEFORE! JUST ALLOW THE COMPUTER TO FIND THAT OUT LATTTEER!
Okai. Well, the computer only ran the method 3 times, but i guess that's an improvement..sigh. I don't know what to do!
OH MY GOSH I THINK I HAVE A SOLUTION!
DON'T BOTHER TRACKING AND REMEMBERING WHERE YOU WERE BEFORE! JUST ALLOW THE COMPUTER TO FIND THAT OUT LATTTEER!
Okai. Well, the computer only ran the method 3 times, but i guess that's an improvement..sigh. I don't know what to do!
No comments:
Post a Comment