ELABORATE THE FUNKY CHESS PROBLEM

#1

can someone elaborate the question I didn’t get the logic behind?

#2

So the question goes like
u are given an integer n
which denotes a n*n board
but not all cells in the board are placable ie the knight cannot visit those cells in its journey
in the figure it no placable elements are given by yellow
image
no u need to tell the minimum no of cells that can never be visited in one journey.
ie u have to rectify maximum no of cells the knight can traverse in 1 journey

this is basically a backtracking question where u mantaing the max count till now for that cell.

1 Like
#3

okay okay I got it thanks :slight_smile:

1 Like