Turn-based combat data processing method and device and storage medium

Abstract

The invention provides a turn-based combat data processing method and device and a storage medium. The method comprises the steps of setting different bit plane identifiers for different rounds of combats; packaging resources of the rounds of combats corresponding to different bit plane identifiers into different class objects, and mounting different class objects to combat scene objects, whereinthe class objects corresponding to the different bit plane identifiers are independent of one another; and processing combat data generated by each round of combat in each round, and feeding back a processing result to a client corresponding to the corresponding round of combat. According to the embodiment of the invention, players do not need to switch combat scenes and are logically distinguished, and the players (i.e., combat units) in different rounds of combats can be invisible, so that the data serialization process caused by switching the combat scenes is reduced, a large amount of server memory overhead can be reduced, and the memory recovery pressure of a server can be effectively reduced.

Description

technical field [0001] The invention relates to the technical field of game data processing, in particular to a turn-based battle data processing method, device and storage medium. Background technique [0002] In MMO (Massive Multiplayer Online, Massively Multiplayer Online Games) type games, the turn-based battle process generally creates a battle scene first, then cuts all combat units into the battle scene, and then adopts data synchronization, that is, server computing, client The data is processed in the way of playing, and in each big round system, the battle results of the server are calculated once in a big cycle, and then the calculation results are sent to the client together. [0003] Creating a battle scene has two parts of memory overhead, one is the memory overhead of the scene itself, and the other is to cut all players into the scene and serialize all player data. After the battle is over, switch the players back to the original scene and start the battle W...

AI Technical Summary

Problems solved by technology

In addition, the results of each round of battle are calculated once in a large cycle. For a single battle, this processing is no problem, but at a certain moment when the server has a lot of battles going on, the server will have a lot of calculations , For example, in a boss battle, if all players are fighting the boss, multiple battles will be concentrated on the server for one frame calculation. Take 5 players versus 5 players as an example, assuming that a single shot by a player takes 1-10ms , the server 1s corresponds to 30 frames, that is, the calculation of one frame takes 33ms. When the calculation of multiple battles is concentrated in one frame, a relatively high delay will be generated, and in severe cases it will cause the player to freeze

Images