当前位置:网站首页>[JS] battle chess
[JS] battle chess
2022-06-13 00:47:00 【KatyLight】
Recently I wrote a very tired thing .
plan :

This is the map ,
There are special rooms on each map , such as :
Battle room , Random rooms and store rooms , Store rooms have specific item pools , Repeatedly entering the store will not refresh the raffle items , I haven't designed this yet . Random rooms are random events , It hasn't been written yet .
Different rooms have different environmental systems , It is different in different environmental systems 【 Main attribute 】 more 【 attribute 】 The damage will be increased or decreased differently .

Switch to the warehouse page , This is the equipment setting of the chess pieces , Dragging can be used to install items to chess pieces , And modify the properties . You can take off your equipment , Some equipment has special effects, such as avoid death once and disappear. It has not been written yet , The item's own skill can be added to the candidate , If you unload this item , Additional skills will disappear .

Item synthesis system , If no synthesis list recipe is triggered , Then you will mix things up , Can sort . Drag it to the workbench .


The combat system only has basic skills released ,
AI Only attack but no other operation .
First hand is more about speed , Speed will also win extra rounds or suppress the opponent. You can only play once after you have spent a few rounds .
The formula looks like this ,
High speed is preferred , If the same player has priority , Priority will calculate the speed difference , The speed difference of each round will be added to the sum of the speed differences , When the sum of speed difference is higher than or equal to the speed of the weak party, you will immediately gain an additional round and clear the speed difference , After this extra round, the next round is still the party with high speed . If you die midway, you need to switch pieces ( I haven't written yet ) Will recalculate .
If the advantage is too great , Like speed 1000 And speed 200, So speed 1000-200=800, And this 800 You need speed 200 Give way to speed 1000 Of 4 The number of rounds can catch up .
There is a prompt in the message window , The following battle information is refreshed , Whenever the switcher is more injured , It will refresh .

Have been to the room , Will darken , The route that has been passed will turn into transparent cyan , Then the current floor is dotted , You cannot skip layers , When the map is finished , Will go to the next map , The setting is that too many floors will scroll , Not yet . The difficulty of the map will only become more and more difficult , Not yet , There's only one map .
AI I plan to set a higher level , For example, what is the division of labor , What are the outputs , Self explosion, etc .
The pieces named by these constellations are intended to be sorted by uniform variables .

Using skills will consume action , And the damage is related to physical attack or special attack .
The formula is : Real injury =( Victim armor - Basic damage * Attribute relationship )*15.
Basic damage = An attacker attacks * Skill parameters ( Usually it is 1)
For example, the skill wave is double the normal damage , So the basic damage is a physical attack *1


You can switch chess pieces in battle , It will glow when selected , After you successfully switch in your turn , Will turn blue , The opponent's team is on the right , The chess pieces currently playing are also green .

https://gitee.com/KatyLight/chess
https://gitee.com/KatyLight/chess
边栏推荐
- How many steps are appropriate for each cycle of deep learning?
- 什么是 Meebits?一个简短的解释
- 浏览器控制台注入JS
- Zhouchuankai, Bank of Tianjin: from 0 to 1, my experience in implementing distributed databases
- Kali system -- fierce of DNS collection and analysis
- OceanBase 雄踞墨天轮2021年度中国数据库魔力象限领导者
- 磁盘分区方式对比(MBR与GPT)
- (01). Net Maui actual construction project
- STM32 USB Basics
- Maybe we can figure out the essence of the Internet after the dust falls
猜你喜欢

Another year 1024, happy programmer's Day!

磁盘分区方式对比(MBR与GPT)

1. Google grpc framework source code analysis Hello World

(01).NET MAUI实战 建项目

In / out / inout details of MySQL stored procedures

Kotlin coroutine suspend function suspend keyword

Aof persistence

牌好不好无法预料

Maybe we can figure out the essence of the Internet after the dust falls
![BUUCTF之BabyUpload[GXYCTF2019]](/img/e8/202298b64d8764355fad348b50fee6.png)
BUUCTF之BabyUpload[GXYCTF2019]
随机推荐
【服务器数据恢复】存储服务器之间迁移数据时数据丢失恢复成功案例
Build your own PE manually from winpe of ADK
Set sail
浏览器控制台注入JS
What is the difference between pytorch and tensorflow?
Buuctf's babysql[geek challenge 2019]
Kotlin 协程,job的生命周期
Notes: the 11th and 12th generation mobile versions of Intel support the native thunderbolt4 interface, but the desktop version does not
Androi weather
OceanBase 雄踞墨天轮2021年度中国数据库魔力象限领导者
Zhouchuankai, Bank of Tianjin: from 0 to 1, my experience in implementing distributed databases
kotlin 协程withContext切换线程
MySQL locates the position of the character in the string String substitution
RCC clock configuration of stm32f401
Can GPU acceleration pytorch work?
Stm32f4 development of DMA transmission to GPIO port
通过抓包下载钉钉直播回放
Map from getting started to performance optimization
Using fastjson to solve the problem of returning an empty array from a null value of a field string object
[North Asia server data recovery] data recovery case of Hyper-V service paralysis caused by virtual machine file loss