Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (dan815):

Finding fast algorithms for mazes Lets make it a simple maze for now, 1 exit 1 entrance only

OpenStudy (anonymous):

@Kainui

OpenStudy (anonymous):

|dw:1444597955299:dw|

OpenStudy (anonymous):

wait what, im confused

OpenStudy (kainui):

Ok so now what?

OpenStudy (anonymous):

okay like, suppose you travel on left wall all the time sometimes that bad

OpenStudy (anonymous):

it could be the longest possible computation

OpenStudy (anonymous):

|dw:1444598244203:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!