On Aug 15, 2011, at 3:10 PM, Racket Noob wrote: > I don't understand this exercise: > > Exercise 32.3.2. Develop a function that, given a board and the board > position of a peg, determines whether or not the peg can jump. We call such a > peg enabled. > Develop a function that, given a board and the board position of an enabled > peg, creates a board that represents the next configuration. > > But, it may be the case that an enabled peg can jump to more than one of free > places. Thus, we can have more then one new configurations, no?
Good catch. Now design a function that returns a list of next configurations for an 'enabled' peg. Alternatively, design a function that picks one of the feasible successor configurations.
_________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
