Recursion

xhzne_nlhfu
timer Asked: Jul 30th, 2014

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 same

cell or to two adjacent cells. Two cells are called adjacent if their boundaries share an edge. Two cells with boundaries

sharing only a corner will not be called adjacent. Write a program that prints all possible arrangements of m coins in the

n × 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:

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

This question has not been answered.

Create a free account to get help with this and any other question!

Similar Content

Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors