Too stupid to think out what could be the algorithm to solve this problem.
I`v got an maze, that consist of "0" and "1". I`ve got a start point and a end point. Is that possible to make an algorithm that finds out if there is a free way from starting to end point?

Example



In this example the waqy exists. Where S- starting and E-ending. The way is showed as 1`s. The zeros are for example walls.

there was a similar problem posted some days ago:

you probably should try to use the pathfinding algorithm... a usable implementation you can find here: www.hanisch-software...iges/pathfinding.php