Skip to content

推 A* 算法入门 #256

Closed
Closed
@haoawesome

Description

@haoawesome
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=

Activity

haoawesome

haoawesome commented on Oct 13, 2014

@haoawesome
CollaboratorAuthor

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

haoawesome commented on Oct 13, 2014

@haoawesome
CollaboratorAuthor
haoawesome

haoawesome commented on Oct 13, 2014

@haoawesome
CollaboratorAuthor

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

      Development

      No branches or pull requests

        Participants

        @haoawesome

        Issue actions

          推 A* 算法入门 · Issue #256 · memect/hao