Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

推 A* 算法入门 #256

Closed
haoawesome opened this issue Oct 13, 2014 · 3 comments
Closed

推 A* 算法入门 #256

haoawesome opened this issue Oct 13, 2014 · 3 comments

Comments

@haoawesome
Copy link
Collaborator

推荐A_搜索算法的可视化短教程 http://memect.co/KaERAXv A_搜索是人工智能基本算法,用于高效地搜索图中两点的最佳路径, 核心是 g(n)+h(n): g(n)是从起点到顶点n的实际代价,h(n)是顶点n到目标顶点的估算代价。下图看优点: 选择最佳路径,同时降低搜索代价(不遍历所有格子) 合集 http://memect.co/brJTgzd

http://www.weibo.com/5220650532/BrnTyvnCT?ref=

@haoawesome
Copy link
Collaborator Author

http://www.redblobgames.com/pathfinding/a-star/introduction.html 利用可视化技术介绍A* 算法的核心思想,好玩又好看。

screen shot 2014-10-13 at 1 32 40 am

screen shot 2014-10-13 at 2 07 24 am

@haoawesome
Copy link
Collaborator Author

http://zh.wikipedia.org/zh-cn/A*%E6%90%9C%E5%AF%BB%E7%AE%97%E6%B3%95
基本概念与伪码
astar_progress_animation
a _search_example_on_north_american_freight_train_network

http://blog.csdn.net/v_JULY_v/article/details/6093380 一篇很受欢迎的中文A*算法介绍

@haoawesome
Copy link
Collaborator Author

http://blog.csdn.net/v_JULY_v/article/details/6093380 一篇很受欢迎的中文A*算法介绍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant