Little Red Riding Hood puzzle describes a scenario where Little Red Riding Hood

Question

Little Red Riding Hood puzzle describes a scenario where Little Red Riding Hood is trying to reach her Grandma's house without being caught by the Big Bad Wolf. The input to the puzzle is a graph describing the layout of the paths through the forest, along with two vertices indicating the entrance to the woods (where Red starts) and Red's Grandmother's house (where the Wolf starts). Each turn. Red has the option to travel down any of the paths available to her. After she does, the wolf will move one step along the shortest path to Red. (If there are multiple shortest paths available, the wolf moves to the intersection that is "alphabetically last.") The solution to the puzzle is the shortest path Red can take to get to her Grandma's house without being caught by the Big Bad Wolf. Answer the following questions about a backtracking algorithm to solve the Little Red Riding Hood puzzle. (a) What are the neighbors of the problem state given in the image above (i.e., the states one transition away)? Please do not spend test time trying to draw the icons in the image. (b) How would the algorithm recognize when to backtrack?

Explanation / Answer

Print out the crossword with words about Little Red Riding Hood-- you have a choice between an easy crossword for younger children and a more challenging crossword for older kids and adults.

Encourage the children to think and fill in the letters. I think crosswords are a great way to expand and practice vocabulary words and reinforce themes you are studying.

Information on Ages/Skills for the different crossword difficulties:

Crossword Templates:

The code for Little Red riding hood puzzle in C++ is as follows -

}

#include <cmath>

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.