mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
726 lines
123 KiB
HTML
726 lines
123 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++: machine_learning/a_star_search.cpp Source File</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('dd/dec/a__star__search_8cpp_source.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">a_star_search.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <algorithm></span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <array></span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <cassert></span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <cstdint></span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <functional></span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include <map></span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include <memory></span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include <set></span> </div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include <vector></span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/ddc/namespaceaystar__search.html">aystar_search</a> {</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="keyword">template</span> <<span class="keywordtype">size_t</span> N = 3></div>
|
|
<div class="foldopen" id="foldopen00062" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html"> 62</a></span><span class="keyword">class </span><a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> {</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> std::array<std::array<uint32_t, N>, N></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> board; </div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="foldopen" id="foldopen00066" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71"> 66</a></span> std::vector<std::pair<int8_t, int8_t>> <a class="code hl_variable" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a> = {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> {0, 1},</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> {1, 0},</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> {0, -1},</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> {-1,</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> 0}}; </div>
|
|
</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span></div>
|
|
<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3"> 77</a></span> std::pair<uint32_t, uint32_t> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a>() {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (!board[i][j]) {</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">return</span> {i, j};</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> }</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">return</span> {-1, -1};</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e"> 92</a></span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(<span class="keyword">const</span> uint32_t value)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> value < N; }</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420"> 104</a></span> uint32_t <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(i) && <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(j)) {</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">return</span> board[i][j];</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99"> 113</a></span> std::array<std::array<uint32_t, N>, N> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">get_state</a>() { <span class="keywordflow">return</span> board; }</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f"> 119</a></span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> N; }</div>
|
|
<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b"> 123</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a>() {</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> board[i][j] = ((i * 3 + j + 1) % (N * N));</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span></div>
|
|
<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2"> 134</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</a>(<span class="keyword">const</span> std::array<std::array<uint32_t, N>, N> &init)</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> : board(init) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7"> 141</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">EightPuzzle</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &A) : board(A.board) {}</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span></div>
|
|
<div class="foldopen" id="foldopen00147" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9"> 147</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">EightPuzzle</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &&A) noexcept</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> : board(std::move(A.board)) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9"> 152</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">~EightPuzzle</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span></div>
|
|
<div class="foldopen" id="foldopen00158" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2"> 158</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> &<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">operator=</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> &A) {</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> board = A.board;</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span></div>
|
|
<div class="foldopen" id="foldopen00167" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101"> 167</a></span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> &<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">operator=</a>(<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> &&A) <span class="keyword">noexcept</span> {</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> board = std::move(A.board);</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span></div>
|
|
<div class="foldopen" id="foldopen00178" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658"> 178</a></span> std::vector<EightPuzzle<N>> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a>() {</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keyword">auto</span> zero_pos = <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a>();</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// vector which will contain all possible state from current state</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> std::vector<EightPuzzle<N>> NewStates;</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> &move : <a class="code hl_variable" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a>) {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.first + move.first) &&</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.second + move.second)) {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// swap with the possible moves</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> std::array<std::array<uint32_t, N>, N> new_config = board;</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> std::swap(new_config[zero_pos.first][zero_pos.second],</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> new_config[zero_pos.first + move.first]</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> [zero_pos.second + move.second]);</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> new_state(new_config);</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// Store new state and calculate heuristic value, and depth</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> NewStates.emplace_back(new_state);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> }</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">return</span> NewStates;</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span></div>
|
|
<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915"> 202</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">operator==</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &check)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">if</span> (check.get_size() != N) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> }</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span></div>
|
|
<div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba"> 220</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">operator<</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &check)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">return</span> board[i][j] < check.board[i][j];</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> }</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> }</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span></div>
|
|
<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee"> 235</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">operator<=</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &check)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="keywordflow">return</span> board[i][j] < check.board[i][j];</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> }</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> }</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span></div>
|
|
<div class="foldopen" id="foldopen00252" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742"> 252</a></span> <span class="keyword">friend</span> std::ostream &<a class="code hl_friend" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">operator<<</a>(std::ostream &op,</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">const</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle<N></a> &SomeState) {</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < N; ++i) {</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < N; ++j) {</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> op << SomeState.board[i][j] << <span class="stringliteral">" "</span>;</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> }</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> op << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> }</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">return</span> op;</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span><span class="keyword">template</span> <<span class="keyword">typename</span> Puzzle></div>
|
|
<div class="foldopen" id="foldopen00290" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html"> 290</a></span><span class="keyword">class </span><a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">AyStarSearch</a> {</div>
|
|
<div class="foldopen" id="foldopen00295" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html"> 295</a></span> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> {</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> std::shared_ptr<Puzzle> state; </div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3"> 297</a></span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = 0; </div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d"> 298</a></span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = 0; </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7"> 303</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8"> 309</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8">Info</a>(<span class="keyword">const</span> Puzzle &A) : state(std::make_shared<Puzzle>(A)) {}</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span></div>
|
|
<div class="foldopen" id="foldopen00317" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8"> 317</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8">Info</a>(<span class="keyword">const</span> Puzzle &A, <span class="keywordtype">size_t</span> h_value, <span class="keywordtype">size_t</span> d)</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> : state(std::make_shared<Puzzle>(A)),</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(h_value),</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(d) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span></div>
|
|
<div class="foldopen" id="foldopen00326" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5"> 326</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5">Info</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &A)</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> : state(std::make_shared<Puzzle>(A.state)),</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>),</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span></div>
|
|
<div class="foldopen" id="foldopen00335" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a"> 335</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a">Info</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &&A) noexcept</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> : state(std::make_shared<Puzzle>(std::move(A.state))),</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(std::move(A.heuristic_value)),</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(std::move(A.depth)) {}</div>
|
|
</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span></div>
|
|
<div class="foldopen" id="foldopen00344" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317"> 344</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &<a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">operator=</a>(<span class="keyword">const</span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &A) {</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> state = A.state;</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>;</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>;</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span></div>
|
|
<div class="foldopen" id="foldopen00355" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57"> 355</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &<a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57">operator=</a>(<a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a> &&A) <span class="keyword">noexcept</span> {</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> state = std::move(A.state);</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = std::move(A.heuristic_value);</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = std::move(A.depth);</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span></div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2"> 364</a></span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">~Info</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301"> 365</a></span> } <a class="code hl_typedef" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">Info</a>;</div>
|
|
</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> </div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> std::shared_ptr<Info> Initial; <span class="comment">// Initial state of the AyStarSearch</span></div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> std::shared_ptr<Info> Final; <span class="comment">// Final state of the AyStarSearch</span></div>
|
|
<div class="foldopen" id="foldopen00372" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"><a class="line" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html"> 372</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> {</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> std::shared_ptr<Info> &a,</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keyword">const</span> std::shared_ptr<Info> &b)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">return</span> *(a->state) < *(b->state);</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> }</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> };</div>
|
|
</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> </div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keyword">using </span>MapOfPuzzleInfoWithPuzzleInfo =</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> std::map<std::shared_ptr<Info>, std::shared_ptr<Info>,</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>>;</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keyword">using </span>MapOfPuzzleInfoWithInteger =</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> std::map<std::shared_ptr<Info>, uint32_t, <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>>;</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> </div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keyword">using </span>SetOfPuzzleInfo =</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> std::set<std::shared_ptr<Info>, <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>>;</div>
|
|
<div class="foldopen" id="foldopen00394" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e"> 394</a></span> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">AyStarSearch</a>(<span class="keyword">const</span> Puzzle &initial, <span class="keyword">const</span> Puzzle &<span class="keyword">final</span>) {</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> Initial = std::make_shared<Info>(initial);</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> Final = std::make_shared<Info>(<span class="keyword">final</span>);</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span></div>
|
|
<div class="foldopen" id="foldopen00407" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4"> 407</a></span> std::vector<Puzzle> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a>(</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> std::shared_ptr<Info> FinalState,</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keyword">const</span> MapOfPuzzleInfoWithPuzzleInfo &parent_of) {</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="comment">// Useful for traversing from final state to current state.</span></div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keyword">auto</span> current_state = FinalState;</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span><span class="comment"> * For storing the solution tree starting from initial state to</span></div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span><span class="comment"> * final state</span></div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span><span class="comment"> */</span></div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> std::vector<Puzzle> answer;</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> answer.emplace_back(*current_state->state);</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> current_state = parent_of.find(current_state)->second;</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> }</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="keywordflow">return</span> answer;</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span></div>
|
|
<div class="foldopen" id="foldopen00431" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201"> 431</a></span> std::vector<Puzzle> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">a_star_search</a>(</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keyword">const</span> std::function<uint32_t(<span class="keyword">const</span> Puzzle &, <span class="keyword">const</span> Puzzle &)> &dist,</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="keyword">const</span> uint32_t permissible_depth = 30) {</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> MapOfPuzzleInfoWithPuzzleInfo</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> parent_of; </div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> MapOfPuzzleInfoWithInteger g_score; </div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> SetOfPuzzleInfo open_list; </div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> SetOfPuzzleInfo closed_list; </div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> </div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> open_list.emplace(Initial);</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> g_score[Initial] = 0;</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> </div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keywordflow">while</span> (!open_list.empty()) {</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> <span class="comment">// Iterator for state having having lowest f_score.</span></div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keyword">typename</span> SetOfPuzzleInfo::iterator it_low_f_score;</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> uint32_t min_f_score = 1e9;</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = open_list.begin(); iter != open_list.end();</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> ++iter) {</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="comment">// f score here is evaluated by g score (depth) and h score</span></div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// (distance between current state and final state)</span></div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> uint32_t f_score = (*iter)->heuristic_value + (*iter)->depth;</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> <span class="keywordflow">if</span> (f_score < min_f_score) {</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> min_f_score = f_score;</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> it_low_f_score = iter;</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> }</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> </div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> std::shared_ptr<Info> current_state = *it_low_f_score;</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// if this current state is equal to final, return</span></div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="keywordflow">if</span> (*(current_state->state) == *(Final->state)) {</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a>(current_state, parent_of);</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> }</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="comment">// else remove from open list as visited.</span></div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> open_list.erase(it_low_f_score);</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="comment">// if current_state has exceeded the allowed depth, skip</span></div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="comment">// neighbor checking</span></div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <span class="keywordflow">if</span> (current_state->depth >= permissible_depth) {</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> }</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <span class="comment">// state</span></div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> std::vector<Puzzle> total_possible_moves =</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> current_state->state->generate_possible_moves();</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> </div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="keywordflow">for</span> (Puzzle &neighbor : total_possible_moves) {</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> <span class="comment">// calculate score of neighbors with respect to</span></div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="comment">// current_state</span></div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> std::shared_ptr<Info> Neighbor = std::make_shared<Info>(</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> neighbor, dist(neighbor, *(Final->state)),</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> current_state->depth + 1U);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> uint32_t temp_g_score = Neighbor->depth;</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> </div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// Check whether this state is explored.</span></div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="comment">// If this state is discovered at greater depth, then discard,</span></div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// else remove from closed list and explore the node</span></div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="keyword">auto</span> closed_list_iter = closed_list.find(Neighbor);</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">if</span> (closed_list_iter != closed_list.end()) {</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="comment">// 1. If state in closed list has higher depth, then remove</span></div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="comment">// from list since we have found better option,</span></div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="comment">// 2. Else don't explore this state.</span></div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keywordflow">if</span> (Neighbor->depth < (*closed_list_iter)->depth) {</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> closed_list.erase(closed_list_iter);</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> }</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> }</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="keyword">auto</span> neighbor_g_score_iter = g_score.find(Neighbor);</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="comment">// if the neighbor is already created and has minimum</span></div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> <span class="comment">// g_score, then update g_score and f_score else insert new</span></div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <span class="keywordflow">if</span> (neighbor_g_score_iter != g_score.end()) {</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="keywordflow">if</span> (neighbor_g_score_iter->second > temp_g_score) {</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> neighbor_g_score_iter->second = temp_g_score;</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> parent_of[Neighbor] = current_state;</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> }</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> g_score[Neighbor] = temp_g_score;</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> parent_of[Neighbor] = current_state;</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> }</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="comment">// If this is a new state, insert into open_list</span></div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="comment">// else update if the this state has better g score than</span></div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="comment">// existing one.</span></div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keyword">auto</span> iter = open_list.find(Neighbor);</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="keywordflow">if</span> (iter == open_list.end()) {</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> open_list.emplace(Neighbor);</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*iter)->depth > Neighbor->depth) {</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> (*iter)->depth = Neighbor->depth;</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> }</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> }</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> closed_list.emplace(current_state);</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> }</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// Cannot find the solution, return empty vector</span></div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="keywordflow">return</span> std::vector<Puzzle>(0);</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span>} <span class="comment">// namespace aystar_search</span></div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span>} <span class="comment">// namespace machine_learning</span></div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span></div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// Renaming for simplicity</span></div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <span class="keyword">using </span>matrix3 = std::array<std::array<uint32_t, 3>, 3>;</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keyword">using </span>row3 = std::array<uint32_t, 3>;</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keyword">using </span>matrix4 = std::array<std::array<uint32_t, 4>, 4>;</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keyword">using </span>row4 = std::array<uint32_t, 4>;</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="comment">// 1st test: A* search for simple EightPuzzle problem</span></div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> matrix3 puzzle;</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> puzzle[0] = row3({0, 2, 3});</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> puzzle[1] = row3({1, 5, 6});</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> puzzle[2] = row3({4, 7, 8});</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> </div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> matrix3 ideal;</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> ideal[0] = row3({1, 2, 3});</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> ideal[1] = row3({4, 5, 6});</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> ideal[2] = row3({7, 8, 0});</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> </div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="comment">/*</span></div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span><span class="comment"> * Heuristic function: Manhattan distance</span></div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span><span class="comment"> */</span></div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keyword">auto</span> manhattan_distance =</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> [](<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a> &first,</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a> &second) {</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> uint32_t ret = 0;</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++j) {</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> uint32_t <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">find</a> = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(i, j);</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <span class="keywordtype">size_t</span> m = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(), n = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>();</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> < second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> l = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> < second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordflow">if</span> (find == second.get(k, l)) {</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> std::tie(m, n) = std::make_pair(k, l);</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> }</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> }</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> }</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> ret += (std::max(m, i) - std::min(m, i)) +</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> (std::max(n, j) - std::min(n, j));</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> }</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> }</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> }</div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <span class="keywordflow">return</span> ret;</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> };</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> </div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a> Puzzle(puzzle);</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a> Ideal(ideal);</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a><</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<3></a>></div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(Puzzle, Ideal); </div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> </div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> std::vector<matrix3> answer; </div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> </div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> answer.push_back(</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> matrix3({row3({0, 2, 3}), row3({1, 5, 6}), row3({4, 7, 8})}));</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> answer.push_back(</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> matrix3({row3({1, 2, 3}), row3({0, 5, 6}), row3({4, 7, 8})}));</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> answer.push_back(</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({0, 7, 8})}));</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> answer.push_back(</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({7, 0, 8})}));</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> answer.push_back(</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({7, 8, 0})}));</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> </div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <span class="keyword">auto</span> <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>.a_star_search(manhattan_distance);</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> std::cout << <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() << std::endl;</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> </div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> assert(<a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() == answer.size());</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> </div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> uint32_t i = 0;</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rbegin(); it != <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rend(); ++it) {</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> assert(it->get_state() == answer[i]);</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> ++i;</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> }</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> </div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="comment">// 2nd test: A* search for complicated EightPuzzle problem</span></div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <span class="comment">// Initial state</span></div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> puzzle[0] = row3({5, 7, 3});</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> puzzle[1] = row3({2, 0, 6});</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> puzzle[2] = row3({1, 4, 8});</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="comment">// Final state</span></div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> ideal[0] = row3({1, 2, 3});</div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> ideal[1] = row3({4, 5, 6});</div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> ideal[2] = row3({7, 8, 0});</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> </div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> Puzzle = <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a>(puzzle);</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> Ideal = <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<></a>(ideal);</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> </div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="comment">// Initialize the search object</span></div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> = <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a><</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<3></a>>(Puzzle, Ideal);</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> </div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>.a_star_search(manhattan_distance);</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> std::cout << <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() << std::endl;</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <span class="comment">// Static assertion due to large solution</span></div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> assert(13 == <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size());</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="comment">// Check whether the final state is equal to expected one</span></div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> assert(<a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>[0].get_state() == ideal);</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rbegin(); it != <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rend(); ++it) {</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> std::cout << *it << std::endl;</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> }</div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> </div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// 3rd test: A* search for 15-Puzzle</span></div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <span class="comment">// Initial State of the puzzle</span></div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> matrix4 puzzle2;</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> puzzle2[0] = row4({10, 1, 6, 2});</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> puzzle2[1] = row4({5, 8, 4, 3});</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> puzzle2[2] = row4({13, 0, 7, 11});</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> puzzle2[3] = row4({14, 9, 15, 12});</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="comment">// Final state of the puzzle</span></div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> matrix4 ideal2;</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> ideal2[0] = row4({1, 2, 3, 4});</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> ideal2[1] = row4({5, 6, 7, 8});</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> ideal2[2] = row4({9, 10, 11, 12});</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> ideal2[3] = row4({13, 14, 15, 0});</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> </div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="comment">// Instantiate states for a*, initial state and final states</span></div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<4></a> Puzzle2(puzzle2),</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> Ideal2(ideal2);</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="comment">// Initialize the search object</span></div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a><</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<4></a>></div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> search2(Puzzle2, Ideal2);</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="keyword">auto</span> manhattan_distance2 =</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> [](<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<4></a> &first,</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle<4></a> &second) {</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> uint32_t ret = 0;</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++j) {</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> uint32_t <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">find</a> = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(i, j);</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <span class="keywordtype">size_t</span> m = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(), n = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>();</div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> < second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> l = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> < second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) {</div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> <span class="keywordflow">if</span> (find == second.get(k, l)) {</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> std::tie(m, n) = std::make_pair(k, l);</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> }</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> }</div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> }</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> }</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> ret += (std::max(m, i) - std::min(m, i)) +</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> (std::max(n, j) - std::min(n, j));</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> }</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> }</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> }</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordflow">return</span> ret;</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> };</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> </div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="keyword">auto</span> sol2 = search2.a_star_search(manhattan_distance2);</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> std::cout << sol2.size() << std::endl;</div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> </div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="comment">// Static assertion due to large solution</span></div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> assert(24 == sol2.size());</div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// Check whether the final state is equal to expected one</span></div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> assert(sol2[0].get_state() == ideal2);</div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> </div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = sol2.rbegin(); it != sol2.rend(); ++it) {</div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> std::cout << *it << std::endl;</div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> }</div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span>}</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span>}</div>
|
|
<div class="ttc" id="aclass_solution_html"><div class="ttname"><a href="../../dd/d4f/class_solution.html">Solution</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00011">bridge_finding_with_tarjan_algorithm.cpp:11</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a></div><div class="ttdoc">A class defining A* search algorithm. for some initial state and final state.</div><div class="ttdef"><b>Definition</b> <a href="#l00290">a_star_search.cpp:290</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a0a26aa9ad3d73707370d9fe83707aca4"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector< Puzzle > Solution(std::shared_ptr< Info > FinalState, const MapOfPuzzleInfoWithPuzzleInfo &parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition</b> <a href="#l00407">a_star_search.cpp:407</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a47b9bc9815a2e7123ac1dc13e5377301"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a47b9bc9815a2e7123ac1dc13e5377301">machine_learning::aystar_search::AyStarSearch::Info</a></div><div class="ttdeci">struct machine_learning::aystar_search::AyStarSearch::Info Info</div><div class="ttdoc">Struct that handles all the information related to the current state.</div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a48284e156fdd48fd0c41008c7e48f201"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">machine_learning::aystar_search::AyStarSearch::a_star_search</a></div><div class="ttdeci">std::vector< Puzzle > a_star_search(const std::function< uint32_t(const Puzzle &, const Puzzle &)> &dist, const uint32_t permissible_depth=30)</div><div class="ttdef"><b>Definition</b> <a href="#l00431">a_star_search.cpp:431</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_abaff2ea6d309e1133fd95bbd1e39946e"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">machine_learning::aystar_search::AyStarSearch::AyStarSearch</a></div><div class="ttdeci">AyStarSearch(const Puzzle &initial, const Puzzle &final)</div><div class="ttdoc">Parameterized constructor for AyStarSearch.</div><div class="ttdef"><b>Definition</b> <a href="#l00394">a_star_search.cpp:394</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a></div><div class="ttdoc">A class defining EightPuzzle/15-Puzzle game.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">a_star_search.cpp:62</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a1802cf6197a255055cb734d626abc101"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">machine_learning::aystar_search::EightPuzzle::operator=</a></div><div class="ttdeci">EightPuzzle & operator=(EightPuzzle &&A) noexcept</div><div class="ttdoc">Move assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00167">a_star_search.cpp:167</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a194c2973b51a5467fc17064a4ea4e6f9"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">machine_learning::aystar_search::EightPuzzle::~EightPuzzle</a></div><div class="ttdeci">~EightPuzzle()=default</div><div class="ttdoc">Destructor of EightPuzzle.</div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a26a976171392d257ca0f814ed73e0658"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle::generate_possible_moves</a></div><div class="ttdeci">std::vector< EightPuzzle< N > > generate_possible_moves()</div><div class="ttdoc">Find all possible states after processing all possible moves, given the current state of the puzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00178">a_star_search.cpp:178</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a3dc09f4742a0e1167ed202f7bf94721b"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle()</div><div class="ttdoc">Default constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00123">a_star_search.cpp:123</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a467e722dc1fcc82bfb4cef55744e04e2"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle::operator=</a></div><div class="ttdeci">EightPuzzle & operator=(const EightPuzzle &A)</div><div class="ttdoc">Copy assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00158">a_star_search.cpp:158</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a48d054230468b79037964f474d842b6e"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle::in_range</a></div><div class="ttdeci">bool in_range(const uint32_t value) const</div><div class="ttdoc">check whether the index value is bounded within the puzzle area</div><div class="ttdef"><b>Definition</b> <a href="#l00092">a_star_search.cpp:92</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a64815f10cf9fb9fdb4cc92731ccf10ba"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">machine_learning::aystar_search::EightPuzzle::operator<</a></div><div class="ttdeci">bool operator<(const EightPuzzle< N > &check) const</div><div class="ttdoc">check whether one board is lexicographically smaller</div><div class="ttdef"><b>Definition</b> <a href="#l00220">a_star_search.cpp:220</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle::find_zero</a></div><div class="ttdeci">std::pair< uint32_t, uint32_t > find_zero()</div><div class="ttdoc">A helper array to evaluate the next state from current state;.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">a_star_search.cpp:77</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a9517e162e2988f7db052296bd550a742"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">machine_learning::aystar_search::EightPuzzle::operator<<</a></div><div class="ttdeci">friend std::ostream & operator<<(std::ostream &op, const EightPuzzle< N > &SomeState)</div><div class="ttdoc">friend operator to display EightPuzzle<></div><div class="ttdef"><b>Definition</b> <a href="#l00252">a_star_search.cpp:252</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa17e0227321b109ed91e156ac1332915"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle::operator==</a></div><div class="ttdeci">bool operator==(const EightPuzzle< N > &check) const</div><div class="ttdoc">check whether two boards are equal</div><div class="ttdef"><b>Definition</b> <a href="#l00202">a_star_search.cpp:202</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa5c0486c7f29f323a2aced2ab33af420"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle::get</a></div><div class="ttdeci">uint32_t get(size_t i, size_t j) const</div><div class="ttdoc">get the value from i units from right and j units from left side of the board</div><div class="ttdef"><b>Definition</b> <a href="#l00104">a_star_search.cpp:104</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa73857052e69b86347859d9148933f71"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle::moves</a></div><div class="ttdeci">std::vector< std::pair< int8_t, int8_t > > moves</div><div class="ttdoc">N x N array to store the current state of the Puzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00066">a_star_search.cpp:66</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ab7fd890a7ccf756e4b3313087b76a8c2"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const std::array< std::array< uint32_t, N >, N > &init)</div><div class="ttdoc">Parameterized Constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00134">a_star_search.cpp:134</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ad45fde095ac00effe1fe00b1d85ff9c7"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const EightPuzzle< N > &A)</div><div class="ttdoc">Copy constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00141">a_star_search.cpp:141</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ade14b0e1a88543b91426e2008e4d0f99"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">machine_learning::aystar_search::EightPuzzle::get_state</a></div><div class="ttdeci">std::array< std::array< uint32_t, N >, N > get_state()</div><div class="ttdoc">Returns the current state of the board.</div><div class="ttdef"><b>Definition</b> <a href="#l00113">a_star_search.cpp:113</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ae145ac4a0d2ec58945b58fad3c04f00f"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">machine_learning::aystar_search::EightPuzzle::get_size</a></div><div class="ttdeci">size_t get_size() const</div><div class="ttdoc">returns the size of the EightPuzzle (number of row / column)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">a_star_search.cpp:119</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_af22395b8e9e04222aa93a329523faef9"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const EightPuzzle< N > &&A) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00147">a_star_search.cpp:147</a></div></div>
|
|
<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_af778034b2942ecac6df1e9ec8b5412ee"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">machine_learning::aystar_search::EightPuzzle::operator<=</a></div><div class="ttdeci">bool operator<=(const EightPuzzle< N > &check) const</div><div class="ttdoc">check whether one board is lexicographically smaller or equal</div><div class="ttdef"><b>Definition</b> <a href="#l00235">a_star_search.cpp:235</a></div></div>
|
|
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
|
|
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
|
|
<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
|
|
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
|
|
<div class="ttc" id="anamespaceaystar__search_html"><div class="ttname"><a href="../../db/ddc/namespaceaystar__search.html">aystar_search</a></div><div class="ttdoc">Functions for A* Search implementation.</div></div>
|
|
<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
|
|
<div class="ttc" id="anamespacequadratic__probing_html_a5ceee4128d92ca4412040b7104d1299d"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing::find</a></div><div class="ttdeci">Entry find(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00131">quadratic_probing_hash_table.cpp:131</a></div></div>
|
|
<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a003a30bb165be50ce503c17df90c128d"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch::Info::depth</a></div><div class="ttdeci">size_t depth</div><div class="ttdoc">stores h score</div><div class="ttdef"><b>Definition</b> <a href="#l00298">a_star_search.cpp:298</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a331d1070d008a4f9d55775a51013baa3"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch::Info::heuristic_value</a></div><div class="ttdeci">size_t heuristic_value</div><div class="ttdoc">Holds the current state.</div><div class="ttdef"><b>Definition</b> <a href="#l00297">a_star_search.cpp:297</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a572de12115e39e34dde6e68b707d59f5"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Info &A)</div><div class="ttdoc">Copy constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00326">a_star_search.cpp:326</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a695e4314ebc3ab58e13004dc63599fe8"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Puzzle &A)</div><div class="ttdoc">constructor having Puzzle as parameter</div><div class="ttdef"><b>Definition</b> <a href="#l00309">a_star_search.cpp:309</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a6abc89925ae7055a63b428e61525ad7a"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Info &&A) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00335">a_star_search.cpp:335</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_aa816af5a64b37c86be8acda89fdefba2"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">machine_learning::aystar_search::AyStarSearch::Info::~Info</a></div><div class="ttdeci">~Info()=default</div><div class="ttdoc">Destructor for Info.</div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_aaa7ea27346659f0abe2df82ca57fc5a7"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info()=default</div><div class="ttdoc">stores g score</div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ac77d992953fa0de10a755e5a9aa06317"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch::Info::operator=</a></div><div class="ttdeci">Info & operator=(const Info &A)</div><div class="ttdoc">copy assignment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00344">a_star_search.cpp:344</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ad3950824936488f66408313b1f8a8ca8"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Puzzle &A, size_t h_value, size_t d)</div><div class="ttdoc">constructor having three parameters</div><div class="ttdef"><b>Definition</b> <a href="#l00317">a_star_search.cpp:317</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ad3993dbca9c5b3ef9ac361dc7f62ce57"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57">machine_learning::aystar_search::AyStarSearch::Info::operator=</a></div><div class="ttdeci">Info & operator=(Info &&A) noexcept</div><div class="ttdoc">move assignment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00355">a_star_search.cpp:355</a></div></div>
|
|
<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator_html"><div class="ttname"><a href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">machine_learning::aystar_search::AyStarSearch::comparison_operator</a></div><div class="ttdoc">Custom comparator for open_list.</div><div class="ttdef"><b>Definition</b> <a href="#l00372">a_star_search.cpp:372</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><b>a_star_search.cpp</b></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>
|