Hi! I am writing a board game AI, that moves and attacks the player's pieces. Let's say I have a board that is 8x8 squares large and I need to calculate the shortest distance from one square to another, keeping in mind that some of the squares in the path cannot be used, because they are full, so the AI player needs to get around these squares.
Anything is appreciated - ranging from simple ideas to full pieces of c-script code.
Oh, another thing - it would be good if someone could explain to me how to do this using nodes.

Leonardo