1.) Draw a grid of your choice, make sure the shortest path must contain a diagonal step.
2.) Make sure the "diagonal" checkbox is unticked
3.) Run your algorithm and see that it doesn't find the shortest path since it cant move diagonally
4.) click the "diagonal checkbox" and re run your algorithm to see that it now find's the shortest path.
Acceptance Test:
1.) Draw a grid of your choice, make sure the shortest path must contain a diagonal step. 2.) Make sure the "diagonal" checkbox is unticked 3.) Run your algorithm and see that it doesn't find the shortest path since it cant move diagonally 4.) click the "diagonal checkbox" and re run your algorithm to see that it now find's the shortest path.