entertainment media

education learning

documentation technical

technology software

government public service

Arabic

The domain 'mysudoko-dpln6vx5vj4q.edgeone.app' uses the application-focused generic top-level domain (.app) and includes subdomain 'mysudoko-dpln6vx5vj4q'. The registrable portion 'edgeone' spans 7 characters containing 4 vowels alongside 3 consonants. Segmentation suggests two words: edge, one. The median word length lands at 3.5 characters. No strong language cues emerged from the frequency lists.

html/95/f0/95f08676-d493-41ed-9d0a-befbb983e506.html.gz

bc0fc098db3d880901f75dc84b9b895574cc6f9050f730165c5037cccd364d4e

viewport

Prudence Malinki

MarkMonitor Inc.

edgeone.app

IRT-SG-ACE

ACE administrator

ACE-SG


/* =========================================================
   1) محرّك توليد السودوكو (نفس منطق الأداة التفاعلية)
   ========================================================= */
const idx = (r, c) => r * 9 + c;

function isValidPlacement(board, r, c, val) {
  for (let i = 0; i < 9; i++) {
    if (board[idx(r, i)] === val) return false;
    if (board[idx(i, c)] === val) return false;
  }
  const br = Math.floor(r / 3) * 3;
  const bc = Math.floor(c / 3) * 3;
  for (let i = 0; i < 3; i++)
    for (let j = 0; j < 3; j++)
      if (board[idx(br + i, bc + j)] === val) return false;
  return true;
}

function shuffle(arr) {
  for (let i = arr.length - 1; i > 0; i--) {
    const j = Math.floor(Math.random() * (i + 1));
    [arr[i], arr[j]] = [arr[j], arr[i]];
  }
  return arr;
}

function generateFullBoard() {
  const board = new Array(81).fill(0);
  function fill(pos) {
    if (pos === 81) return true;
    const r = Math.floor(pos / 9), c = pos % 9;
    for (const n of shuffle([1,2,3,4,5,6,7,8,9])) {
      if (isValidPlacement(board, r, c, n)) {
        board[idx(r,c)] = n;
        if (fill(pos + 1)) return true;
        board[idx(r,c)] = 0;
      }
    }
    return false;
  }
  fill(0);
  return board;
}

function countSolutions(board, limit) {
  let count = 0;
  function findBestCell() {
    let best = -1, bestOptions = null;
    for (let p = 0; p < 81; p++) {
      if (board[p] !== 0) continue;
      const r = Math.floor(p/9), c = p%9;
      const options = [];
      for (let n = 1; n <= 9; n++) if (isValidPlacement(board, r, c, n)) options.push(n);
      if (options.length === 0) return { p:-1, options:[] };
      if (best === -1 || options.length < bestOptions.length) {
        best = p; bestOptions = options;
        if (options.length === 1) break;
      }
    }
    return { p: best, options: bestOptions || [] };
  }
  function solve() {
    if (count >= limit) return;
    const { p, options } = findBestCell();
    if (p === -1 && options.length === 0) {
      if (board.every(v => v !== 0)) count++;
      return;
    }
    for (const n of options) {
      board[p] = n;
      solve();
      board[p] = 0;
      if (count >= limit) return;
    }
  }
  solve();
  return count;
}

function createPuzzle(fullBoard, targetRemovals) {
  const puzzle = fullBoard.slice();
  const positions = shuffle([...Array(81).keys()]);
  let removed = 0;
  for (const p of positions) {
    if (removed >= targetRemovals) break;
    const backup = puzzle[p];
    puzzle[p] = 0;
    if (countSolutions(puzzle.slice(), 2) === 1) {
      removed++;
    } else {
      puzzle[p] = backup;
    }
  }
  return puzzle;
}

// عدد الخلايا المراد إخفاؤها لكل مستوى (مُعدَّل لإنتاج 100 لغز بسرعة معقولة)
const DIFFICULTY_SETTINGS = {
  easy:   { removals: 32, label: "سهل" },
  medium: { removals: 40, label: "متوسط" },
  hard:   { removals: 46, label: "صعب" },
  expert: { removals: 52, label: "خبير" }
};
const MIXED_ORDER = ["easy", "easy", "medium", "medium", "hard", "expert"];


/* =========================================================
   2) رسم شبكة سودوكو واحدة (HTML)
   ========================================================= */
function buildGridHTML(board, isSolution) {
  let html = '<div class="sudoku-grid">';
  for (let r = 0; r < 9; r++) {
    for (let c = 0; c < 9; c++) {
      const v = board[idx(r,c)];
      let cls = 'sgcell';
      if (c % 3 === 2 && c !== 8) cls += ' border-right';
      if (r % 3 === 2 && r !== 8) cls += ' border-bottom';
      if (isSolution) cls += ' solution-num';
      html += `<div class="${cls}">${v === 0 ? '' : v}</div>`;
    }
  }
  html += '</div>';
  return html;
}

function buildPuzzleCardHTML(num, levelLabel, board, isSolution) {
  return `
    <div class="puzzle-card">
      <div class="puzzle-head">
        <span class="pnum">${isSolution ? 'حل اللغز' : 'لغز'} #${num}</span>
        <span class="plevel">${levelLabel}</span>
      </div>
      ${buildGridHTML(board, isSolution)}
    </div>`;
}

function buildPageHTML(title, cardsHTML, pageNum, totalPages) {
  return `
    <div class="print-page">
      <div class="page-title">${title}</div>
      <div class="puzzle-grid-2x2">${cardsHTML}</div>
      <div class="page-footer">صفحة ${pageNum} من ${totalPages}</div>
    </div>`;
}


/* =========================================================
   3) التوليد الكامل (100 لغز، بشكل غير متزامن لتفادي تجميد الصفحة)
   ========================================================= */
const TOTAL_PUZZLES = 100;
const PER_PAGE = 4;

const sheetsEl = document.getElementById('sheets');
const generateBtn = document.getElementById('generateBtn');
const printBtn = document.getElementById('printBtn');
const difficultySelect = document.getElementById('difficulty');
const includeSolutions = document.getElementById('includeSolutions');
const progressWrap = document.getElementById('progressWrap');
const progressFill = document.getElementById('progressFill');
const progressText = document.getElementById('progressText');

async function generateBooklet() {
  generateBtn.disabled = true;
  printBtn.disabled = true;
  progressWrap.style.display = 'block';
  sheetsEl.innerHTML = '';

  const diffMode = difficultySelect.value;
  const puzzles = [];   // { board, solution, level }

  for (let i = 0; i < TOTAL_PUZZLES; i++) {
    const level = diffMode === 'mixed'
      ? MIXED_ORDER[Math.floor(Math.random() * MIXED_ORDER.length)]
      : diffMode;
    const settings = DIFFICULTY_SETTINGS[level];

    const solution = generateFullBoard();
    const board = createPuzzle(solution, settings.removals);
    puzzles.push({ board, solution, level: settings.label });

    // تحديث شريط التقدم وإراحة المتصفح كل لغز
    progressFill.style.width = `${((i+1) / TOTAL_PUZZLES) * 50}%`;
    progressText.textContent = `توليد الألغاز: ${i+1} / ${TOTAL_PUZZLES}`;
    if (i % 2 === 1) await new Promise(r => setTimeout(r, 0));
  }

  // ---- بناء صفحات الألغاز ----
  const puzzlePagesCount = Math.ceil(TOTAL_PUZZLES / PER_PAGE);
  const solutionPagesCount = includeSolutions.checked ? puzzlePagesCount : 0;
  const totalPages = puzzlePagesCount + solutionPagesCount;

  let html = '';
  html += '<div class="section-divider">— الألغاز —</div>';
  for (let page = 0; page < puzzlePagesCount; page++) {
    let cards = '';
    for (let k = 0; k < PER_PAGE; k++) {
      const i = page * PER_PAGE + k;
      if (i >= TOTAL_PUZZLES) break;
      cards += buildPuzzleCardHTML(i + 1, puzzles[i].level, puzzles[i].board, false);
    }
    html += buildPageHTML(`تمارين سودوكو — صفحة ${page + 1}`, cards, page + 1, totalPages);

    progressFill.style.width = `${50 + ((page+1)/puzzlePagesCount)*25}%`;
    progressText.textContent = `بناء صفحات الألغاز: ${page+1} / ${puzzlePagesCount}`;
    if (page % 3 === 2) await new Promise(r => setTimeout(r, 0));
  }

  // ---- بناء صفحات الحلول ----
  if (includeSolutions.checked) {
    html += '<div class="section-divider">— الحلول —</div>';
    for (let page = 0; page < puzzlePagesCount; page++) {
      let cards = '';
      for (let k = 0; k < PER_PAGE; k++) {
        const i = page * PER_PAGE + k;
        if (i >= TOTAL_PUZZLES) break;
        cards += buildPuzzleCardHTML(i + 1, puzzles[i].level, puzzles[i].solution, true);
      }
      html += buildPageHTML(`الحلول — صفحة ${page + 1}`, cards, puzzlePagesCount + page + 1, totalPages);

      progressFill.style.width = `${75 + ((page+1)/puzzlePagesCount)*25}%`;
      progressText.textContent = `بناء صفحات الحلول: ${page+1} / ${puzzlePagesCount}`;
      if (page % 3 === 2) await new Promise(r => setTimeout(r, 0));
    }
  }

  sheetsEl.innerHTML = html;
  progressFill.style.width = '100%';
  progressText.textContent = `تم! ${TOTAL_PUZZLES} لغز جاهز عبر ${totalPages} صفحة.`;

  setTimeout(() => {
    progressWrap.style.display = 'none';
    generateBtn.disabled = false;
    printBtn.disabled = false;
  }, 600);
}

generateBtn.addEventListener('click', generateBooklet);
printBtn.addEventListener('click', () => window.print());


كتيب 100 لغز سودوكو — للطباعة

✅ Low Risk - https://mysudoko-dpln6vx5vj4q.edgeone.app/

Requests	IP Address	Location	AS Autonomous System
2	101.33.10.10	Frankfurt am Main, Hesse, Germany	AS139341ACE
2	1	-	-

Security Scan Report: mysudoko-dpln6vx5vj4q.edgeone.app

Summary

AI Security Verdict

Low Risk

Risk Factors

Safety Factors

Details

Screenshot

Page Load Overview

Language Analysis

Primary Language

Detection Details

Website Classification

Primary Category

All Detected Categories

Detected Features

Domain & IP Information

Content Similarity HashesFor malware variant detection

TLSH (Trend Micro Locality Sensitive Hash)

ssdeep (Context Triggered Piecewise Hashing)

sdhash (Similarity Digest Hashing)

Image Hashes

Perceptual Hashes

Other Hashes

Scan History