Programming Fundamentals [Coding]

[Avenue]

This is for a different question lmao

Now hop off your high horse xDDD

He's right though, you'll learn more from it that way. Post your question here and how you think it can be done, I'm pretty sure many of us are willing to help you then.

 

[70i]

This is for a different question lmao

Now hop off your high horse xDDD

I don't know why I'm helping you with this. Wasn't as difficult as I originally thought. This should work.

if(tree on right and can move straight)
   move ahead 
else if(there's no tree on right)
   turn right, move
else if(no tree on left and cant move straight) 
   turn left, move
else
   you need to backtrack, turn left twice and move, 

call this function again

 

[Avenue]

I don't know why I'm helping you with this. Wasn't as difficult as I originally thought. This should work.

if(tree on right and can move straight)
   move ahead 
else if(there's no tree on right)
   turn right, move
else if(no tree on left and cant move straight) 
   turn left, move
else
   you need to backtrack, turn left twice and move, 

call this function again

It would get stuck in this scenario:

 

[Lured Yah]

Try taking a look at the A* algorithm, I'd love to help you, but I'm gonna start my assignments on AI next week

 

[70i]

It would get stuck in this scenario:

You're right it would. But I don't think the mazes are going to have loops because in the instructions it says you can implement the right hand rule which would have the same problem.

 

[Jeff]

I don't know why I'm helping you with this. Wasn't as difficult as I originally thought. This should work.

if(tree on right and can move straight)
   move ahead 
else if(there's no tree on right)
   turn right, move
else if(no tree on left and cant move straight) 
   turn left, move
else
   you need to backtrack, turn left twice and move, 

call this function again

Last time I'm gonna say it, it's for a different question lmao