blocks|key|847444|text|您确实需要A*，它是基于网格的路径查找的最佳实现。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|847445|这也许能帮到你：|847446|http://www.cokeandcode.com/main/tutorials/path-finding/|offset|length|847447|编辑：(前面的链接)既可以作为一组可实现的类，也可以作为定制路径查找方法以满足您的要求的指南。|style|BOLD|847448|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|1J|0|0|0|3|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|T|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|U|8|@]|9|@$F|V|G|W|1|X]]|A|$]]|$1|H|3|I|5|6|7|Y|8|@$F|Z|G|10|J|K]]|9|@]|A|$]]|$1|L|3|-4|5|6|7|11|8|@]|9|@]|A|$]]]|M|$N|$5|O|P|Q|A|$R|E]]]]

You do want A*, it is the optimal implementation for grid based pathfinding.

This might help you out:

<a href="http://www.cokeandcode.com/main/tutorials/path-finding/" rel="noreferrer">http://www.cokeandcode.com/main/tutorials/path-finding/</a>

EDIT: The preceeding link is good for both as an implementable set of classes and as a guide for customizing the path finding methods to meet your satisfaction.

blocks|key|626837|text|当然，如果您编写自己的实现，您将学到很多关于路径查找的知识。但是你也会花很多时间去做这件事。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|626838|查看处理一般图形的JGraphT库，它有一个很好的API，并且支持更多最短路径算法，而不仅仅是A*。|offset|length|626839|entityMap|0|LINK|mutability|MUTABLE|url|http://jgrapht.sourceforge.net/|1|http://www.jgrapht.org/javadoc/org/jgrapht/alg/DijkstraShortestPath.html^0|0|9|7|0|X|2|1|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@$D|R|E|S|1|T]|$D|U|E|V|1|W]]|A|$]]|$1|F|3|-4|5|6|7|X|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|M]]|N|$5|I|J|K|A|$L|O]]]]

Naturally you will learn a lot about pathfinding if you write your own implementation. But you will also spend a lot of time doing it.

Check out the <a href="http://jgrapht.sourceforge.net/" rel="nofollow noreferrer">JGraphT</a> library that deals with graphs in general, has a nice API and supports <a href="http://www.jgrapht.org/javadoc/org/jgrapht/alg/DijkstraShortestPath.html" rel="nofollow noreferrer">more</a> shortest path algorithms than just A*.

blocks|key|2157246|text|这是我迄今见过的信息最丰富的寻路文章：http://www.ai-blog.net/archives/000152.html|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2157247|entityMap|0|LINK|mutability|MUTABLE|url|http://www.ai-blog.net/archives/000152.html^0|J|17|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

This is the most informative pathfinding post I've seen to date: <a href="http://www.ai-blog.net/archives/000152.html" rel="nofollow noreferrer">http://www.ai-blog.net/archives/000152.html</a>

blocks|key|847764|text|游戏开发者的人工智能一书对A*有一个很好的解释。我今天真的要写一个实现..。如果我这么做了，我会把密码扔到这里。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|847765|代码已经完成，它太大了，不能放在这里，所以您可以从：https://chaos.bcit.ca/svn/public/astar/+(自签名证书，但服务器不会做任何坏事)获取它。|847766|我在很大程度上遵循了书中的伪代码，但对于A*，我使所有东西都更加面向对象。|847767|你有一个由瓷砖组成的迷宫。每个Tile都有一个位置和一个障碍(如果没有障碍，则为null)。|847768|您可以使用PathFinder+(如AStar)来查找给定起始位置和结束位置之间的第四条最短路径。你会得到一条回来的路，其中包括从一开始到最后你需要经过的瓦片。|847769|您可以通过提供不同的HeuristicCalculator来更改启发式计算(当前的一个只检查是否存在障碍，并计算出要通过的最短的瓷砖数，您可以为不同的障碍添加权重，例如，如果您不喜欢默认设置)。|847770|代码是LGPL下的许可，所以如果您进行更改并分发应用程序，则必须使更改可用。请随意将错误报告/补丁发送到许可证注释中的电子邮件地址(每个标头中都可以找到)。|847771|我(从来没有)会在考试后发表评论，但我认为这是非常直接的。|847772|entityMap|0|LINK|mutability|MUTABLE|url|http://oreilly.com/catalog/9780596005559/|1|https://chaos.bcit.ca/svn/public/astar/^0|0|A|0|0|Q|13|1|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|D|3|E|5|6|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|F|3|G|5|6|7|19|8|@]|9|@]|C|$]]|$1|H|3|I|5|6|7|1A|8|@]|9|@]|C|$]]|$1|J|3|K|5|6|7|1B|8|@]|9|@]|C|$]]|$1|L|3|M|5|6|7|1C|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1D|8|@]|9|@]|C|$]]|$1|P|3|Q|5|6|7|1E|8|@]|9|@]|C|$]]|$1|R|3|-4|5|6|7|1F|8|@]|9|@]|C|$]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]]]

The book <a href="http://oreilly.com/catalog/9780596005559/" rel="nofollow noreferrer">AI for Game Developers</a> has a very good explanation of A*. I was actually going to write an implementation today... if I do I'll throw the code up here.

The code is done, it is too big to put here, so you can grab it from: <a href="https://chaos.bcit.ca/svn/public/astar/" rel="nofollow noreferrer">https://chaos.bcit.ca/svn/public/astar/</a> (self signed certificate, but the server doesn't do anything evil).

I followed the pseudo-code in the book for the most part, but I made everything much more object oriented than anything I have seen thus far for A*. 

You have a Maze that consists of Tiles. Each Tile has a Location and an Obstacle (null if there is no obstacle). 

You can use a PathFinder (like AStar) to find th shortest path between a given start and end location. You get a Path back which includes the Tiles you need to go through to get from the start to the end. 

You can change the heuristic calculation by providing a different HeuristicCalculator (the current one just checks to see if there is an Obstacle or not and figures out the shortest number of Tiles to go through, you could add weights to different Obstacles for instance if you don't like the default).

The code is license under the LGPL, so if you make changes and distribute the app you have to make the changes available. Feel free to send bug reports/fixes to the email address in the license comment (found in each header). 

I'll (never did) get around to commenting it after exams, but I think it is pretty straight forward.

blocks|key|626862|text|也许你找到了你想要的东西，但是这里有一个关于A*寻路的很好的解释的链接。我不得不在C%2B%2B中为我的游戏实现A*，它帮助我很好地理解了它是如何工作的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|626863|http://www.abdn.ac.uk/~csc245/teaching/CS1015/practicals/aStarTutorial.htm|626864|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/C%252B%252B|1^0|15|3|0|0|0|22|1|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@$A|P|B|Q|1|R]]|C|$]]|$1|D|3|E|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|F|3|-4|5|6|7|W|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]|N|$5|I|J|K|C|$L|E]]]]

Maybe you found what you wanted, but here's a link with a nice explanation of A* pathfinding. I had to implement A* for my game in <a href="http://en.wikipedia.org/wiki/C%2B%2B" rel="nofollow noreferrer">C++</a>, and it helped me a lot to understand how it works.

<a href="http://www.abdn.ac.uk/~csc245/teaching/CS1015/practicals/aStarTutorial.htm" rel="nofollow noreferrer">http://www.abdn.ac.uk/~csc245/teaching/CS1015/practicals/aStarTutorial.htm</a>

I'm currently writing a very basic Java game based on the idea of <a href="https://en.wikipedia.org/wiki/Theme_Hospital" rel="noreferrer">Theme Hospital</a>.

I'm quite new to Java and am currently studying at the university my first year. I have done Java for nearly two years now on and off, but I'm finally devoting my time to a decent project.

I'm at the stage where I need to create a person (patient) to be admitted to the hospital. They need to go to the reception desk, then GP's office, and then back to their starting position. 

I have looked into A* path finding, but it seems really complicated to me. I understand how it works I think, but am unsure how to implement it into my game.

So far, the user can place a reception desk, and build a GP's office. Each of these has a "point of usage" which will be the place the patient has to get to. The grid squares can only be full or not, there will be no different terrain.

I'm hesitant to paste any code yet, as it's messy as I've learn a lot of new techniques to do with GUI in the past few months. My plan is to get to the milestone 1, making the patient go to the desk then the office and then leave. Once I have this, I will tidy up the code more.

I've seen many implementations of A* and many different types. Can someone give me a starting point I can work with? Should I try and adapt an already written set of classes, or try to write my own from the scratch?

Pathfinding 2D Java game?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我目前正在根据的思想编写一个非常基本的Java游戏。我对Java很陌生，我现在大学一年级就在学习。我已经做了将近两年的Java了，但我终于把时间花在了一个像样的项目上。我所处的阶段，我需要创造一个人(病人)住院。他们需要去接待处，然后是GP的办公室，然后回到他们的起始位置。我一直在寻找一条路，但这对我来说似乎很复杂。我理解它是如何工作的，但我不知道如何在我的游戏中实现它。到目前为止，用户可以设置一

问寻路2D Java游戏？
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问寻路2D Java游戏？EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问寻路2D Java游戏？
EN