<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[vyasastrategy]]></provider_name><provider_url><![CDATA[https://vyasastrategy.wordpress.com]]></provider_url><author_name><![CDATA[vvyasa]]></author_name><author_url><![CDATA[https://vyasastrategy.wordpress.com/author/vvyasa/]]></author_url><title><![CDATA[List of Search Algorithms in AI&nbsp;context]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>DFS</p>
<p>BFS</p>
<p>Best first search</p>
<p>Hill climbing</p>
<p>branch and bound</p>
<p>A* Search.</p>
<p>AO* Search / Goal Tree Search.</p>
<p>in each of the above we will be discussing space complexity and time complexity and main purpose of algorithm.</p>
]]></html></oembed>