Assume that a maze is a rectangular array of squares, some of which are blocked to represent walls. The maze has one entrance and one exit. For example, if x’s represent the walls, a maze could appear as follows:

xxxxxxxxxxxxxxxxxx.x  x…..x…….xxxx.x  x.xxxxx.xxxxx…xx.x  x.xxxxx.xxxxxxx.xx.x  x.x……….xx.xx.x  x.xxxxxxxxxx.xx….x  xxxxxxxxxxxxoxxxxxxx

write a program that assumes that a maze is a rectangular array of squares, some of which are blocked to represent walls. The maze has one entrance and one exit

Leave a Reply

Your email address will not be published. Required fields are marked *

Assume that a maze is a rectangular array of squares, some of which are blocked to represent walls. The maze has one entrance and one exit. For example, if x’s represent the walls, a maze could appear as follows:

xxxxxxxxxxxxxxxxxx.x  x…..x…….xxxx.x  x.xxxxx.xxxxx…xx.x  x.xxxxx.xxxxxxx.xx.x  x.x……….xx.xx.x  x.xxxxxxxxxx.xx….x  xxxxxxxxxxxxoxxxxxxx

write a program that assumes that a maze is a rectangular array of squares, some of which are blocked to represent walls. The maze has one entrance and one exit

Leave a Reply

Your email address will not be published. Required fields are marked *