mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 05:12:40 +08:00
463 lines
31 KiB
HTML
463 lines
31 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||
<head>
|
||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||
<meta name="generator" content="Doxygen 1.14.0"/>
|
||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||
<title>TheAlgorithms/C++: backtracking/sudoku_solver.cpp File Reference</title>
|
||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="../../jquery.js"></script>
|
||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||
<script type="text/javascript">
|
||
DoxygenAwesomeDarkModeToggle.init()
|
||
</script>
|
||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||
<script type="text/javascript" src="../../navtree.js"></script>
|
||
<script type="text/javascript" src="../../cookie.js"></script>
|
||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||
<script type="text/javascript" src="../../search/search.js"></script>
|
||
<script type="text/javascript">
|
||
window.MathJax = {
|
||
options: {
|
||
ignoreHtmlClass: 'tex2jax_ignore',
|
||
processHtmlClass: 'tex2jax_process'
|
||
},
|
||
loader: {
|
||
load: ['[tex]/ams']
|
||
},
|
||
tex: {
|
||
macros: {},
|
||
packages: ['base','configmacros','ams']
|
||
}
|
||
};
|
||
</script>
|
||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||
</head>
|
||
<body>
|
||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||
<div id="titlearea">
|
||
<table cellspacing="0" cellpadding="0">
|
||
<tbody>
|
||
<tr id="projectrow">
|
||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||
<td id="projectalign">
|
||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||
</div>
|
||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||
</td>
|
||
</tr>
|
||
</tbody>
|
||
</table>
|
||
</div>
|
||
<!-- end header part -->
|
||
<!-- Generated by Doxygen 1.14.0 -->
|
||
<script type="text/javascript">
|
||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||
</script>
|
||
<script type="text/javascript">
|
||
$(function() { codefold.init(); });
|
||
</script>
|
||
<script type="text/javascript" src="../../menudata.js"></script>
|
||
<script type="text/javascript" src="../../menu.js"></script>
|
||
<script type="text/javascript">
|
||
$(function() {
|
||
initMenu('../../',true,false,'search.php','Search',true);
|
||
$(function() { init_search(); });
|
||
});
|
||
</script>
|
||
<div id="main-nav"></div>
|
||
</div><!-- top -->
|
||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||
<div id="nav-tree">
|
||
<div id="nav-tree-contents">
|
||
<div id="nav-sync" class="sync"></div>
|
||
</div>
|
||
</div>
|
||
<div id="splitbar" style="-moz-user-select:none;"
|
||
class="ui-resizable-handle">
|
||
</div>
|
||
</div>
|
||
<script type="text/javascript">
|
||
$(function(){initNavTree('d3/d05/sudoku__solver_8cpp.html','../../',''); });
|
||
</script>
|
||
<div id="container">
|
||
<div id="doc-content">
|
||
<!-- window showing the filter options -->
|
||
<div id="MSearchSelectWindow"
|
||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||
</div>
|
||
|
||
<!-- iframe showing the search results (closed by default) -->
|
||
<div id="MSearchResultsWindow">
|
||
<div id="MSearchResults">
|
||
<div class="SRPage">
|
||
<div id="SRIndex">
|
||
<div id="SRResults"></div>
|
||
<div class="SRStatus" id="Loading">Loading...</div>
|
||
<div class="SRStatus" id="Searching">Searching...</div>
|
||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
</div>
|
||
|
||
<div class="header">
|
||
<div class="headertitle"><div class="title">sudoku_solver.cpp File Reference</div></div>
|
||
</div><!--header-->
|
||
<div class="contents">
|
||
|
||
<p><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm.
|
||
<a href="#details">More...</a></p>
|
||
<div class="textblock"><code>#include <array></code><br />
|
||
<code>#include <iostream></code><br />
|
||
</div><div class="textblock"><div class="dynheader">
|
||
Include dependency graph for sudoku_solver.cpp:</div>
|
||
<div class="dyncontent">
|
||
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../da/dfd/sudoku__solver_8cpp__incl.svg" width="160" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||
</div>
|
||
</div>
|
||
<p><a href="../../d3/d05/sudoku__solver_8cpp_source.html">Go to the source code of this file.</a></p>
|
||
<table class="memberdecls">
|
||
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||
Namespaces</h2></td></tr>
|
||
<tr class="memitem:backtracking" id="r_backtracking"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
|
||
<tr class="memdesc:db/dc0/namespacebacktracking"><td class="mdescLeft"> </td><td class="mdescRight">for vector container <br /></td></tr>
|
||
<tr class="memitem:sudoku_5Fsolver" id="r_sudoku_5Fsolver"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</a></td></tr>
|
||
<tr class="memdesc:d8/d9f/namespacesudoku__solver"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation. <br /></td></tr>
|
||
</table><table class="memberdecls">
|
||
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
||
Functions</h2></td></tr>
|
||
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0" id="r_a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||
<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0 template"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)</td></tr>
|
||
<tr class="memdesc:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="mdescLeft"> </td><td class="mdescRight">Check if it's possible to place a number (<span class="tt">no</span> parameter) <br /></td></tr>
|
||
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac" id="r_ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||
<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac template"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)</td></tr>
|
||
<tr class="memdesc:ab040a12d7684cd85fb3684f4211ea5ac"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to print the matrix. <br /></td></tr>
|
||
<tr class="memitem:ac911c8bca8556206ff64461b2424866b" id="r_ac911c8bca8556206ff64461b2424866b"><td class="memTemplParams" colspan="2">template<size_t V> </td></tr>
|
||
<tr class="memitem:ac911c8bca8556206ff64461b2424866b template"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)</td></tr>
|
||
<tr class="memdesc:ac911c8bca8556206ff64461b2424866b"><td class="mdescLeft"> </td><td class="mdescRight">Main function to implement the Sudoku algorithm. <br /></td></tr>
|
||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
||
</table>
|
||
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
||
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm. </p>
|
||
<p>Sudoku (数独, sūdoku, digit-single) (/suːˈdoʊkuː/, /-ˈdɒk-/, /sə-/, originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic sudoku, the objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution.</p>
|
||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DarthCoder3200" target="_blank">DarthCoder3200</a> </dd>
|
||
<dd>
|
||
<a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
|
||
|
||
<p class="definition">Definition in file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
|
||
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
||
<a id="a07dc6acffd0500de9bdbf16b3ade94b0" name="a07dc6acffd0500de9bdbf16b3ade94b0"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">◆ </a></span>isPossible()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<div class="memtemplate">
|
||
template<size_t V> </div>
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">bool backtracking::sudoku_solver::isPossible </td>
|
||
<td>(</td>
|
||
<td class="paramtype">const std::array< std::array< int, V >, V > &</td> <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>j</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>no</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span> )</td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Check if it's possible to place a number (<span class="tt">no</span> parameter) </p>
|
||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||
<table class="tparams">
|
||
<tr><td class="paramname">V</td><td>number of vertices in the array </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="params"><dt>Parameters</dt><dd>
|
||
<table class="params">
|
||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||
<tr><td class="paramname">no</td><td>number to be added in matrix </td></tr>
|
||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if 'mat' is different from 'no' </dd>
|
||
<dd>
|
||
<span class="tt">false</span> if 'mat' equals to 'no' </dd></dl>
|
||
<p><span class="tt">no</span> shouldn't be present in either row i or column j</p>
|
||
<p><span class="tt">no</span> shouldn't be present in the 3*3 subgrid</p>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
|
||
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < n; x++) {</div>
|
||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
|
||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><span class="lineno"> 50</span> }</div>
|
||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||
<div class="line"><span class="lineno"> 52</span></div>
|
||
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
|
||
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
|
||
<div class="line"><span class="lineno"> 56</span> </div>
|
||
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = sx; x < sx + 3; x++) {</div>
|
||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = sy; y < sy + 3; y++) {</div>
|
||
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">if</span> (mat[x][y] == no) {</div>
|
||
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><span class="lineno"> 61</span> }</div>
|
||
<div class="line"><span class="lineno"> 62</span> }</div>
|
||
<div class="line"><span class="lineno"> 63</span> }</div>
|
||
<div class="line"><span class="lineno"> 64</span> </div>
|
||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||
<div class="line"><span class="lineno"> 66</span>}</div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</div>
|
||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">int main </td>
|
||
<td>(</td>
|
||
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||
<td></td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Main function. </p>
|
||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00154">154</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 154</span> {</div>
|
||
<div class="line"><span class="lineno"> 155</span> <span class="keyword">const</span> <span class="keywordtype">int</span> V = 9;</div>
|
||
<div class="line"><span class="lineno"> 156</span> std::array<std::array<int, V>, V> mat = {</div>
|
||
<div class="line"><span class="lineno"> 157</span> std::array<int, V>{5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
|
||
<div class="line"><span class="lineno"> 158</span> std::array<int, V>{6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
|
||
<div class="line"><span class="lineno"> 159</span> std::array<int, V>{0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
|
||
<div class="line"><span class="lineno"> 160</span> std::array<int, V>{8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
|
||
<div class="line"><span class="lineno"> 161</span> std::array<int, V>{4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
|
||
<div class="line"><span class="lineno"> 162</span> std::array<int, V>{7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
|
||
<div class="line"><span class="lineno"> 163</span> std::array<int, V>{0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
|
||
<div class="line"><span class="lineno"> 164</span> std::array<int, V>{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
|
||
<div class="line"><span class="lineno"> 165</span> std::array<int, V>{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
|
||
<div class="line"><span class="lineno"> 166</span> </div>
|
||
<div class="line"><span class="lineno"> 167</span> <a class="code hl_function" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat<V></a>(mat, mat, 9);</div>
|
||
<div class="line"><span class="lineno"> 168</span> std::cout << <span class="stringliteral">"Solution "</span> << std::endl;</div>
|
||
<div class="line"><span class="lineno"> 169</span> std::array<std::array<int, V>, V> starting_mat = mat;</div>
|
||
<div class="line"><span class="lineno"> 170</span> <a class="code hl_function" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku<V></a>(mat, starting_mat, 0, 0);</div>
|
||
<div class="line"><span class="lineno"> 171</span> </div>
|
||
<div class="line"><span class="lineno"> 172</span> <span class="keywordflow">return</span> 0;</div>
|
||
<div class="line"><span class="lineno"> 173</span>}</div>
|
||
<div class="ttc" id="asudoku__solver_8cpp_html_ab040a12d7684cd85fb3684f4211ea5ac"><div class="ttname"><a href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a></div><div class="ttdeci">void printMat(const std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int n)</div><div class="ttdoc">Utility function to print the matrix.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00077">sudoku_solver.cpp:77</a></div></div>
|
||
<div class="ttc" id="asudoku__solver_8cpp_html_ac911c8bca8556206ff64461b2424866b"><div class="ttname"><a href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a></div><div class="ttdeci">bool solveSudoku(std::array< std::array< int, V >, V > &mat, const std::array< std::array< int, V >, V > &starting_mat, int i, int j)</div><div class="ttdoc">Main function to implement the Sudoku algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00110">sudoku_solver.cpp:110</a></div></div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</div>
|
||
<a id="ab040a12d7684cd85fb3684f4211ea5ac" name="ab040a12d7684cd85fb3684f4211ea5ac"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#ab040a12d7684cd85fb3684f4211ea5ac">◆ </a></span>printMat()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<div class="memtemplate">
|
||
template<size_t V> </div>
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">void backtracking::sudoku_solver::printMat </td>
|
||
<td>(</td>
|
||
<td class="paramtype">const std::array< std::array< int, V >, V > &</td> <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">const std::array< std::array< int, V >, V > &</td> <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span> )</td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Utility function to print the matrix. </p>
|
||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||
<table class="tparams">
|
||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="params"><dt>Parameters</dt><dd>
|
||
<table class="params">
|
||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||
<tr><td class="paramname">n</td><td>number of times loop will run </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 78</span> {</div>
|
||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < n; i++) {</div>
|
||
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < n; j++) {</div>
|
||
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (starting_mat[i][j] != mat[i][j]) {</div>
|
||
<div class="line"><span class="lineno"> 82</span> std::cout << <span class="stringliteral">"\033[93m"</span> << mat[i][j] << <span class="stringliteral">"\033[0m"</span></div>
|
||
<div class="line"><span class="lineno"> 83</span> << <span class="stringliteral">" "</span>;</div>
|
||
<div class="line"><span class="lineno"> 84</span> } <span class="keywordflow">else</span> {</div>
|
||
<div class="line"><span class="lineno"> 85</span> std::cout << mat[i][j] << <span class="stringliteral">" "</span>;</div>
|
||
<div class="line"><span class="lineno"> 86</span> }</div>
|
||
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">if</span> ((j + 1) % 3 == 0) {</div>
|
||
<div class="line"><span class="lineno"> 88</span> std::cout << <span class="charliteral">'\t'</span>;</div>
|
||
<div class="line"><span class="lineno"> 89</span> }</div>
|
||
<div class="line"><span class="lineno"> 90</span> }</div>
|
||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> ((i + 1) % 3 == 0) {</div>
|
||
<div class="line"><span class="lineno"> 92</span> std::cout << std::endl;</div>
|
||
<div class="line"><span class="lineno"> 93</span> }</div>
|
||
<div class="line"><span class="lineno"> 94</span> std::cout << std::endl;</div>
|
||
<div class="line"><span class="lineno"> 95</span> }</div>
|
||
<div class="line"><span class="lineno"> 96</span>}</div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</div>
|
||
<a id="ac911c8bca8556206ff64461b2424866b" name="ac911c8bca8556206ff64461b2424866b"></a>
|
||
<h2 class="memtitle"><span class="permalink"><a href="#ac911c8bca8556206ff64461b2424866b">◆ </a></span>solveSudoku()</h2>
|
||
|
||
<div class="memitem">
|
||
<div class="memproto">
|
||
<div class="memtemplate">
|
||
template<size_t V> </div>
|
||
<table class="memname">
|
||
<tr>
|
||
<td class="memname">bool backtracking::sudoku_solver::solveSudoku </td>
|
||
<td>(</td>
|
||
<td class="paramtype">std::array< std::array< int, V >, V > &</td> <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">const std::array< std::array< int, V >, V > &</td> <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
|
||
</tr>
|
||
<tr>
|
||
<td class="paramkey"></td>
|
||
<td></td>
|
||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>j</em></span> )</td>
|
||
</tr>
|
||
</table>
|
||
</div><div class="memdoc">
|
||
|
||
<p>Main function to implement the Sudoku algorithm. </p>
|
||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||
<table class="tparams">
|
||
<tr><td class="paramname">V</td><td>number of vertices in array </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="params"><dt>Parameters</dt><dd>
|
||
<table class="params">
|
||
<tr><td class="paramname">mat</td><td>matrix where numbers are saved </td></tr>
|
||
<tr><td class="paramname">starting_mat</td><td>copy of mat, required by printMat for highlighting the differences </td></tr>
|
||
<tr><td class="paramname">i</td><td>current index in rows </td></tr>
|
||
<tr><td class="paramname">j</td><td>current index in columns </td></tr>
|
||
</table>
|
||
</dd>
|
||
</dl>
|
||
<dl class="section return"><dt>Returns</dt><dd><span class="tt">true</span> if 'no' was placed </dd>
|
||
<dd>
|
||
<span class="tt">false</span> if 'no' was not placed </dd></dl>
|
||
<p>Base Case</p>
|
||
<p>Solved for 9 rows already</p>
|
||
<p>Crossed the last Cell in the row</p>
|
||
<p>Blue Cell - Skip</p>
|
||
<p>White Cell Try to place every possible no</p>
|
||
<p>Place the 'no' - assuming a solution will exist</p>
|
||
<p>Couldn't find a solution loop will place the next <span class="tt">no</span>.</p>
|
||
<p><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
|
||
|
||
<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
|
||
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
|
||
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">if</span> (i == 9) {</div>
|
||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="#ab040a12d7684cd85fb3684f4211ea5ac">printMat<V></a>(mat, starting_mat, 9);</div>
|
||
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||
<div class="line"><span class="lineno"> 119</span></div>
|
||
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">if</span> (j == 9) {</div>
|
||
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i + 1, 0);</div>
|
||
<div class="line"><span class="lineno"> 123</span> }</div>
|
||
<div class="line"><span class="lineno"> 124</span></div>
|
||
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
|
||
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">return</span> solveSudoku<V>(mat, starting_mat, i, j + 1);</div>
|
||
<div class="line"><span class="lineno"> 128</span> }</div>
|
||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no <= 9; no++) {</div>
|
||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a07dc6acffd0500de9bdbf16b3ade94b0">isPossible<V></a>(mat, i, j, no, 9)) {</div>
|
||
<div class="line"><span class="lineno"> 134</span> mat[i][j] = no;</div>
|
||
<div class="line"><span class="lineno"> 135</span> <span class="keywordtype">bool</span> solution_found = <a class="code hl_function" href="#ac911c8bca8556206ff64461b2424866b">solveSudoku<V></a>(mat, starting_mat, i, j + 1);</div>
|
||
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (solution_found) {</div>
|
||
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||
<div class="line"><span class="lineno"> 138</span> }</div>
|
||
<div class="line"><span class="lineno"> 141</span> }</div>
|
||
<div class="line"><span class="lineno"> 142</span> }</div>
|
||
<div class="line"><span class="lineno"> 144</span> mat[i][j] = 0;</div>
|
||
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||
<div class="line"><span class="lineno"> 146</span>}</div>
|
||
<div class="ttc" id="asudoku__solver_8cpp_html_a07dc6acffd0500de9bdbf16b3ade94b0"><div class="ttname"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a></div><div class="ttdeci">bool isPossible(const std::array< std::array< int, V >, V > &mat, int i, int j, int no, int n)</div><div class="ttdoc">Check if it's possible to place a number (no parameter)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d05/sudoku__solver_8cpp_source.html#l00044">sudoku_solver.cpp:44</a></div></div>
|
||
</div><!-- fragment -->
|
||
</div>
|
||
</div>
|
||
</div><!-- contents -->
|
||
</div><!-- doc-content -->
|
||
<div id="page-nav" class="page-nav-panel">
|
||
<div id="page-nav-resize-handle"></div>
|
||
<div id="page-nav-tree">
|
||
<div id="page-nav-contents">
|
||
</div><!-- page-nav-contents -->
|
||
</div><!-- page-nav-tree -->
|
||
</div><!-- page-nav -->
|
||
</div><!-- container -->
|
||
<!-- start footer part -->
|
||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||
<ul>
|
||
<li class="navelem"><a href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a href="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
|
||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
||
</ul>
|
||
</div>
|
||
</body>
|
||
</html>
|