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

Comments

Projects
None yet
1 participant
@haoawesome
Copy link
Collaborator

commented Oct 13, 2014

推荐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

This comment has been minimized.

Copy link
Collaborator Author

commented Oct 13, 2014

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

This comment has been minimized.

Copy link
Collaborator Author

commented Oct 13, 2014

@haoawesome haoawesome closed this Oct 13, 2014

@haoawesome haoawesome reopened this Oct 13, 2014

@haoawesome

This comment has been minimized.

Copy link
Collaborator Author

commented Oct 13, 2014

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

@haoawesome haoawesome closed this Oct 13, 2014

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.