HW 23 Questions

[Sean Hill]

Hey there,

So I'm completely lost for Question #2 on HW 23, help please?

[Paul Felt]

Where are you getting lost? A rudrata path visits every vertex in the graph exactly once (see chapter 8, or think TSP). Recall our discussion of state space searches yesterday. We formulated a backtracking state space search for the n-queens problem by defining a space of increasingly complete partial answers. Each state captured the position of some number of queens on a chessboard. Design a state space that describes increasingly complete rudrata paths. To do this you need to define what a state means in your state space (a partial path?), and how children states are generated from parent states. 

--Paul

On Jul 26, 2012, at 7:49 PM, Sean Hill <sean.da...@gmail.com> wrote:

Hey there,

So I'm completely lost for Question #2 on HW 23, help please?

--
You received this message because you are subscribed to the Google Groups "BYU CS 312 Summer 2012" group.
To post to this group, send email to byu-cs-3...@googlegroups.com.
To unsubscribe from this group, send email to byu-cs-312-sum...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msg/byu-cs-312-summer/-/5gsrMdrCosEJ.
For more options, visit https://groups.google.com/groups/opt_out.