From 3ef80e9ba7f1e4703aac94ddae874b97a6649165 Mon Sep 17 00:00:00 2001
From: Ivor Barhansky <lopar@noreply.lopar.us>
Date: Fri, 18 Feb 2022 13:06:57 +0000
Subject: [PATCH] =?UTF-8?q?=D0=98=D0=B7=D0=BC=D0=B5=D0=BD=D0=B8=D0=BB(?=
 =?UTF-8?q?=D0=B0)=20=D0=BD=D0=B0=20'=D0=A1=D1=82=D0=B0=D1=80=D1=8B=D0=B5?=
 =?UTF-8?q?=20=D0=BD=D0=B0=D0=B1=D1=80=D0=BE=D1=81=D0=BA=D0=B8=20=D0=BF?=
 =?UTF-8?q?=D0=BE=D0=B5=D0=B4=D0=B8=D0=BD=D0=BA=D0=BE=D0=B2'?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...%BF%D0%BE%D0%B5%D0%B4%D0%B8%D0%BD%D0%BA%D0%BE%D0%B2.md | 8 --------
 1 file changed, 8 deletions(-)

diff --git a/%D0%A1%D1%82%D0%B0%D1%80%D1%8B%D0%B5-%D0%BD%D0%B0%D0%B1%D1%80%D0%BE%D1%81%D0%BA%D0%B8-%D0%BF%D0%BE%D0%B5%D0%B4%D0%B8%D0%BD%D0%BA%D0%BE%D0%B2.md b/%D0%A1%D1%82%D0%B0%D1%80%D1%8B%D0%B5-%D0%BD%D0%B0%D0%B1%D1%80%D0%BE%D1%81%D0%BA%D0%B8-%D0%BF%D0%BE%D0%B5%D0%B4%D0%B8%D0%BD%D0%BA%D0%BE%D0%B2.md
index adcfc7b..ede9271 100644
--- a/%D0%A1%D1%82%D0%B0%D1%80%D1%8B%D0%B5-%D0%BD%D0%B0%D0%B1%D1%80%D0%BE%D1%81%D0%BA%D0%B8-%D0%BF%D0%BE%D0%B5%D0%B4%D0%B8%D0%BD%D0%BA%D0%BE%D0%B2.md
+++ b/%D0%A1%D1%82%D0%B0%D1%80%D1%8B%D0%B5-%D0%BD%D0%B0%D0%B1%D1%80%D0%BE%D1%81%D0%BA%D0%B8-%D0%BF%D0%BE%D0%B5%D0%B4%D0%B8%D0%BD%D0%BA%D0%BE%D0%B2.md
@@ -39,14 +39,6 @@ if ($comb_act == "magic_attack") {
 } 
 ```
 
-Рассчет рандомного врага с верхней планкой крутизны
-1. статы по единице
-2. свободные статы = число1
-3. `рандом_статM(0,N);` свободные статы = свободные статы - рандом_статM
-4. если свободные статы !=0 то `рандом_статM+1(0,N); свободные статы = свободные статы - рандом_статM+1`
-
-повторять один раз на все статы.
-
 ## Немного про интуицию
 Everyone takes turn to attack, following a priority queue system. Each unit has a ''priority'' number and a ''speed'' factor that decides when their next turn will be. The idea is each one will have a priority number. Each attack bumps up the attacker’s priority number to the max and every cycle(meaning every attack scene we perform) we decrease each unit’s priority number with their speed. The unit with the lowest number attacks next. We will use a priority queue to store these information.