Back
Close
  • 5

What will I practice?

DFSBrute-forcePattern recognitionSimulation

In this puzzle, you have to simulate the behaviour of the game in order to make the right decisions. You also have to use backtracking to find the best solution out of a decision tree.

External resources

PruningDecision tree

Statement

You need to find the best successive positions to place bombs on a grid, in order to maximize the amount of destroyed blocks while minimizing the amount of bombs used.

You will have to foresee the impact of your actions in order to create new opportunities, and account for the fact that blocks can now move (compared to the episode 1).

A higher resolution is required to access the IDE

63 FPS (58-63)

DEBUG MODE

QUALITY

SPEED

0/0
0/0

Story

Help V hack the super-computer, Fate, from his vPad, by strategically placing fork-bombs to destroy its firewall.

 

A more complex version of the « Vox Codei - Episode 1 » puzzle. Now with moving blocs!

Online Participants