import fs from 'node:fs';import path from 'node:path';import {fileURLToPath} from 'node:url';import {constraints,directionNames,violations} from '../rules.mjs'; const root=path.resolve(path.dirname(fileURLToPath(import.meta.url)),'..'),pack=JSON.parse(fs.readFileSync(path.join(root,'levels.json'),'utf8'));const rules=fs.readFileSync(path.join(root,'rules.mjs'),'utf8').replaceAll('export ',''),ui=fs.readFileSync(path.join(root,'ui.mjs'),'utf8').replace(/^import[^\n]+\n/gm,''),css=fs.readFileSync(path.join(root,'style.css'),'utf8'); const audio=fs.readFileSync(path.join(root,'audio.mjs'),'utf8').replaceAll('export ',''); const html=`数字一笔 · 200关评分修订版

数字一笔

评分修订版 · 200关 · 一笔走遍每一格

0 / 200

`; fs.writeFileSync(path.join(root,'index.html'),html); // Offline release has no runtime file dependencies; the return link needs the original folder. fs.writeFileSync(path.join(root,'NumberSwipe-200关DEMO.html'),html);fs.writeFileSync(path.join(root,'NumberSwipe-200关评分修订版.html'),html); let notes=JSON.parse(fs.readFileSync(path.join(root,'design.json'),'utf8'));for(const item of notes){const l=item.level,author=item.author;item.breakdown=constraints(l).map(r=>r.kind==='parity'?`${r.cell} 为第${author.indexOf(r.cell)+1}步，要求${r.value==='odd'?'奇':'偶'}`:r.kind==='direction'?`${r.cell} 必须${directionNames[r.value]}`:r.kind==='wall'?`墙 ${r.edge.join('—')} 封闭该邻接`:r.kind==='door'?`门 ${r.edge.join('—')} 通过前按已走格数切换，通过后保持开启；正确解从第${author.findIndex((id,i)=>i&&r.edge.includes(id)&&r.edge.includes(author[i-1]))}步末端通过`:'每步蓝橙交替');const first=item.witnesses[0];if(first){const fork=first.path.findIndex((id,i)=>id!==author[i]);item.keyFork={step:fork+1,correct:author[fork],tempting:first.path[fork]};item.reason=violations(l,first.path).map(v=>v.message).join('；');}else{item.keyFork={step:0,correct:author[0],tempting:'数字不符的候选路线'};item.reason='基础数字约束';}} fs.writeFileSync(path.join(root,'design.json'),JSON.stringify(notes,null,2)); const md=['# 200关DEMO制作记录','', '200关均已制作具体坐标。目标难度来自策划，实际难度等待试玩；推理任务不因自动唯一性而被视为人解质量已通过。',''];for(const item of notes){const l=item.level;md.push(`## ${l.order} · ${l.title}`, '',`章节：${l.chapterTitle}；节点${l.cells.length}；角色${l.role}；策划目标${l.targetDifficulty}。`, '',`作者解：${item.author.join(' → ')}。`, '',`原规划任务：${item.planningIntent}。`, '',`结构记录：基础排除后的决策点${item.metrics.noImmediateConflictChoices}；最长连续被迫${item.metrics.longestSameDirectionTransfers}次转移。此指标不是人类难度。`, '',...item.breakdown.map(s=>'- '+s), '',...item.witnesses.map(w=>`- 解除 ${w.constraint} 后的完整反例：${w.path.join(' → ')}`),'');}fs.writeFileSync(path.join(root,'DESIGN.md'),md.join('\n')); console.log('Built index.html + standalone DEMO, and author/ablation design record.');