TODO: Evaluate n * m puzzles

jinnaiyuu / Hash-Distributed-Astar

Hash Distributed A*

https://sites.google.com/site/yuujinnaishomepage/home/parallel-search

MIT License

3 stars 1 forks source link

TODO: Evaluate n * m puzzles #23

Closed jinnaiyuu closed 9 years ago

jinnaiyuu commented 10 years ago

There are many sizes of sliding puzzles.

Might be able to find something useful for these puzzles.

3_6 (17) 3_7 (20) 3_8 (23) 4_4 (15) 4_5 (19) 4_6 (23) 5*5 (24)

There are several difference in these domains. -Size (the # of expansion) -Branching factor (might be a factor of load balancing) -Height-Width ratio (how accurate the h value is) -> can estimate with the descrepancy of initial h value and actual solution length

jinnaiyuu commented 9 years ago

Don't think this to be important. For now just discard it.