#36 peg solitaire solution generator

If result: # True if it's a goal, None otherwise You also need to not shortcircuit the for loop unless you have found a goal tested_nodes=set() Otherwise you will have an infinite loop. Since you are allowed to jump over empty holes, you'll have to keep track of any nodes you have already visited. So basically I think my succ() function is doing the right thing (maybe it's not?), but my solve_board() recursion might be funky, because the board doesn't solve. Return (pegs = 1) # returns True if there is only 1 peg

#36 peg solitaire solution generator

Well, my recursive puzzle solver function that will use the generator isn't working, maybe you can help me out? def goal(self, node): Or is it? (I think it is, maybe you can help come up with a more Pythonic way?)

Now if you know depth-first search, this seems like a GREAT generator to use when solving this puzzle. New_node = 0 # take out the peg here if there was one New_node = 1 # this is where we're moving the peg So, I have a generator function here that finds all legal moves for a certain 'node', or a game board: def succ(self, node): You can move a peg backwards or forwards two holes at a time (but you can only move to an empty hole), and if you jump over another peg in the process you take it out and it becomes a hole. There's a board with 10 holes and 9 pegs, a peg is represented by a 1 and an empty spot by a 0. For those unfamiliar with the game it's pretty simple. Okay so basically I'm trying to do a depth-first search for a mini-peg solitaire game.