feat: expand campaign and refine puzzle visuals and controls
This commit is contained in:
cabinw
+70
-18
@@ -1,21 +1,73 @@
|
||||
import { generateLevel, analyze, rotateBoard, solveRotations } from '../src/core.js';
|
||||
import { writeFile } from 'node:fs/promises';
|
||||
const names=['转一转，路就通了','换个方向','弯道别碰头','给我让条路','粉色回旋','蓝色小径','向左看齐','第一圈冒险','旋转甜甜圈','差一点擦肩','紫色回廊','再转一次','绕开拥挤','转角遇见光','别挤在一起','糖果交响曲','盘旋之间','左右逢源','小心翼翼','寻找缝隙','回转大挑战','紧密相连','终极转盘','六角大满贯'];
|
||||
const candidates=[];
|
||||
for(let i=0;i<100;i++){
|
||||
const radius=i<25?2:3,target=i<25?5+i%10:16+i%18;
|
||||
const level=rotateBoard(generateLevel(2+i*73,radius,target,.15+(i%10)/12),1+i%3);
|
||||
const solution=solveRotations({...level,moveLimit:999});
|
||||
if(!solution.reachable||!solution.rotations)continue;
|
||||
level.rotationEnabled=true;
|
||||
level.moveLimit=solution.minimumMoves+Math.max(2,Math.round(target*.2));
|
||||
level.requiresRotation=true;
|
||||
const analysis=analyze(level);
|
||||
if(analysis.solvable)candidates.push({level,analysis});
|
||||
import { generateFlowLevel, generateLaneLevel, inspectFlowLevel, CAMPAIGN_PLAN } from '../src/campaign-generator.js';
|
||||
import { validateLevel } from '../src/core.js';
|
||||
|
||||
const beats=['进入','换路','展开','小挑战','释放','长局回报'];
|
||||
const intents=[
|
||||
'开局就有多个可行出口，重新进入观察与消除节奏。',
|
||||
'用一次有明确收益的免费旋转打开出口；每次只处理一个温和变化。',
|
||||
'在熟悉规则中展开路线，提供多次连续成功。',
|
||||
'少量棋子带来一次路线或先后顺序判断，形成组内小高点。',
|
||||
'比上一关明显轻松，增加可并行处理的出口，释放思考压力。',
|
||||
'用较大的棋盘和更多清晰路线收束；增加完成感与体验长度。',
|
||||
];
|
||||
const names=[
|
||||
['一眼看见出口','转一下，就通了','顺着线出发','解开小结','一片畅通','轻松清空大盘'],
|
||||
['熟悉的方向','换条短路','接连找到出口','小小转机','一路放行','铺开好心情'],
|
||||
['找到节奏','转出一条新路','继续向外走','先解哪一枚','宽阔的回报','长路也轻巧'],
|
||||
['慢慢看，都来得及','只换一个方向','连成顺畅的路','轻巧绕一个弯','松一口气','从容的大舞台'],
|
||||
['又是新的出口','看见新的可能','顺路解开','留意这个转角','满盘好走','长长的成就感'],
|
||||
['熟练地出发','一点小变化','接住这个节奏','两条路的相遇','把出口打开','顺畅走到最后'],
|
||||
['从容观察','换个角度看','一枚接着一枚','给路线松个结','轻轻一扫','大盘小心思'],
|
||||
['自在出发','最后一个新转角','熟悉的长路','小结轻解','收获一片畅通','自在回响'],
|
||||
];
|
||||
// Selected deterministic candidates preserve pacing; never difficulty-sort.
|
||||
const turnSeeds=[324,541,45,2034,4684,7089,7104,7672];
|
||||
const challengeSeeds=[104,1161,3171,3422,3980,2908,1017,6269];
|
||||
const turnCandidate=seed=>generateFlowLevel(seed,{radius:2,target:4+seed%9,bendRate:.25+(seed%7)*.1,startRotation:1+seed%5,maxTurns:5});
|
||||
|
||||
function pickLanes(chapter,target,salt){
|
||||
const radius=target>20?4:3;
|
||||
for(let attempt=0;attempt<100;attempt++){
|
||||
const l=generateLaneLevel(42000+chapter*199+salt*13+attempt,{radius,target}),q=inspectFlowLevel(l);
|
||||
if(l.tiles.length===target&&q.analysis.score<=27&&q.analysis.free>=Math.min(8,Math.ceil(target*.3))&&q.hiddenBlockerStates===0)return l;
|
||||
}
|
||||
throw new Error(`No clear lane level for chapter ${chapter+1}, target ${target}`);
|
||||
}
|
||||
function pickFlow(chapter){
|
||||
const [seed,target,bendRate]=[[100777,14,.10],[107993,16,.14],[115912,16,.14],[123868,18,.18],[131787,18,.18],[140076,20,.10],[140010,20,.15],[150011,20,.18]][chapter];
|
||||
const l=generateFlowLevel(seed,{radius:4,target,bendRate,maxTurns:3,clearBlockers:true}),q=inspectFlowLevel(l),a=q.analysis;
|
||||
if(l.tiles.length!==target||!a.solvable||a.score>30||a.freeRatio<.3||a.meanTurns<=0||a.meanTurns>1||q.hiddenBlockerStates||q.lowChoiceStates)throw new Error(`Flowing level no longer meets its pacing gate: chapter ${chapter+1}`);
|
||||
return l;
|
||||
}
|
||||
|
||||
const levels=[],report=[];
|
||||
for(let chapter=0;chapter<CAMPAIGN_PLAN.chapters.length;chapter++){
|
||||
const block=[
|
||||
chapter===0?generateFlowLevel(3,{radius:3,target:12,bendRate:0,allFree:true}):pickLanes(chapter,12+chapter*2,0),
|
||||
turnCandidate(turnSeeds[chapter]),
|
||||
pickFlow(chapter),
|
||||
turnCandidate(challengeSeeds[chapter]),
|
||||
pickLanes(chapter,[16,18,22,24,26,28,28,30][chapter],4),
|
||||
pickLanes(chapter,[18,20,24,26,28,30,32,33][chapter],5),
|
||||
];
|
||||
for(let beat=0;beat<block.length;beat++){
|
||||
const index=levels.length,level={...block[beat],id:`observe-v3-${String(index+1).padStart(2,'0')}`,name:names[chapter][beat],chapter:chapter+1,chapterName:CAMPAIGN_PLAN.chapters[chapter],beat:beats[beat],designIntent:intents[beat]};
|
||||
const q=inspectFlowLevel(level),a=q.analysis,errors=validateLevel(level);
|
||||
if(errors.length||!a.solvable||a.exhausted||!q.won||q.independentLoops||q.hiddenBlockerStates||q.maxDryRotations>1||q.maxUnlockDistance>1)throw new Error(`Campaign gate failed: ${level.name} ${JSON.stringify({errors,q})}`);
|
||||
if(a.free<2)throw new Error(`Not enough opening choices: ${level.name}`);
|
||||
level.requiresRotation=a.rotations>0;
|
||||
level.pacing={cognitiveDifficulty:a.score,removals:level.tiles.length,estimatedSeconds:a.workload.estimatedSeconds,estimateKind:'structural-heuristic-not-playtest',maxProgressGapRotations:q.maxDryRotations};
|
||||
levels.push(level);
|
||||
report.push({level:index+1,name:level.name,chapter:chapter+1,beat:beats[beat],cells:level.cells.length,tiles:level.tiles.length,difficulty:a.score,free:a.free,freeRatio:Number(a.freeRatio.toFixed(3)),meanTurns:Number(a.meanTurns.toFixed(3)),maxTurns:a.maxTurns,dependencyRatio:Number(a.dependencyRatio.toFixed(3)),necessaryRotations:a.rotations,estimatedSeconds:a.workload.estimatedSeconds,independentLoops:q.independentLoops,solutionHiddenBlockers:q.hiddenBlockerStates,maxProgressGapRotations:q.maxDryRotations,lowChoiceStates:q.lowChoiceStates,actions:a.actions,openingAndSolutionStates:q.samples});
|
||||
}
|
||||
const rows=report.slice(chapter*6,chapter*6+6);
|
||||
if(rows[4].difficulty>rows[3].difficulty-12||rows[5].difficulty>rows[3].difficulty-10||rows[5].tiles<rows[3].tiles||rows[5].estimatedSeconds<=rows[3].estimatedSeconds)throw new Error(`Missing challenge/release rhythm in chapter ${chapter+1}`);
|
||||
console.log(`${chapter+1}. ${CAMPAIGN_PLAN.chapters[chapter]}: difficulty ${rows.map(r=>r.difficulty).join(' → ')}; tiles ${rows.map(r=>r.tiles).join('/')}`);
|
||||
}
|
||||
candidates.sort((a,b)=>a.analysis.score-b.analysis.score);
|
||||
if(candidates.length<24)throw new Error('Not enough verified rotation puzzles');
|
||||
const levels=names.map((name,i)=>({...candidates[Math.round(i*(candidates.length-1)/23)].level,id:`turn-level-${i+1}`,name}));
|
||||
await writeFile(new URL('../levels/campaign.json',import.meta.url),JSON.stringify(levels,null,2)+'\n');
|
||||
await writeFile(new URL('../src/levels.js',import.meta.url),'// Generated by npm run levels. Rotation + swept collision campaign.\nexport const LEVELS = '+JSON.stringify(levels)+';\n');
|
||||
console.log(levels.map((l,i)=>{const a=analyze(l);return `${i+1}. ${l.name} ${l.tiles.length} tiles ${a.score}/100 min ${a.rotations} turns (${a.minimumMoves} moves)`;}).join('\n'));
|
||||
await writeFile(new URL('../src/levels.js',import.meta.url),'// Generated by npm run levels. Free observation, spiral pacing; do not difficulty-sort.\nexport const CAMPAIGN = '+JSON.stringify(CAMPAIGN_PLAN)+';\nexport const LEVELS = '+JSON.stringify(levels)+';\n');
|
||||
await writeFile(new URL('../levels/campaign-analysis.json',import.meta.url),JSON.stringify({campaign:CAMPAIGN_PLAN,estimateNote:'Time values are structural heuristics, not measured player completion times.',levels:report},null,2)+'\n');
|
||||
const md='# 主线关卡验收与节奏表\n\n自动生成：`npm run levels`。共 48 关，8 章，每章顺序为进入、换路、展开、小挑战、释放、长局回报。认知难度与棋盘规模分别记录。\n\n全部关卡：可解且回放通关；每枚棋子在全部六朝向独立路线无闭环；参考解答无路线格外擦碰阻挡；相邻消除之间最多连续旋转一次。参考解答检查不等于穷尽玩家的任意旋转顺序，实际阻挡对象会在游戏中标记。\n\n**预计时长只用于内部比较，没有真人测试数据。** 公式为 3 × 棋子数 + 0.75 × 初始独立路线总转弯 + 4 × 最少旋转。所有时间均为估计秒数，不能当作通关时限。\n\n| 关 | 名称 | 节奏 | 格数 | 棋子 | 认知难度 | 开局可解 | 必要旋转 | 预计秒数 |\n|---|---|---|---:|---:|---:|---:|---:|---:|\n'+report.map(r=>`| ${r.level} | ${r.name} | ${r.beat} | ${r.cells} | ${r.tiles} | ${r.difficulty} | ${r.free} | ${r.necessaryRotations} | ${r.estimatedSeconds} |`).join('\n')+'\n';
|
||||
await writeFile(new URL('../docs/campaign-review.md',import.meta.url),md);
|
||||
console.log('48 levels pass all publishing gates. Campaign, shared module and pacing report synchronized.');
|
||||
|
||||
Reference in New Issue
Block a user