Method and device for quickly completing monster fighting game task and server
A server and game technology, applied in the field of mobile games, can solve the problems of difficulty in upgrading operations to quickly complete game tasks and time-consuming, and achieve the effect of ensuring simplicity, ensuring accuracy, and avoiding computational redundancy.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0046] see figure 1 As shown, it is a flow chart of a method for quickly completing the game task of killing monsters provided by this embodiment. Specifically, the game including the task of fighting monsters is installed in a mobile terminal, and the mobile terminal is a smartphone such as a smart phone, an IPAD, or a notebook computer. For electronic equipment, the method is applied to a server, and includes the following steps:
[0047] In response to the game task start request sent by the mobile terminal, obtain the level data of the current game role;
[0048] As a possible implementation, the level data of the current game character should at least include the current level and the energy used for upgrading; if the current character level is 25, the energy required to upgrade from level 25 to level 26 is 25000 energy, based on this Execute the subsequent judgment, that is, the calculation step.
[0049] Judging whether the game character meets the upgrade conditions:...
Embodiment approach 1
[0065] Preferred Embodiment 1: When t1
[0066] In this embodiment:
[0067] Take N=5, and the completion times of five similar game tasks are 20min, 24min, 30min, 26min, and 20min; based on this, t1=(20+24+30+26+20) / 5=24min is obtained.
[0068] Suppose the number of game upgrades is 1, the preset time for upgrading between adjacent levels is 1min, and the preset time for performing the upgrade operation is t6=15s; then obtain t5=1*1=1min; t3=t5+t6=75s;
[0069] Suppose the current character level is 25, then t4=24-(25 / 24)*1≈23min;
[0070] To sum up, t2=t3+t4=24min15s; t2>t1, that is, the game task is executed quickly according to the game character level of 24.
Embodiment approach 2
[0071] Preferred Embodiment 2: When t1>t2, the game is paused, the upgrade of the game character is automatically performed, and the game task is performed at the upgraded level when the upgrade is completed.
[0072] In this embodiment:
[0073] Take N=5, and the completion times of five similar game tasks are 20min, 24min, 30min, 26min, and 20min; based on this, t1=(20+24+30+26+20) / 5=24min is obtained.
[0074] Suppose the number of game upgrades is 3, the preset time for upgrading between adjacent levels is 1min, and the preset time for performing the upgrade operation is t6=15s; then get t5=3*1=3min; t3=t5+t6=3min15s;
[0075] Suppose the current character level is 25, then t4=24-(25 / 24)*3≈21min;
[0076] To sum up, t2=t3+t4=24min15s; t2
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com