harada

5 ms·

1.
My Apple II/c(harablog.wordpress.com)
1 points by harada 15y ago|0 comments
2.
by harada 15y ago
Two equivalent paths share the same endpoints and have the same length. Two symmetric paths also have these properties but they can also be shown to be permutations of each other. Seeing the permutation property isn't straightforward unti
3.
by harada 15y ago
In the paper we make an apples-to-apples comparison with a recent optimality-preserving state-space reduction method called Swamps and an apples-to-oranges comparison with an approximate pathfinding algorithm, HPA*. Swamps is a nice techniq
4.
by harada 15y ago
I can see how defining symmetry for a pathfinding domain might be non-intuitive. What the quoted definition is trying to communicate is that paths sharing such a relation are permutations of one another and thus, symmetric.
5.
by harada 15y ago
This behaviour exists because A*'s heuristic function assumes there are no obstacles when estimating the remaining distance to reach the goal. As the difference between the heuristic estimate to the goal and the actual distance increases,
6.
Faster pathfinding using Jump Point Search(harablog.wordpress.com)
110 points by harada 15y ago|16 comments
7.
Faster Pathfinding using Empty Rectangles(harablog.wordpress.com)
3 points by harada 15y ago|0 comments
8.
Fast Pathfinding via Symmetry Breaking (harablog.wordpress.com)
5 points by harada 15y ago|0 comments
9.
The Paper (a short poem about research)(harablog.wordpress.com)
0 points by harada 15y ago|0 comments
10.
AIIDE 2010 Conference Summary (Game AI)(harablog.wordpress.com)
1 points by harada 16y ago|0 comments
11.
by harada 16y ago
This is such a great idea. I donate to charity regularly anyway and I'm a sucker for games. Now I can have both! I ended up paying $100. Most of the money went to Child's Play but the devs still got $20 and the EFF $10.