Write a python function kings_moves(board) that returns True if the inputted board is a valid kings tour.

In chess, the king has the ability to move to any adjacent square in one of the eight directions. A kings tour is defined as a sequence of legal king moves where the king visits every square on the board exactly once. A kings tour on an NxN board is represented as a 2D list, where the numbers range from one to N^2 and represent the order in which each square is visited.

Write a python function kings_moves(board) that returns True if the inputted board is a valid kings tour.

See test cases for examples. Note: your function must work for boards of any size, not just 3x3.

assert(kings_moves(b0) == True)

assert(kings_moves(b1) == False)

assert(kings_moves(b2) == False)

assert(kings_moves(b3) == True)

be - [[3, 2, 1], [6, 4, 9], [5, 7, 8]] b1 = [[1, 2, 3], [7, 4, 8], [6, 5, 9]] b2 [[3, 2, 1], [6, 4, 0], [5, 7, 8]] b3 = [[4,3,2,1,64,63,62,61), [5,54,7,8,57,58,11,60), [53,6,55,56,9,10,59,12], [52,51,50,49,16,15,14,13], [45, 46, 47, 48,17,18,19,20), [44,27,42,41,24,23,38,21], [28,43,26,25,40,39,22,37], [29,30,31,32,33,34,35,36]]