Changes

142 bytes removed ,  5 years ago
Line 15: Line 15:  
|id = 5-1
 
|id = 5-1
 
|0 -> A/storm, B =  
 
|0 -> A/storm, B =  
* Meet '''ANY''' of the following '''FORCE''' A
+
*Meet '''ANY''' of the following to '''FORCE''' A
** (F)BB(V)+CV(B) 4
+
**(F)BB(V)+CV(B) >= 4
** (F)BB(V)+CV(B/L) 5
+
**(F)BB(V)+CV(B/L) >= 5
* Meet '''ALL''' of the following requirements to go to B:
+
* Meet '''ANY''' of the following requirements to go to B
** Amount of DD ≥ 2
+
**DD ≥ 2 and (F)BB(V)+CV(L/B) ≤ 2
** Amount of (F)BB(V)+CV(L/B) ≤ 2
+
**CA(V) >= 4 and fleet contains CL
** CA(V) 4 '''AND''' fleet contains CL
+
**CA(V) >= 2 and CL = 1
** CA(V) 2 '''AND''' CL = 1
+
*Otherwise, random routing
* Otherwise, random routing.
+
**If fleet contains CA(V) or CV(L/B), you more likely to go to A
** If fleet contains CA(V) or CV(L/B), you more likely to go to A
+
**If fleet contains 3 (F)BB(V), 1 CL and 2 DD, you more likely to go to B
** If fleet contains 3 (F)BB(V), 1 CL and 2 DD, you more likely to go to B
      
|B -> C/resource =  
 
|B -> C/resource =  
 
* Meet '''ALL''' of the following requirements:
 
* Meet '''ALL''' of the following requirements:
 
** No CV(B)
 
** No CV(B)
 +
** Amount of CVL ≤ 1
 
** Amount of (F)BB(V) ≤ 2
 
** Amount of (F)BB(V) ≤ 2
** Amount of CVL ≤ 1
  −
   
|B -> E = * Do not meet the requirements to go to C.
 
|B -> E = * Do not meet the requirements to go to C.
    
|F -> G, H/resource, J =  
 
|F -> G, H/resource, J =  
* Meet ANY of the following to go to G
+
*'''FORCE''' node H if fleet does not contain CL and DDs
** SS(V) 2 ('''Overrides''' J and H node branching)
+
*Meet '''ANY''' of the following to go to G
** DD 1
+
**SS(V) >= 2 ('''Overrides''' J and H node branching)
* Meeting '''ANY''' of the following '''FORCES''' you to H:
+
**DD <= 1
** No DD, CL
+
*Meet '''ANY''' of the following to go to J
** Amount of (F)BB(V)+CVL ≥ 3
+
**DD >= 4
* Meet '''ALL''' of the following requirements to go to J:
+
**'''Fastest''' Fleet
** Fleet contains CL and DD ≥ 2
+
**Fleet contains CL and DD >= 2
** Amount of DD ≥ 4
+
*Random routing if (F)BB(V)+CV(L/B) >= 3 ('''Overrides''' J node branching)
** '''Fastest''' Fleet
+
*Otherwise, random between G and J (If fleet contains DD = 3, you more likely to go to J)
* Otherwise, random routing between G and J (if fleet contains DD = 3, higher chance of routing to J).
  −
* Random routing if (F)BB(V)+CV(L/B) 3 ('''Overrides''' J node branching)
      
|G -> I/empty, J =  
 
|G -> I/empty, J =  
* Meet '''ALL''' of the following requirements to go to J:
+
*Go to I if (F)BB(V)+CV(L/B) >= 5
** Amount of DD ≥ 2
+
* Meet '''ANY''' of the following requirements to go to J
** Fleet contains CL '''OR''' amount of CA(V) ≥ 2
+
** Amount of DD ≥ 2, fleet contains CL, no CV(L/B)
** No CV(B)
+
** Amount of DD ≥ 2, (F)BB(V)+CVL <= 2, no CV(B)
** If fleet contains CVL, amount of (F)BB(V)+CVL 2
   
* Otherwise, random routing.
 
* Otherwise, random routing.
 
}}
 
}}
724

edits