|
Re: Inaugural Programming Challenge
I think @Marlow's new solution is the best anyone will come up with. It scales linearly with dimensions and logarithmically with iterations. While the number of iterations is not constant per a constant input, it allows converges faster than the standard A* algorithm and it does not matter how large the search space is.
I was hoping to do one of these challenges every few months, but it doesn't seem like it got very much interest.
__________________
"You're a gentleman," they used to say to him. "You shouldn't have gone murdering people with a hatchet; that's no occupation for a gentleman."
Last edited by faust1706 : 02-07-2015 at 00:43.
|