GitHub - rickbacci/sudoku_solver: solve sudoku puzles

This is a program that attempts to solve sudoku puzzles using the same logic that I use when I solve them on paper.

I start with a matrix, in which the inital numbers are integers, the rest of the puzzle consists of and array of the numbers 1-9.

Summary of the logic I used:

Clear the numbers that cannot exist in those locations. This is done by searching through rows, columns and boxes.
Set any numbers that have an array size of 1.
Set any number of which there is only 1 remaining(regardless of array size)
Search for pairs in rows, columns and boxes. If they are found those numbers can be safely
cleared.
Search for trips (i.e [3,4], [3,5], and [3,4,5]) that exist in any row, column or box. If they are found then these numbers can be safely cleared.
Search for numbers that can only exist in a 1/3 section of a row or column. If they are found then those numbers can be safely cleared from the box that they exist in.

ruby solve_sudoku.rb

Name		Name	Last commit message	Last commit date
Latest commit History 65 Commits
spec		spec
.gitignore		.gitignore
.rspec		.rspec
.rubocop.yml		.rubocop.yml
Gemfile		Gemfile
Gemfile.lock		Gemfile.lock
Guardfile		Guardfile
README.md		README.md
Rakefile		Rakefile
common.rb		common.rb
foo.rb		foo.rb
generate_matrix.rb		generate_matrix.rb
hidden_candidates.rb		hidden_candidates.rb
naked_pairs.rb		naked_pairs.rb
naked_quad_test.rb		naked_quad_test.rb
naked_quads.rb		naked_quads.rb
naked_singles.rb		naked_singles.rb
naked_trips.rb		naked_trips.rb
print_puzzle.rb		print_puzzle.rb
ranges.rb		ranges.rb
solve_sudoku.rb		solve_sudoku.rb
test.rb		test.rb
total_numbers_remaining.rb		total_numbers_remaining.rb
trips.rb		trips.rb
validation.rb		validation.rb

Provide feedback