On 12/2/09, Dave Angel da...@ieee.org wrote:
Joel Madigan wrote:
Hi everyone!
Sorry this isn't strictly a Python question but my algorithms professor
contends that given the standard recursive-backtracking maze solving
algorithm:
width=6
height=4
maze=[[1,0,1,1,0,1],
[0,0,1,0,0,0
Hi everyone!
Sorry this isn't strictly a Python question but my algorithms professor
contends that given the standard recursive-backtracking maze solving
algorithm:
width=6
height=4
maze=[[1,0,1,1,0,1],
[0,0,1,0,0,0],
[1,0,1,0,1,0],
[0,0,0,0,1,1]]
visited = [[False for x in
Start here:
http://www.lmgtfy.com/?q=python+string
On Wed, Apr 29, 2009 at 10:36 AM, Jim Carlock
jcarl...@munged.microcosmotalk.com wrote:
Anyone here able to provide a link to the Python functions for
comparing strings and updating strings? I'm looking to do some
character by character
