import Numeric def knight_travel(size,start_x,start_y): array = Numeric.zeros([size,size]) poss_moves = [[2,-1],[2,1],[-2,1],[-2,-1],[1,2],[-1,2],[1,-2],[-1,-2]] history = [] curr_x = start_x curr_y = start_y num_moves=1 while num_moves <= size*size: for move in poss_moves: move_x=curr_x+move[0] move_y=curr_y+move[1] if move_x>=0 and move_x=0 and move_y