function anonymous(inputs) { const i = inputs || {}; const validDiffs = ['easy', 'medium', 'hard', 'expert']; let difficulty = String(i.difficulty || 'medium').toLowerCase(); if (!validDiffs.includes(difficulty)) difficulty = 'medium'; const rangeMap = { easy: [40, 45], medium: [50, 55], hard: [56, 60], expert: [60, 64] }; const [lo, hi] = rangeMap[difficulty]; const removeCount = lo + Math.floor(Math.random() * (hi - lo + 1)); // Base valid pattern generator const base = 3; const side = base * base; const pattern = (r, c) => (base * (r % base) + Math.floor(r / base) + c) % side; const shuffle = (arr) => { const a = arr.slice(); for (let k = a.length - 1; k > 0; k--) { const j = Math.floor(Math.random() * (k + 1)); [a[k], a[j]] = [a[j], a[k]]; } return a; }; const rBase = [0, 1, 2]; const rows = shuffle(rBase).flatMap(g => shuffle(rBase).map(r => g * base + r)); const cols = shuffle(rBase).flatMap(g => shuffle(rBase).map(c => g * base + c)); const nums = shuffle([1, 2, 3, 4, 5, 6, 7, 8, 9]); const solution = []; for (let r = 0; r < side; r++) { const row = []; for (let c = 0; c < side; c++) { row.push(nums[pattern(rows[r], cols[c])]); } solution.push(row); } // Validate solution (defensive, should always be valid) const validate = (grid) => { for (let r = 0; r < 9; r++) { const seen = new Set(); for (let c = 0; c < 9; c++) seen.add(grid[r][c]); if (seen.size !== 9) return false; } for (let c = 0; c < 9; c++) { const seen = new Set(); for (let r = 0; r < 9; r++) seen.add(grid[r][c]); if (seen.size !== 9) return false; } for (let br = 0; br < 3; br++) { for (let bc = 0; bc < 3; bc++) { const seen = new Set(); for (let r = 0; r < 3; r++) for (let c = 0; c < 3; c++) seen.add(grid[br*3+r][bc*3+c]); if (seen.size !== 9) return false; } } return true; }; if (!validate(solution)) { // fallback deterministic valid grid (should never happen) for (let r = 0; r < side; r++) for (let c = 0; c < side; c++) solution[r][c] = ((r * 3 + Math.floor(r / 3) + c) % 9) + 1; } // Build puzzle by removing cells const puzzle = solution.map(row => row.slice()); const cellIdx = shuffle(Array.from({ length: 81 }, (_, k) => k)); const clamp = Math.max(0, Math.min(64, removeCount)); for (let k = 0; k < clamp; k++) { const idx = cellIdx[k]; const r = Math.floor(idx / 9), c = idx % 9; puzzle[r][c] = 0; } const formatRow = (row) => { const groups = [row.slice(0, 3), row.slice(3, 6), row.slice(6, 9)]; return groups.map(g => g.map(v => v === 0 ? '.' : String(v)).join(' ')).join(' | '); }; const formatSolRow = (row) => { const groups = [row.slice(0, 3), row.slice(3, 6), row.slice(6, 9)]; return groups.map(g => g.map(v => String(v)).join(' ')).join(' | '); }; const out = [`Sudoku Puzzle (${difficulty})`]; for (const row of puzzle) out.push(formatRow(row)); out.push('— Solution —'); for (const row of solution) out.push(formatSolRow(row)); return out; }

Maze Generator vs Sudoku Generator

Maze Generator

Sudoku Generator