Server data exchange method and system based on hexagonal map and electronic equipment

Abstract

The invention relates to the technical field of data processing, in particular to a server data exchange method and system based on a hexagonal map and electronic equipment. The method comprises the following steps: dividing game map data into a plurality of areas, wherein each area is managed by at least one server; cutting the game map data in real time by using a kd-tree algorithm or a Quadtree algorithm, and dividing the game map data into a plurality of areas according to a coordinate system constructed by the hexagonal map; and migrating the game map data re-divided into other areas to the corresponding server. According to the method, the hexagonal map real-time cutting efficiency and the data management efficiency are improved.

Description

technical field [0001] The present application relates to the technical field of data processing, in particular to a server data exchange method, system and electronic equipment based on a hexagonal map. Background technique [0002] With the development of the game business, the number of game players is increasing. It is normal for a game to have millions or even tens of millions of players, and there are more and more games with modes such as big world and global server. Favored by players, due to the limitation of server hardware performance bottlenecks, it is difficult for a single server to support such a large number of players, so a server with a distributed architecture is very necessary. [0003] In the prior art, distributed game architecture maps implemented by distributed architecture servers are often quadrilateral maps. By cutting the quadrilateral maps into complete and regular areas by straight lines, each area of ​​the quadrilateral map can be allocated to ...

AI Technical Summary

Problems solved by technology

[0003] In the prior art, distributed game architecture maps implemented by distributed architecture servers are often quadrilateral maps. By cutting the quadrilateral maps into complete and regular areas by straight lines, each area of ​​the quadrilateral map can be allocated to different servers. When it is necessary to re-adjust the size of the game map corresponding to the area, you can move the straight line, re-cut the quadrilateral map, and adjust the size of the game map divided by each area in real time; in actual practice, it is found that the movement direction of the quadrilateral map is limited. In theory Generally speaking, the circular map has the most moving directions, but the circular map cannot be densely tiled. Therefore, in order to solve the problem of the limited moving direction of the quadrilateral map and the problem that the balanced circular map cannot be densely tiled, a six-sided map is proposed. graphic map

[0004] In the process of implementing this application, the inventors found that at least the following problems exist in the prior art: for hexagonal maps, the cutting method such as quadrilateral maps is used to re-divide the size of the hexagonal maps in each area, and the hexagonal maps will be cut into Irregular shape, the use of quadrilateral map cutting scheme and interactive scheme will lead to confusion in the logic of the hexagonal map, which is not convenient for operation and maintenance management

Images