Germany is organizing a world level chess championship. Various players participated in the tournament all over the world. Each player is assigned a different puzzle to solve related to chess only. In the final level, they are planning to give a single puzzle to solve to both of the contestants. Assuming that the king starts on some square of an infinite chessboard. In the puzzle of chess, the king can move to any neighboring square horizontally, vertically, or diagonally. In this puzzle, the king takes one move extra after n number of moves. You have to find that in how many different squares can the king be after n moves?
Answers
Answered by
0
Answer:
lol idk
Step-by-step explanation:
noone cares blablablablsblabls
Answered by
0
Answer:
2 0r 5 0r 1
Step-by-step explanation:
Because I exactly don't know the answer as I'm not a quiz player i just heard of this somewhere
Similar questions