Code Pumpkin

Tag Archives: Backtracking

N Queen Problem Using Recursive Backtracking

April 1, 2017
Posted by Abhi Andhariya

N Queen Problem is the problem of placing N chess queens on an NxN chessboard so that no two queens attack each other, for which solutions exist for all natural numbers n except n=2 and n=3. A solution requires that no two queens share the same row, column, or diagonal. It is more general form of inital Eight queens problem, where we need to […]

Sudoku Solver using Recursive Backtracking

March 31, 2017
Posted by Abhi Andhariya

Sudoku  is a logic-based combinatorial number-placement puzzle. Given a partially filled 9×9 2D array grid[9][9], the goal is to assign digits (from 1 to 9) to the empty cells so that every row, column, and subgrid of size 3×3 contains exactly one instance of the digits from 1 to 9. For Detailed understanding about Sudoku, […]

Total Posts : 124
follow us in feedly
Contribute Your Articles

Cauvery Calling

Cauvery Calling

We may not get time to plant a tree, but we can definitely donate ₹42 per Tree.

Join us to save the planet Earth by donating at CodePumpkin Cauvery Calling Campaign.

Like Us On Facebook