Automatic way-finding method in game

Abstract

The invention provides an automatic way-finding method in a game. The automatic way-finding method comprises the following steps: S1: dividing a game map into meshed way-finding points, wherein at least one way-finding point is an obstacle point; S2: selecting the two way-finding points as a starting point and a target point, and taking the starting point as a current way-finding point; S3: searching a next way-finding point in the direction from the current way-finding point to the target point, and judging whether the next way-finding point is the obstacle point or not; S4: if the next way-finding point is not the obstacle point, judging whether the next way-finding point is the target point; S5: if the next way-finding point is the obstacle point, taking a searching path as a way-finding path; if the next way-finding point is not the obstacle point, taking the next way-finding point as the current way-finding point, and carrying out the step S3; and S6: if the next way-finding point is the obstacle point, searching the next way-finding point in the left and right directions of the obstacle point, and taking the next way-finding point as the current way-finding point and carrying out the step S3. By the aid of the automatic way-finding method, the search, which is not related with the way-finding point, can be reduced and the searching efficiency is improved.

Description

technical field [0001] The invention relates to the field of network information technology, in particular to an automatic pathfinding method in games. Background technique [0002] When game users play games, they need to manipulate game characters to perform various actions, including moving and fighting. And movement is the basic action of the game. In order to save game users from having to spend time and energy to find the target in the game, automatic pathfinding came into being. Automatic pathfinding can make game characters automatically move to the target position specified by the game user. [0003] The traditional automatic pathfinding method is to divide the game map into grid-like pathfinding points. After the game user selects the target point, he starts to search for the shortest reachable path from the starting point to the target point. This method needs to search many irrelevant wayfinding points to find the reachable path, so the search efficiency is rel...

AI Technical Summary

Problems solved by technology

This method needs to search a lot of irrelevant wayfinding points to find the reachable path, so the search efficiency is relatively low and the search time is relatively long

Images