Ifi6057w3: erinevus redaktsioonide vahel

Allikas: Lambda
Mine navigeerimisribale Mine otsikasti
PriitJ (arutelu | kaastöö)
PriitJ (arutelu | kaastöö)
7. rida: 7. rida:
Videoloeng: [http://www.youtube.com/watch?v=9ZSVrUZ-vn0 BFS ja DFS]
Videoloeng: [http://www.youtube.com/watch?v=9ZSVrUZ-vn0 BFS ja DFS]


Harjutustunniks - õpiku algoritmid valmispaketina:
== Harjutustund ==


[https://github.com/aimacode/aima-python aima-python]
  def test(initial, searchfunc):
* [https://github.com/aimacode/aima-python/blob/master/search.py otsingu moodul].
    p = EightPuzzle(initial, GOAL)
    ip = search.InstrumentedProblem(p)
    n=searchfunc(ip)
    # expanded/goal tests/leaves/(solution)
    print (ip)
    if hasattr(n, "path"):
        print (n.path())
    else:
        print (n)


[https://github.com/aimacode/aima-java aima-java]
* kuidas kasutada: [https://github.com/aimacode/aima-java/wiki/AIMA3e-Workspace-Setup Setting up your own workspace]
* mõned olulised klassid: [http://aimacode.github.io/aima-java/aima3e/javadoc/aima-core/aima/core/search/framework/TreeSearch.html TreeSearch], [http://aimacode.github.io/aima-java/aima3e/javadoc/aima-core/aima/core/search/framework/Problem.html Problem].


[[Ifi6057strategies|Otsingustrateegiad harjutustunniks]]
<!--2016 [[Ifi6057strategies|Otsingustrateegiad harjutustunniks]]-->

Redaktsioon: 15. september 2017, kell 10:36

3. Nädal

Ülesannete lahendamine otsinguga; AIMA chapter 3.3-3.4, TI 14-15.

Lühendatud slaidid PDF

Videoloeng: BFS ja DFS

Harjutustund

 def test(initial, searchfunc):
   p = EightPuzzle(initial, GOAL)
   ip = search.InstrumentedProblem(p)
   n=searchfunc(ip)
   # expanded/goal tests/leaves/(solution)
   print (ip)
   if hasattr(n, "path"):
       print (n.path())
   else:
       print (n)