How to write a c program to generate a self avoiding walk in 2-D?

[himanshu605]

a self-avoiding walk (SAW) is a sequence of random moves, on a
2-D lattice that does not visit the same point more than once.
program should be written to calculate the average of walks moved on 2-D lattice.
picture attaced shows the self avoiding walk in 2-D.

[weaknessforcats]

Exactly what is your question?

[himanshu605]

as we write a program to generate a random walk in 2D, here to write a program to generate a self avoiding walk in 2D.
i hope you know about self avoiding walk, its just a random walk for N(as required) steps but not to come to a point more than once.
and then calculate the average displacement in walking N steps.
please help me to write this program.

[weaknessforcats]

Start by defining an array that maps your walking space.

When you walk to a location [x][y], mark the [x][y] location in your array. That way when you move you can check the array to see if you have been there before.

If your walking area is like a crossword puzzle with blacked out squares, then when the program starts you can initialize your array and mark locations where there are walls. You use a different value here so you can tell the squares where you have been from the walls and from the square you have not visited.

Then write a move function. You supply a start location and a direction. If the move is OK the function returns success. If you have reached the destination, the function returns finished. If a wall or you have been there before, the function returns blocked.

You should now be able to steer this function from inside a loop to navigate from a start location to an end location avoiding walls and squares already visited.