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: 2015/05/22 JSAI presentation #87

Closed jinnaiyuu closed 9 years ago

jinnaiyuu commented 9 years ago

1 . explain A* find or draw cute image.

2 . redraw HDA* just draw.

3 . projection think what it is. read original paper.

4 . search phase need more illustrative explanation

5 . initialize Structured Zobrist how can I put so much information?

6 . 24 puzzle projection strategies well, first of all, isn't it elaborative?

7 . experimental results need to sum up results.

jinnaiyuu commented 9 years ago

1 . search phase for Zobrist & Structured Zobrist well, what info we need here?

2 . experimental results what info we need here?

3 . run more experiments grid-pathfinding, msa, tsp

4 . additional slides simple vs. abstraction vs. zobrist vs. sz? what else we need? strips?

jinnaiyuu commented 9 years ago

1 . search overhead & load balance what is load balance? what does it mean to search overhead?

2 . practice 15 minute per one practice.

3 . do we need load balance? I think we only need to talk about search overhead. load balance contains other factors. -> let's just omit load balance.