function shuffle(a){for(let i=a.length-1;i>0;i--){const j=Math.floor(Math.random()*(i+1));[a[i],a[j]]=[a[j],a[i]]}return a} function topology(n,regions){ const peers=Array.from({length:n*n},(_,i)=>{const s=new Set();for(let j=0;jregions.filter(x=>x===r).length);return {peers,sizes}; } function solve(values,t,limit=2,budget=80000,random=false){let count=0,solution=null,nodes=0,aborted=false;const a=[...values]; function visit(){if(++nodes>budget){aborted=true;return}let best=-1,opts=[];for(let i=0;ia[j]===v))o.push(v);if(!o.length)return;if(best<0||o.length=limit||aborted)return}} for(let i=0;it.sizes[i]||t.peers[i].some(j=>a[j]===a[i])))return {count:0,solution:null,aborted:false};visit();return {count,solution,aborted};} function generate(n,level){ let regions,t,result; for(let attempt=0;attempt<500;attempt++){ // Randomize a Hamiltonian walk with endpoint reconnections, then partition it. // Every region stays connected, with no isolated single-cell leftovers. let path=Array.from({length:n*n},(_,i)=>Math.floor(i/n)*n+(Math.floor(i/n)%2?n-1-i%n:i%n)); for(let k=0;kj>=0&&j1)path=[...path.slice(0,at).reverse(),...path.slice(at)]} const chunks=shuffle([...Array(4).fill(4),...Array((n*n-16)/5).fill(5)]);regions=Array(n*n).fill(-1);let offset=0;chunks.forEach((size,r)=>{for(const i of path.slice(offset,offset+size))regions[i]=r;offset+=size}); t=topology(n,regions);result=solve(Array(n*n).fill(0),t,1,18000,true);if(result.count&&!result.aborted)break; } if(!result?.solution)throw Error('Please try generating again.'); const solution=result.solution,givens=[...solution];const target=Math.floor(n*n*(.64-level*.046)); for(const i of shuffle([...givens.keys()])){if(givens.filter(Boolean).length<=target)break;givens[i]=0;const check=solve(givens,t,2,25000);if(check.count!==1||check.aborted)givens[i]=solution[i]} return {id:globalThis.crypto?.randomUUID?.()||Date.now().toString(36)+Math.random().toString(36).slice(2),n,level,regions,solution,givens}; }

6 × 6 LEVEL 1