Question description

You are given an n × n board. Your task is to place m coins on the board such that no two of the coins go to the samecell or to two adjacent cells. Two cells are called adjacent if their boundaries share an edge. Two cells with boundariessharing only a corner will not be called adjacent. Write a program that prints all possible arrangements of m coins in then × n board. Your program must not use any global or static variables.Here is a sample output for n = 4 and m = 7. The output is shown in a multi-column format to save space.Arrangement 1:

"Are you looking for this answer? We can Help click Order Now"