Sudoku Solver (Using Brute Force Algorithm) in LabVIEW

[ashwani18in]

1. Overview:
The objective is to fill a 9×9 grid so that each column, each row, and each of the nine 3×3 boxes (also called blocks or regions) contains the digits from 1 to 9 only one time each. The puzzle setter provides a partially completed grid.

2. Description:

 A brute force program would solve a puzzle by placing the digit "1" in the first cell and checking if it is allowed to be there. If there are no violations (checking row, column, and box constraints) then the algorithm advances to the next cell, and places a "1" in that cell. When checking for violations, it is discovered that the "1" is not allowed, so the value is advanced to a "2". If a cell is discovered where none of the 9 digits is allowed, then the algorithm leaves that cell blank and moves back to the previous cell. The value in that cell is then incremented by one. The algorithm is repeated until the allowed value in the 81st cell is discovered. The construction of 81 numbers is parsed to form the 9 x 9 solution matrix.

3. Requirements

• LabVIEW 2012 (or compatible)

4. Steps to Implement or Execute Code

1. Open Main (Brute Force).vi within Sudoku Solver (Brute Force) LabVIEW 2012 NI Verified.llb library
2. Enter your puzzle in Problem
3. Run the VI
4. The program will resolve the sudoku

5. Additional Information or References

 VI Front Panel

**This document has been updated to meet the current required format for the NI Code Exchange.**

[francois-normandin]

Works great. However, I'm disappointed we can't see the diagrams. I've come up with a sudoku solver a few years ago and would have loved to compare algorithms, and programmation styles.

[fboteroh]

Congratulations! great job! but I'm also disappointed. It's a pitty

[moderator1983]

Password is L@bV!EW

[elkag]

Thank you for the password.