70 likes | 130 Vues
This project utilizes A* search algorithm to find the optimal path from the initial state to the goal state. The algorithm uses heuristic values to guide the search process efficiently and ensure the best possible solution is found.
E N D
Ricerca Greedy Stato iniziale: ROC, Goal: KEE
(2) (2) (3) (2) (2) h=178 h=74 h=227 h=157 h=135 h=177 h=159 h=180 h=469 h=177 h=159 h=159 h=180 h=0 h=469 h=180 (3) Coda: (BAR,227) Coda: (BOS,74), (BAR,227) Coda: (AUG,157), (BAR,227) Coda: (BAR,227) Coda: (HYA,135), (AUG,157), (BAR,227) Coda: (AUG,157), (BAR,227) Coda: (KEE,0), (NAN(3), 159), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469), (CHV(2),469) Coda: (AUG,157), (NAN,159), (LAG,177), (BAR,227) Coda: (AUG,157), (NAN,159), (LAG,177), (NEW,180), (BAR,227) Coda: (NAN,159), (LAG,177), (NEW,180), (BAR,227) Coda: (LAG,177), (NEW,180), (BAR,227) Coda: (NAN(2),159), (LAG(2),177), (NEW,180), (NEW(2),180), (BAR,227), (CHV,469) Coda: (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469), (CHV(2),469) Coda: (LAG(2),177), (NEW,180), (NEW(2),180), (BAR,227), (CHV,469) Coda: (KEE,0), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469), (CHV(2),469) Coda: (NEW,180), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469), (CHV(2),469) Coda: (NEW,180), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469) Coda: (LAG(2),177), (NEW,180), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469) Coda: (LAG,177), (LAG(2),177), (NEW,180), (NEW(2),180), (BAR,227) Coda: (LAG(2),177), (NEW,180), (NEW(2),180), (BAR,227) Coda: (LAG(2),177), (NEW,180), (NEW(2),180), (BAR,227), (CHV,469) Coda: (LAG,177), (LAG(2),177), (NEW,180), (BAR,227) Coda: (AUG,157), (LAG,177), (BAR,227) Coda: (NAN(3), 159), (NEW(2),180), (NEW(3),180), (BAR,227), (CHV,469), (CHV(2),469)
(2) (2) (3) (2) (2) Soluzione finale h=178 h=74 h=227 h=157 h=135 h=177 h=159 h=180 h=469 h=177 h=159 h=159 h=180 h=0 h=469 h=180 (3)
A* Stato iniziale: ROC, Goal: KEE
276 178 229 404 353 f=0+178=178 461 155 599 49 f=155+74=229 f=49+227=276 610 610 149 63 f=304+157=461 f=218+135=353 204 27 212 f=422+177=599 f=245+159=404 f=430+180=610 302 207 207 216 180 216 f=646+159=805 f=724+469=1173 f=629+159=788 f=452+177=629 f=461+180=641 f=610+0 Coda: (BAR,276) Coda: (BAR,276), (AUG,461) Coda: (BAR,276), (HYA,353), (AUG,461) Coda: (HYA,353), (AUG,461) Coda: (AUG,461) Coda: (NAN,404), (AUG,461), (LAG,599) Coda: (NAN,404), (AUG,461), (LAG,599), (NEW,610) Coda: (AUG,461), (LAG,599), (NEW,610) Coda: (AUG,461), (LAG,599), (NEW,610), (LAG,629) Coda: (AUG,461), (LAG,599) Coda: (LAG,599), (NEW,610), (LAG,629), (NEW,641) Coda: (NEW,610), (LAG,629), (NEW,641) Coda: (NEW,610), (LAG,629), (NEW,641), (CHV,1173) Coda: (NEW,610), (LAG,629), (NEW,641), (NAN,788), (CHV,1173) Coda: (BAR,276) Coda: (KEE,610), (LAG,629), (NEW,641), (NAN,788), (CHV,1173) Coda: (KEE,610), (LAG,629), (NEW,641), (NAN,788), (NAN,805), (CHV,1173) Coda: (LAG,629), (NEW,641), (NAN,788), (NAN,805), (CHV,1173) Coda: (LAG,629), (NEW,641), (NAN,788), (CHV,1173) Coda: (AUG,461), (LAG,599), (NEW,610), (LAG,629), (NEW,641) Coda: (BOS,229), (BAR,276)
Soluzione finale 276 178 229 404 353 f=0+178=178 461 155 599 49 f=155+74=229 f=49+227=276 610 610 149 63 f=304+157=461 f=218+135=353 204 27 212 f=422+177=599 f=245+159=404 f=430+180=610 302 207 207 216 180 216 f=646+159=805 f=724+469=1173 f=629+159=788 f=452+177=629 f=461+180=641 f=610+0