anyone can give me useful link which contains recursive best first search algorithm pseudo code?
like this (for IDDFS)
thanks for your help
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
anyone can give me useful link which contains recursive best first search algorithm pseudo code?
like this (for IDDFS)
thanks for your help
| Name |
|---|



Why do you need a recursive realization of BFS? It seems there is no way to use the recursion stack for performing it: you need a queue as in classical BFS or you have to visits vertices several times as in IDDFS anyway.
do you know what is RBFS?
I didn't say recursive BFS, I said RBFS (Recursive Best First Search) which is heuristic based algorithm
anyway thanks for your unrelated answer, I found one link
In addition to Grevozin's answer, this may provide related info.
deleted