<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
<channel>
<title>Algorithms Q&amp;A - Recent questions in Uninformed Search</title>
<link>https://notexponential.com/questions/artificial-intelligence/uninformed-search</link>
<description>Powered by Question2Answer</description>
<item>
<title>Searching Problem with Numbers</title>
<link>https://notexponential.com/769/searching-problem-with-numbers</link>
<description>&lt;p&gt;Start state = Number &quot;4&quot;&lt;br&gt;Target state = Number &quot;5&quot;&lt;br&gt;Successor function:&lt;/p&gt;&lt;ul&gt;&lt;li&gt;factorial, cost = 3&lt;/li&gt;&lt;li&gt;square root, cost = 2&lt;/li&gt;&lt;li&gt;floor, cost 1.&lt;/li&gt;&lt;/ul&gt;&lt;p&gt;1. Frame this problem as a regular AI &quot;search&quot; problem.&lt;br&gt;2. Find the shortest cost path from start node to target node.&lt;/p&gt;</description>
<category>Uninformed Search</category>
<guid isPermaLink="true">https://notexponential.com/769/searching-problem-with-numbers</guid>
<pubDate>Wed, 19 Jan 2022 00:57:10 +0000</pubDate>
</item>
</channel>
</rss>