human
Total position where king can reach on a chessboard in exactly M moves | Set 2 | Function to return the count of squares that can be visited by king in m moves.
To store the count of squares.
Check all squares of the chessboard.
Check if square ( i , j ) is at a distance <= m units from king 's current position.
Return count of squares.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to total position where king can reach on a chessboard in exactly M moves and the other steps required.
 def countSquares ( r , c , m ) :
	squares = 0
	for i in range ( 1 , 9 ) :
		for j in range ( 1 , 9 ) :
			if ( max ( abs ( i - r ) , abs ( j - c ) ) <= m ) :
				squares = squares + 1
	return squares
r = 4
c = 4
m = 1
print ( countSquares ( r , c , m ) ) ;