This is my recomendation order to solve hard puzzles, starting with the easiest one:
Super computer
Roller coaster
Surface
CGX Formatter
Genome sequencing
Bender-The money machine
TAN Network
Vendetta
skynet: the bridge
Thor vs Giants
Bender-Algorithmic complexity
skynet strikes back
clones: one step further
Indiana level 2
the labyrinth
I solved the first three in a day , you were right @scrauler ! I just had some problems with flood fill because i used the recursive version and, well, the stack exploded ^^ but then I rewrote it to the queue version and it worked.
Until now i didn’t need the others algorithm but i’ve look into them and it looks hard for me to implement them for now ( more precisely make them fit the context ) but i guess i will learn with practice
Thanks a bunch!
The order you provided really helped me.
Before discovering your post, I started with The labyrinth and it took me about 1 week (not full-time) to solve it.
But then, I solved Super Computer, Roller Coaster and Surface in a few hours.
Wait, what? A* is Dijkstra with heuristics, it can’t be easier and it’s also more specialised than Dijkstra (because you can’t use the same heuristics for every cases while Dijkstra never changes).
i need informed algorithm to search path from one point to another determined point, not all of them - so it is easier to understand
also, where the topic starter will put APU: Improvement Phase puzzle on this scale?
Why do you think it should be there? I’ve done 80+% of the hard section, but the very hard section is filled with really difficult puzzle, and I personally don’t think that APU improvement should be there, it’s fine in hard (at least for me).
If you disagree, feel free to explain why you think it should be in very hard section.