納西妲 / 菲謝爾 / 北斗 / 楓原萬葉

49,607 DPS

與你的結果計算方式相同(同一敵人、循環重複),使用該循環來源的社群 gcsim 設定中的練度。你自己的練度得分會有所不同。

來源在其自身條件下回報單次循環為 102,445 DPS。

用自己的練度計算

只能載入遊戲內個人資料中「角色展示櫃」裡的角色。請開啟「顯示角色詳情」。

來源

循環腳本(gcsim)
active nahida;
for let i=0; i<4; i=i+1 {
  nahida skill, burst, attack;
  fischl skill, attack;
  beidou skill[counter=1], burst;
  kazuha attack, skill[hold=1], high_plunge, burst, attack;
  fischl attack:2, burst;
  nahida attack:2, skill,
    attack:3, dash,
    attack:3, dash,
    attack:3, dash,
    attack:3, dash,
    attack:2, charge;
  beidou skill, attack:2;
  kazuha skill, high_plunge, attack:2;
}

高命座循環

適用於C2 楓原萬葉, C3 納西妲。計算分數時也會執行這些循環,並取對該配裝最好的一個。

循環腳本(gcsim)
fn rand_delay(mean, stddev) {
  let del = randnorm() * stddev + mean;
  if del > (mean + mean) {
    del = mean + mean;
  }
  delay(del);
}
let prev_char_id = -1;
let prev_action_id = -1;
let _execute_action = execute_action;
fn execute_action(char_id number, action_id number, p map) {
  if prev_char_id != char_id && action_id != .action.swap {
    execute_action(char_id, .action.swap, []);
  }
  if action_id == .action.swap {
    rand_delay(6, 2);
  }
  prev_char_id = char_id;
  prev_action_id = action_id;
  return _execute_action(char_id, action_id, p);
}
active fischl;
for let r = 5; r > 0; r = r - 1 {
  let src = f();
  let counter_chance = rand();
  
  fischl skill, attack;
  
  if !.nahida.mods.instructor-4pc && .nahida.skill.ready {
    nahida skill, attack;
  }
  
  if counter_chance <= 0.1 { 
    beidou skill[counter=2];
  } else if counter_chance <= 0.5 { 
    beidou skill[counter=1];
  } else {
    beidou skill;
  }
  
  beidou burst;
  delay(17); 
  
  kazuha attack, skill, high_plunge, attack, burst, attack;
  fischl attack, aim[hold=0], burst;
  kazuha attack, skill, high_plunge, attack;
  
  while f() - src <= 20.5 * 60 {
    if .fischl.normal > 2 { 
      fischl aim[hold=0];
    } else if !.nahida.mods.instructor-4pc && .nahida.skill.ready && .nahida.swap.ready { 
      nahida skill, attack;
    } else {
      fischl attack;
    }
  }
}
正在計算… 最多可能需要一分鐘。