What will I learn?
This puzzle makes you efficiently backtrack through a decision tree, and learn to prune this tree based on a heuristic.
Storing your problem to an efficient data structure will help you optimize your solution
TO HELP YOU GET STARTED
Focus on a Puzzle: There Is No Spoon 2 by CyberLemonadeExternal resources
BacktrackingHeuristicHashiwokakeroLearning Opportunities
This puzzle can be solved using the following concepts. Practice using these concepts and improve your skills.
Statement
You need to solve a game of Hashiwokakero, building bridges between cells of a grid, forming a graph. In order to solve this problem, you will need an efficient way to store possible solutions for each step, and backtrack through this possibilities in order to find the optimal one.
A higher resolution is required to access the IDE
Story
This puzzle is part of a series of two exercises proposed during the “There is no Spoon” contest. Before you solve it, try out the first level, « There Is No Spoon - Episode 1 ».