Arifin , Jon (1996) Pencairan solusi optimal pada graph OR puzzle - 8 dengan algoritma A. Undergraduate thesis, FMIPA UNDIP.
![[img]](/style/images/fileicons/application_pdf.png) | PDF Restricted to Repository staff only 2285Kb | |
| PDF 18Kb | |
| PDF 208Kb | |
| PDF 342Kb | |
| PDF 310Kb | |
| PDF 890Kb | |
| PDF 836Kb | |
| PDF Restricted to Repository staff only 380Kb | |
| PDF 224Kb | |
| PDF 214Kb |
Abstract
Dalam togas akhir ini disajikan algoritma A* yang merupakan pencarian heuristik dan bertujuan menemukan path solusi optimal pada graph OR suatu * diuraikan sifat-sifat algoritma A persoalan. Kemudian dan contohnya pada Puzzle-8.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
| ID Code: | 31527 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 23 Nov 2011 07:09 |
| Last Modified: | 23 Nov 2011 07:09 |
Repository Staff Only: item control page
