Assignment 2 Evaluation

Very few out of this large batch tried to do the assignment in a proper spirit.
Many of you tried to "finish" the assignment. Hope to see a good response next time.

Some example programs are given below with no specific ordering.

Pankaj : He has used the algorithm in which next position of the Knight is the one having minimum scope to go further.

Atish : He has used minimum scope algorithm.

Anish : He has used minimum scope algorithm.

Vijay : He has used a heuristic of choossing a position which is near the corner OR more crowded place. This is very similar to the minimum scope algorithm, but it has creativity.

Janak : He has used a combination of heuristic and backtracking. This is a good way in practice to reduce search space considerably and then trying all possible paths in the search space.

If a code appears here, it does NOT mean it is the BEST! You should always try to improve efficiency, look n feel, correctness and user friendliness of your programs. Hope to see more fun next time.