human
Minimum Cuts can be made in the Chessboard such that it is not divided into 2 parts | function that calculates the maximum no . of cuts.
Driver code.
Calling function ."
How can the above be solved in Python?
assistant
#Here is code to minimum Cuts can be made in the Chessboard such that it is not divided into 2 parts and the other steps required.
 def numberOfCuts ( M , N ) :
	result = 0
	result = ( M - 1 ) * ( N - 1 )
	return result
if __name__ == ' _ _ main _ _ ' :
	M , N = 4 , 4
	Cuts = numberOfCuts ( M , N )
	print ( " Maximum ▁ cuts ▁ = ▁ " , Cuts )