
We are given a partially filled n*n square board, row counts and column counts.
The board is partially filled with pebbles denoted by 1 and arrows, The board also has empty cells that are denoted by 0s.
The mapping for arrows is as follows:
N => is an arrow pointing north
W => is an arrow pointing west
S => is an arrow pointing south
E => is an arrow pointing east
NW => is an arrow pointing north-west
NE => is an arrow pointing north-east
SW => is an arrow pointing south-west
SE => is an arrow pointing south-east
- We want to place pebbles (designated by 1s) on the board in the empty cells (denoted by 0s) such that each arrow points to atleast one pebble.
- Pebbles cannot be placed on the cells containing arrows
- Cells already containing pebbles cannot be touched
- Each row and column should contain as many pebbles as specified in the input, by the row constraints and the column constraints
- Empty cells can remain empty in the solved board
