backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-22 04:42:10 +08:00
Code Issues Projects Releases Wiki Activity
Files
e7edde96abf000def3eb0618a4f9687e9037cc80
C-Plus-Plus/da/dac/n__queens__all__solution__optimised_8cpp.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

404 lines
26 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.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="../../resize.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">&#160;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.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('da/dac/n__queens__all__solution__optimised_8cpp.html','../../'); initResizable(true); });
/* @license-end */
</script>
<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="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">n_queens_all_solution_optimised.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for n_queens_all_solution_optimised.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg" width="192" 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="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</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">&#160;</td><td class="mdescRight">for vector container <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</a></td></tr>
<tr class="memdesc:d8/d14/namespacen__queens__optimized"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a04090463be4942a69ea91fe7386da905" id="r_a04090463be4942a69ea91fe7386da905"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a04090463be4942a69ea91fe7386da905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
<tr class="separator:a04090463be4942a69ea91fe7386da905"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9e48455584a4faa33e83dd1891efd9b9" id="r_a9e48455584a4faa33e83dd1891efd9b9"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a9e48455584a4faa33e83dd1891efd9b9"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</td></tr>
<tr class="separator:a9e48455584a4faa33e83dd1891efd9b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a23c0547e4fd1708e6fb643b08327a60f" id="r_a23c0547e4fd1708e6fb643b08327a60f"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
<tr class="memitem:a23c0547e4fd1708e6fb643b08327a60f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a> (std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</td></tr>
<tr class="separator:a23c0547e4fd1708e6fb643b08327a60f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/deadshotsb" target="_blank">Sombit Bose</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="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a9e48455584a4faa33e83dd1891efd9b9" name="a9e48455584a4faa33e83dd1891efd9b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9e48455584a4faa33e83dd1891efd9b9">&#9670;&#160;</a></span>CanIMove()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;size_t n&gt; </div>
<table class="memname">
<tr>
<td class="memname">bool backtracking::n_queens_optimized::CanIMove </td>
<td>(</td>
<td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>row</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>col</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Check if a queen can be placed on matrix </p><dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">board</td><td>matrix where numbers are saved </td></tr>
<tr><td class="paramname">row</td><td>current index in rows </td></tr>
<tr><td class="paramname">col</td><td>current index in columns </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if queen can be placed on matrix </dd>
<dd>
<code>false</code> if queen can't be placed on matrix </dd></dl>
<p>check in the row</p>
<p>check the first diagonal</p>
<p>check the second diagonal</p>
<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= col; i++) {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> }</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 71</span> }</div>
<div class="line"><span class="lineno"> 72</span> }</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 80</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</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="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 109</span> {</div>
<div class="line"><span class="lineno"> 110</span> <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
<div class="line"><span class="lineno"> 111</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; board{};</div>
<div class="line"><span class="lineno"> 112</span> </div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (n % 2 == 0) {</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2 - 1; i++) {</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a>(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 116</span> board[i][0] = 1;</div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
<div class="line"><span class="lineno"> 118</span> board[i][0] = 0;</div>
<div class="line"><span class="lineno"> 119</span> }</div>
<div class="line"><span class="lineno"> 120</span> }</div>
<div class="line"><span class="lineno"> 121</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2; i++) {</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a>(board, i, 0)) {</div>
<div class="line"><span class="lineno"> 124</span> board[i][0] = 1;</div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_function" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a>(board, 1);</div>
<div class="line"><span class="lineno"> 126</span> board[i][0] = 0;</div>
<div class="line"><span class="lineno"> 127</span> }</div>
<div class="line"><span class="lineno"> 128</span> }</div>
<div class="line"><span class="lineno"> 129</span> }</div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 131</span>}</div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">n_queens_all_solution_optimised.cpp:89</a></div></div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00059">n_queens_all_solution_optimised.cpp:59</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a23c0547e4fd1708e6fb643b08327a60f" name="a23c0547e4fd1708e6fb643b08327a60f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a23c0547e4fd1708e6fb643b08327a60f">&#9670;&#160;</a></span>NQueenSol()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;size_t n&gt; </div>
<table class="memname">
<tr>
<td class="memname">void backtracking::n_queens_optimized::NQueenSol </td>
<td>(</td>
<td class="paramtype">std::array&lt; std::array&lt; int, n &gt;, n &gt;</td> <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>col</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Solve n queens problem </p><dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">board</td><td>matrix where numbers are saved </td></tr>
<tr><td class="paramname">col</td><td>current index in columns </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 89</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (col &gt;= n) {</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_function" href="#a04090463be4942a69ea91fe7386da905">PrintSol&lt;n&gt;</a>(board);</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 93</span> }</div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">if</span> (CanIMove&lt;n&gt;(board, i, col)) {</div>
<div class="line"><span class="lineno"> 96</span> board[i][col] = 1;</div>
<div class="line"><span class="lineno"> 97</span> NQueenSol&lt;n&gt;(board, col + 1);</div>
<div class="line"><span class="lineno"> 98</span> board[i][col] = 0;</div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span>}</div>
<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00030">n_queens_all_solution_optimised.cpp:30</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a04090463be4942a69ea91fe7386da905" name="a04090463be4942a69ea91fe7386da905"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a04090463be4942a69ea91fe7386da905">&#9670;&#160;</a></span>PrintSol()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;size_t n&gt; </div>
<table class="memname">
<tr>
<td class="memname">void backtracking::n_queens_optimized::PrintSol </td>
<td>(</td>
<td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Utility function to print matrix </p><dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">n</td><td>number of matrix size </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">board</td><td>matrix where numbers are saved </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 30</span> {</div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
<div class="line"><span class="lineno"> 33</span> std::cout &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 34</span> }</div>
<div class="line"><span class="lineno"> 35</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 36</span> }</div>
<div class="line"><span class="lineno"> 37</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (n % 2 == 0 || (n % 2 == 1 &amp;&amp; board[n / 2 + 1][0] != 1)) {</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
<div class="line"><span class="lineno"> 41</span> std::cout &lt;&lt; board[j][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 42</span> }</div>
<div class="line"><span class="lineno"> 43</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 44</span> }</div>
<div class="line"><span class="lineno"> 45</span> std::cout &lt;&lt; std::endl;</div>
<div class="line"><span class="lineno"> 46</span> }</div>
<div class="line"><span class="lineno"> 47</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html">n_queens_all_solution_optimised.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.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink