This site uses cookies to analyze traffic and improve service.

By using this site, you agree to this use. See details.

  • 61

What will I learn?


In this puzzle, you use associative arrays to bind arbitrary types and directions. You compute a list of all possible actions and prune this decision with a backtracking algorithm.


The goal of this puzzle is to move Thor at the correct position of the map to attract as many giants as possible close to you, and strike them at the last moment. You have a limited number of strike available.

Solve it

A higher resolution is required to access the IDE


Thor finally got his hammer back. Just on time apparently because hoards of giants are approaching, intent on killing Thor. And they won't stop there! The giants plan to take over Asgard and conquer all worlds of the Yggdrasil. Construct a battle strategy to destroy all the giants and prevent Ragnarok. It's Hammer Time.


This difficult puzzle is the second of the two exercises proposed for the challenge « Ragnarok ». In order to get started properly with this puzzle, get your code from the « Power Of Thor - Episode 1 » easy puzzle, that will give you a basic program to manage Thor's movements.

Online Participants