Byte Wise Contest #1
----------------------
Submitted by
Ashish Gupta ,Sumanta Bhowmik
Entry No 98131 , 
Room no D-30 , Roo No D-32
Jwalamukhi Hostel
IIT Delhi

----------------------------------------------------------------
DESCRIPTION OF ALGORITHM
----------------------------------------------------------------

The algorithm is a simple iterative approach to simulate all
possible knight moves on the chess board in polynomial time.

It works on a two dimensional array and maintains the current
positions possible of the knight for the current move number.
Then it calculates the next positions for the knight
corresponding to the next move.
After each move it evaluates whether knight or pawn has won
or a stalemate has occured.


The algorithm runs in best case O(n^2) and worst case O(n^3)
time.

-----------------------------------------------------------------