public:t-622-arti-13-1:lab_2_-_formulating_search_problems
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| public:t-622-arti-13-1:lab_2_-_formulating_search_problems [2013/02/01 10:47] – [Tasks] stephan | public:t-622-arti-13-1:lab_2_-_formulating_search_problems [2024/04/29 13:33] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 18: | Line 18: | ||
| 2. Estimate the memory requirement for you state data structure (in bytes relative to //c// and //r//). Suppose you want to solve the game by searching the state space. How does the size of your data structure influence the applicability of breadth-first search, depth-first search and iterative deepening search? What is the largest board (//c// x //r//) that you could solve using each of the three algorithms assuming you have 2GB of memory available? For the sake of simplicity, you can assume a square board, i.e. // | 2. Estimate the memory requirement for you state data structure (in bytes relative to //c// and //r//). Suppose you want to solve the game by searching the state space. How does the size of your data structure influence the applicability of breadth-first search, depth-first search and iterative deepening search? What is the largest board (//c// x //r//) that you could solve using each of the three algorithms assuming you have 2GB of memory available? For the sake of simplicity, you can assume a square board, i.e. // | ||
| - | 3. For each of functions above, determine its (worst-case) time complexity in terms of //c// and //r//. | + | 3. For each of functions above (legal moves, successor state, ...), determine its (worst-case) time complexity in terms of //c// and //r//. |
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-13-1/lab_2_-_formulating_search_problems.1359715630.txt.gz · Last modified: 2024/04/29 13:32 (external edit)