solving puzzle automatically

Author: hsencan03

include/PlayState.hpp

@@ -5,6 +5,7 @@
 
 #include <SFML/Graphics/Sprite.hpp>
 #include <SFML/Graphics/Texture.hpp>
+#include <set>
 
 class PlayState : public State {
 public:
@@ -21,6 +22,8 @@ class PlayState : public State {
 
 	void setColorOfMistakes(int row, int col, sf::Color color);
 
+	void solve();
+
 private:
 	SudokuSolver solver;
 
@@ -34,4 +37,8 @@ class PlayState : public State {
 	sf::Sprite m_resetSprite;
 
 	bool m_loadedFromFile;
+
+	std::set<std::pair<int, int>> m_mistakes;
+
+	bool m_done;
 };

include/SudokuSolver.hpp

@@ -1,5 +1,4 @@
 #pragma once
-
 #include <utility>
 
 enum
@@ -14,11 +13,13 @@ class SudokuSolver {
 	SudokuSolver();
 
 	bool Solve();
-	
+
 	void set(int row, int column, int num);
 
 	int get(int row, int column) const;
 
+	int* getSolvedCell();
+
 	void print();
 
 private:

src/PlayState.cpp

@@ -10,7 +10,7 @@
 #include <unordered_map>
 
 PlayState::PlayState(StateMachine& machine, sf::RenderWindow& window, bool replace)
-	: State(machine, window, replace), m_loadedFromFile{ false }
+	: State(machine, window, replace), m_loadedFromFile{ false }, m_done{false}
 {
 	if (!m_mainbgText.loadFromFile("assets/mainbg.png"))
 	{
@@ -79,7 +79,10 @@ PlayState::PlayState(StateMachine& machine, sf::RenderWindow& window, bool repla
 			cell.text.setFillColor(sf::Color::Black);
 
 			if (m_loadedFromFile)
+			{
+				solver.set(x, y, cell.num);
 				setColorOfMistakes(x, y, sf::Color::Red);
+			}
 		}
 	}
 }
@@ -106,6 +109,9 @@ void PlayState::update()
 			case sf::Keyboard::Escape:
 				m_next = StateMachine::build<MenuState>(m_machine, m_window, false);
 				break;
+			case sf::Keyboard::S:
+				solve();
+				break;
 			default:
 				break;
 			}
@@ -120,7 +126,8 @@ void PlayState::update()
 				m_next = StateMachine::build<MenuState>(m_machine, m_window, false);
 			else if (m_resetSprite.getGlobalBounds().contains(worldPos))
 				reset();
-
+			if (m_done)
+				return;
 			for (int x = 0; x < ROW; x++)
 			{
 				for (int y = 0; y < COL; y++)
@@ -146,6 +153,8 @@ void PlayState::update()
 							std::cout << "\ntrue";
 							for (int i = 0; i < ROW * COL; i++)
 								m_machine.m_cells.get()[i].text.setFillColor(sf::Color::Black);
+
+							m_mistakes.clear();
 						}
 						else
 						{
@@ -189,6 +198,7 @@ void PlayState::reset()
 
 	solver = SudokuSolver();
 	solver.print();
+	m_done = false;
 }
 
 
@@ -219,8 +229,35 @@ void PlayState::setColorOfMistakes(int row, int column, sf::Color color)
 	for (auto i = nums.begin(); i != nums.end(); i++)
 	{
 		if (i->first != 0 && nums.count(i->first) > 1)
+		{
 			m_machine.m_cells.get()[i->second.second * ROW + i->second.first].text.setFillColor(color);
+			m_mistakes.insert(std::make_pair(i->second.first, i->second.second));
+		}
 		else
+		{
+			m_mistakes.erase(std::make_pair(i->second.first, i->second.second));
 			m_machine.m_cells.get()[i->second.second * ROW + i->second.first].text.setFillColor(sf::Color::Black);
+		}
+	}
+}
+
+void PlayState::solve()
+{
+	for(auto& i : m_mistakes)
+	{
+		m_machine.m_cells.get()[i.second * ROW + i.first].num = 0;
+		solver.set(i.first, i.second, 0);
 	}
-}
+	solver.Solve();
+
+	int* cell = solver.getSolvedCell();
+
+	for (int i = 0; i < ROW * COL; i++)
+	{
+		m_machine.m_cells.get()[i].num = cell[i];
+		m_machine.m_cells.get()[i].text.setString(std::to_string(cell[i]));
+		m_machine.m_cells.get()[i].text.setFillColor(sf::Color::Black);
+	}
+
+	m_done = true;
+}

src/SudokuSolver.cpp

@@ -6,7 +6,10 @@
 SudokuSolver::SudokuSolver()
 {
 	for (int i = 0; i < ROW * COL; i++)
+	{
 		grid[i] = UNASSIGNED;
+		m_temp[i] = UNASSIGNED;
+	}
 
 	std::srand(std::time(nullptr));
 }
@@ -30,6 +33,11 @@ int SudokuSolver::get(int row, int column) const
 	return grid[column * ROW + row];
 }
 
+int* SudokuSolver::getSolvedCell()
+{
+	return m_temp;
+}
+
 void SudokuSolver::print()
 {
 	system("cls");
@@ -62,11 +70,13 @@ bool SudokuSolver::solve()
 	if (cell.first == -1)
 		return true;
 
-	for (int i = 1; i <= 9; i++)
+	for (int i = 0; i < 9; i++)
 	{
-		if (isSafe(cell.first, cell.second, i))
+		int num = std::rand() % 9 + 1;
+
+		if (isSafe(cell.first, cell.second, num))
 		{
-			m_temp[cell.second * ROW + cell.first] = i;
+			m_temp[cell.second * ROW + cell.first] = num;
 
 			if (solve())
 				return true;
@@ -77,6 +87,7 @@ bool SudokuSolver::solve()
 	return false;
 }
 
+
 bool SudokuSolver::isSafe(int row, int column, int num)
 {
 	//Check ROW
@@ -104,7 +115,7 @@ bool SudokuSolver::isSafe(int row, int column, int num)
 	return true;
 }
 
-std::pair<int,int> SudokuSolver::FindUnassignedCell()
+std::pair<int, int> SudokuSolver::FindUnassignedCell()
 {
 	for (int x = 0; x < ROW; x++)
 	{