Thread: Represent Maze

Originally Posted by MK27

Sure, but a graph node (for a 2D maze) looks (something) like this:

Code:

struct node {
    int ID;  // not necessary
    struct node *north;
    struct node *south;
    struct node *east;
    struct node *west;
}

It already contains a list of adjacent nodes.

Also, you need all the nodes, not just the decision points, or the "decision points" will have no relation.

Why there will be no relation. The decision points will be connected with an edge and the edge will have a weight equal to the no of squares in between.

Originally Posted by iamnew

Why there will be no relation. The decision points will be connected with an edge and the edge will have a weight equal to the no of squares in between.

How do you know what the "right" decision points are until you solve the maze? If you're going by the unsolved version, every square is then a "decision point".