worst-card-game / sim /run.ts
freeguy2006's picture
Claude Opus 4.8 (1M context)
線上雙人合作 PvE(地獄大門)+ 手牌進出場動畫 + 連線/單人多項打磨
f4c424d
Raw History Blame Contribute Delete
8.52 kB
/**
* 平衡模擬主程式。用法(在 monorepo 根目錄):
* npx tsx sim/run.ts single 1000
* npx tsx sim/run.ts pvp 1000
* npx tsx sim/run.ts coop 1000
* npx tsx sim/run.ts all 1000
* 第二參數=每格局數(預設 200)。結果存 scratchpad 並印摘要。
*/
import { writeFileSync, mkdirSync } from "node:fs";
import {
runSingle, runPvp, runCoop, BRAINS_FIXED, makeRandomBrain, pct, mean, type Brain,
} from "./lib.js";
import type { ClassType, Campaign } from "../packages/battle-core/src/index.js";
const OUT_DIR = "C:/Users/free2/AppData/Local/Temp/claude/d-------worst-card-game/9b489cce-ac5a-46ab-855b-6ab9030007c0/scratchpad/sim";
mkdirSync(OUT_DIR, { recursive: true });
const mode = process.argv[2] ?? "single";
const N = Number(process.argv[3] ?? 200);
const SEED0 = 0x9e3779b1;
const CLASSES: ClassType[] = ["WARRIOR", "BARBARIAN", "MAGE"];
const CAMPAIGNS: Campaign[] = ["slime", "sanctus"];
const BRAIN_IDS = ["aggro", "defen", "tempo", "rand"] as const;
const BRAIN_LABEL: Record<string, string> = { aggro: "攻擊型", defen: "防禦型", tempo: "節奏型", rand: "隨機" };
function brainFor(id: string, gameSeed: number): Brain {
if (id === "rand") return makeRandomBrain(gameSeed ^ 0x5bd1e995);
return BRAINS_FIXED.find((b) => b.id === id)!;
}
// 每局種子:決定性、依索引變化(不用 Date/Math.random)
function gseed(salt: number, i: number): number { return (SEED0 + salt * 2654435761 + i * 40503) >>> 0; }
// ===================== 單人 =====================
interface SingleAgg {
cls: ClassType; camp: Campaign; brain: string;
n: number; wins: number; winRate: string;
avgLevel: number; maxLevelOf: number; avgTurns: number; avgHpLeft: number;
abortRate: string; avgCasts: number;
}
function runSingleMatrix(): SingleAgg[] {
const rows: SingleAgg[] = [];
let salt = 0;
for (const cls of CLASSES) {
for (const camp of CAMPAIGNS) {
for (const bid of BRAIN_IDS) {
salt++;
let wins = 0, aborts = 0;
const levels: number[] = [], turns: number[] = [], hp: number[] = [], casts: number[] = [];
let maxLevelOf = 0;
for (let i = 0; i < N; i++) {
const seed = gseed(salt, i);
const r = runSingle({ classType: cls, campaign: camp, seed, brain: brainFor(bid, seed) });
if (r.won) wins++;
if (r.aborted) aborts++;
levels.push(r.levelReached); turns.push(r.turns); hp.push(r.hpLeft); casts.push(r.spellCasts);
maxLevelOf = r.maxLevel;
}
rows.push({
cls, camp, brain: bid, n: N, wins, winRate: pct(wins, N),
avgLevel: +mean(levels).toFixed(2), maxLevelOf, avgTurns: +mean(turns).toFixed(1),
avgHpLeft: +mean(hp).toFixed(1), abortRate: pct(aborts, N), avgCasts: +mean(casts).toFixed(1),
});
}
}
}
return rows;
}
function printSingle(rows: SingleAgg[]): void {
console.log("\n========== 單人闖關(每格 " + N + " 局) ==========");
console.log("職業 路線 腦袋 勝率 平均關卡 平均回合 殘血 中止率 平均詠唱");
for (const r of rows) {
console.log(
`${r.cls.padEnd(9)} ${r.camp.padEnd(8)} ${BRAIN_LABEL[r.brain]!.padEnd(3)} ` +
`${r.winRate.padStart(6)} ${String(r.avgLevel).padStart(5)}/${r.maxLevelOf} ${String(r.avgTurns).padStart(6)} ` +
`${String(r.avgHpLeft).padStart(5)} ${r.abortRate.padStart(6)} ${String(r.avgCasts).padStart(7)}`,
);
}
// 每(職業,路線)最佳腦袋
console.log("\n— 各(職業,路線)最佳腦袋勝率 —");
for (const cls of CLASSES) for (const camp of CAMPAIGNS) {
const sub = rows.filter((r) => r.cls === cls && r.camp === camp);
const best = sub.reduce((a, b) => (b.wins > a.wins ? b : a));
console.log(`${cls.padEnd(9)} ${camp.padEnd(8)} → ${BRAIN_LABEL[best.brain]} ${best.winRate}`);
}
}
// ===================== PvP =====================
const PAIRS: [ClassType, ClassType][] = [
["WARRIOR", "WARRIOR"], ["WARRIOR", "BARBARIAN"], ["WARRIOR", "MAGE"],
["BARBARIAN", "BARBARIAN"], ["BARBARIAN", "MAGE"], ["MAGE", "MAGE"],
];
interface PvpAgg {
pair: string; n: number; aWins: number; bWins: number; draws: number;
aRate: string; bRate: string; drawRate: string; avgTurns: number; mageCasts: number;
}
function runPvpMatrix(): PvpAgg[] {
const rows: PvpAgg[] = [];
const brain = BRAINS_FIXED[0]!; // 攻擊型鏡像,隔離職業差異
let salt = 100;
for (const [ca, cb] of PAIRS) {
salt++;
let aWins = 0, bWins = 0, draws = 0; const turns: number[] = []; let mageCasts = 0;
for (let i = 0; i < N; i++) {
const sa = gseed(salt, i), sb = gseed(salt, i + 777);
const r = runPvp({ classA: ca, classB: cb, seedA: sa, seedB: sb, brainA: brain, brainB: brain });
if (r.winner === "A") aWins++; else if (r.winner === "B") bWins++; else draws++;
turns.push(r.turns); mageCasts += r.castsA + r.castsB;
}
rows.push({
pair: `${ca} vs ${cb}`, n: N, aWins, bWins, draws,
aRate: pct(aWins, N), bRate: pct(bWins, N), drawRate: pct(draws, N),
avgTurns: +mean(turns).toFixed(1), mageCasts,
});
}
return rows;
}
function printPvp(rows: PvpAgg[]): void {
console.log("\n========== PvP(攻擊型鏡像,每配對 " + N + " 局) ==========");
console.log("配對 A勝 B勝 平手 平均回合 魔法師總詠唱");
for (const r of rows) {
console.log(
`${r.pair.padEnd(22)} ${r.aRate.padStart(6)} ${r.bRate.padStart(6)} ${r.drawRate.padStart(6)} ` +
`${String(r.avgTurns).padStart(6)} ${String(r.mageCasts).padStart(8)}`,
);
}
console.log("※ 含魔法師之配對:魔法師總詠唱≈0 證實 core 限制(PvP 不推進詠唱序列),數據僅供佐證、非真實平衡。");
}
// ===================== 合作 Boss =====================
const COOP_PAIRS: [ClassType, ClassType][] = [
["WARRIOR", "WARRIOR"], ["WARRIOR", "BARBARIAN"], ["BARBARIAN", "BARBARIAN"],
["WARRIOR", "MAGE"], ["BARBARIAN", "MAGE"], ["MAGE", "MAGE"],
];
interface CoopAgg {
pair: string; n: number; wins: number; winRate: string;
avgRounds: number; avgBossHp: number; abortRate: string; mageCasts: number;
}
function runCoopMatrix(): CoopAgg[] {
const rows: CoopAgg[] = [];
const brain = BRAINS_FIXED[2]!; // 節奏型(較會控血)
let salt = 200;
for (const [ca, cb] of COOP_PAIRS) {
salt++;
let wins = 0, aborts = 0; const rounds: number[] = [], bossHp: number[] = []; let mageCasts = 0;
for (let i = 0; i < N; i++) {
const sa = gseed(salt, i), sb = gseed(salt, i + 555), sboss = gseed(salt, i + 999);
const r = runCoop({ classA: ca, classB: cb, seedA: sa, seedB: sb, seedBoss: sboss, brainA: brain, brainB: brain });
if (r.win) wins++; if (r.aborted) aborts++;
rounds.push(r.rounds); bossHp.push(r.bossHpLeft); mageCasts += r.casts;
}
rows.push({
pair: `${ca}+${cb}`, n: N, wins, winRate: pct(wins, N),
avgRounds: +mean(rounds).toFixed(1), avgBossHp: +mean(bossHp).toFixed(0),
abortRate: pct(aborts, N), mageCasts,
});
}
return rows;
}
function printCoop(rows: CoopAgg[]): void {
console.log("\n========== 合作 Boss【地獄大門】(節奏型,每配對 " + N + " 局) ==========");
console.log("配對 勝率 平均輪數 殘餘BossHP 中止率 魔法師總詠唱");
for (const r of rows) {
console.log(
`${r.pair.padEnd(20)} ${r.winRate.padStart(6)} ${String(r.avgRounds).padStart(6)} ` +
`${String(r.avgBossHp).padStart(7)} ${r.abortRate.padStart(6)} ${String(r.mageCasts).padStart(8)}`,
);
}
console.log("※ 含魔法師之配對同 PvP:詠唱不推進,僅供佐證。Boss 初始 HP=1000、上限 1500。");
}
// ===================== 主流程 =====================
const t0 = Date.now();
const result: any = { mode, N, generatedAtMs: t0 };
if (mode === "single" || mode === "all") { const r = runSingleMatrix(); printSingle(r); result.single = r; }
if (mode === "pvp" || mode === "all") { const r = runPvpMatrix(); printPvp(r); result.pvp = r; }
if (mode === "coop" || mode === "all") { const r = runCoopMatrix(); printCoop(r); result.coop = r; }
const t1 = Date.now();
result.elapsedSec = +((t1 - t0) / 1000).toFixed(1);
writeFileSync(`${OUT_DIR}/result-${mode}-${N}.json`, JSON.stringify(result, null, 2));
console.log(`\n耗時 ${result.elapsedSec}s,已存 ${OUT_DIR}/result-${mode}-${N}.json`);