聽唔明你想講咩=.=


你英文唔係太好,不如打返中文=.=

TOP

要efficient用pointer 囉
Jimmy0911 發表於 25/11/2013 09:04 AM



    呢個係o(n^2) ge問題

TOP

兄弟你幾時要交?不如我幫你問下教我2D Game Production個Lecturer點攪lol
佢好勁(應該)

呢個assignment有多少難度。佢有要求Big O唔可以太大定係解到題就得?

TOP

The n-puzzle is a classical problem for modelling algorithms involving heuristics. Commonly used heuristics for this problem include counting the number of misplaced tiles and finding the sum of the Manhattan distances between each block and its position in the goal configuration. Note that both are admissible, i.e., they never overestimate the number of moves left, which ensures optimality for certain search algorithms such as A*.

研究下點用A*去解

TOP