queen_boards

Recursion32

Objective

Write a program that lists every valid placement for the N queens puzzle.

Steps

The program expects one argument: a non-negative board size n.
Place exactly one queen in each column.
A solution line contains the row index for each column, from column 0 to column n - 1.
Rows are zero-based and values are separated by one space.
For n = 0, print one empty solution line.
Print solutions in the order produced by trying rows from 0 to n - 1 in each column.
If there is no solution, print nothing.
Return 1 when the argument count is wrong.

examples

$ ./queen_boards 4 | cat -e

1 3 0 2$ 2 0 3 1$

$ ./queen_boards 2 | cat -e

(no output)

Constraints

Expected files

queen_boards.c

Allowed functions

atoiwritefprintfmalloccallocreallocfree

Tests

Run the tests to grade your code

Build

01Zero by zero board

02One by one board

03No solution for two

04No solution for three

05Five by five board

06Missing size

07Four by four board

queen_boards

Objective

Write a program that lists every valid placement for the N queens puzzle.

Steps

The program expects one argument: a non-negative board size n.
Place exactly one queen in each column.
A solution line contains the row index for each column, from column 0 to column n - 1.
Rows are zero-based and values are separated by one space.
For n = 0, print one empty solution line.
Print solutions in the order produced by trying rows from 0 to n - 1 in each column.
If there is no solution, print nothing.
Return 1 when the argument count is wrong.

examples

$ ./queen_boards 4 | cat -e

1 3 0 2$ 2 0 3 1$

$ ./queen_boards 2 | cat -e

(no output)

Constraints

Expected files

queen_boards.c

Allowed functions

atoiwritefprintfmalloccallocreallocfree

queen_boards

Recursion32

Objective

Write a program that lists every valid placement for the N queens puzzle.

Steps

The program expects one argument: a non-negative board size n.
Place exactly one queen in each column.
A solution line contains the row index for each column, from column 0 to column n - 1.
Rows are zero-based and values are separated by one space.
For n = 0, print one empty solution line.
Print solutions in the order produced by trying rows from 0 to n - 1 in each column.
If there is no solution, print nothing.
Return 1 when the argument count is wrong.

examples

$ ./queen_boards 4 | cat -e

1 3 0 2$ 2 0 3 1$

$ ./queen_boards 2 | cat -e

(no output)

Constraints

Expected files

queen_boards.c

Allowed functions

atoiwritefprintfmalloccallocreallocfree

Tests

Run the tests to grade your code

Build

01Zero by zero board

02One by one board

03No solution for two

04No solution for three

05Five by five board

06Missing size

07Four by four board