@js-gamifications/word-search-core 1.0.1

package/README.md

@@ -0,0 +1,22 @@
+# @js-gamifications/word-search-core
+
+Framework-agnostic engine for generating word search puzzles.
+
+## Install
+
+```bash
+npm i @js-gamifications/word-search-core
+```
+
+## Usage
+
+```ts
+import { createWordSearch } from "@js-gamifications/word-search-core";
+
+const puzzle = createWordSearch({
+  rows: 12,
+  cols: 12,
+  words: ["react", "angular", "typescript"],
+  allowDiagonal: true
+});
+```

package/dist/index.d.mts

@@ -0,0 +1,23 @@
+interface WordPlacement {
+    word: string;
+    startRow: number;
+    startCol: number;
+    deltaRow: number;
+    deltaCol: number;
+}
+interface WordSearchOptions {
+    rows: number;
+    cols: number;
+    words: string[];
+    alphabet?: string;
+    allowDiagonal?: boolean;
+    maxPlacementAttempts?: number;
+}
+interface WordSearchPuzzle {
+    grid: string[][];
+    placements: WordPlacement[];
+}
+
+declare function createWordSearch(options: WordSearchOptions): WordSearchPuzzle;
+
+export { type WordPlacement, type WordSearchOptions, type WordSearchPuzzle, createWordSearch };

package/dist/index.d.ts

@@ -0,0 +1,23 @@
+interface WordPlacement {
+    word: string;
+    startRow: number;
+    startCol: number;
+    deltaRow: number;
+    deltaCol: number;
+}
+interface WordSearchOptions {
+    rows: number;
+    cols: number;
+    words: string[];
+    alphabet?: string;
+    allowDiagonal?: boolean;
+    maxPlacementAttempts?: number;
+}
+interface WordSearchPuzzle {
+    grid: string[][];
+    placements: WordPlacement[];
+}
+
+declare function createWordSearch(options: WordSearchOptions): WordSearchPuzzle;
+
+export { type WordPlacement, type WordSearchOptions, type WordSearchPuzzle, createWordSearch };

package/dist/index.js

@@ -0,0 +1,155 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/index.ts
+var index_exports = {};
+__export(index_exports, {
+  createWordSearch: () => createWordSearch
+});
+module.exports = __toCommonJS(index_exports);
+
+// src/wordSearch.ts
+var DEFAULT_ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+function normalizeWord(word) {
+  return word.trim().toUpperCase().replace(/\s+/g, "");
+}
+function createDirections(allowDiagonal) {
+  const base = [
+    [0, 1],
+    [1, 0],
+    [0, -1],
+    [-1, 0]
+  ];
+  if (!allowDiagonal) {
+    return base;
+  }
+  return [
+    ...base,
+    [1, 1],
+    [1, -1],
+    [-1, 1],
+    [-1, -1]
+  ];
+}
+function randomInt(max) {
+  return Math.floor(Math.random() * max);
+}
+function inBounds(row, col, rows, cols) {
+  return row >= 0 && row < rows && col >= 0 && col < cols;
+}
+function canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol) {
+  const firstRow = grid[0];
+  if (!firstRow) {
+    return false;
+  }
+  for (let i = 0; i < word.length; i += 1) {
+    const row = startRow + i * deltaRow;
+    const col = startCol + i * deltaCol;
+    if (!inBounds(row, col, grid.length, firstRow.length)) {
+      return false;
+    }
+    const rowCells = grid[row];
+    const existing = rowCells?.[col];
+    const char = word[i];
+    if (!rowCells || existing === void 0 || char === void 0) {
+      return false;
+    }
+    if (existing !== "" && existing !== char) {
+      return false;
+    }
+  }
+  return true;
+}
+function placeWord(grid, word, startRow, startCol, deltaRow, deltaCol) {
+  for (let i = 0; i < word.length; i += 1) {
+    const row = startRow + i * deltaRow;
+    const col = startCol + i * deltaCol;
+    const rowCells = grid[row];
+    const char = word[i];
+    if (!rowCells || char === void 0) {
+      throw new Error("Invalid word placement coordinates");
+    }
+    rowCells[col] = char;
+  }
+}
+function fillEmptyCells(grid, alphabet) {
+  const chars = alphabet.split("");
+  for (let row = 0; row < grid.length; row += 1) {
+    const rowCells = grid[row];
+    if (!rowCells) {
+      continue;
+    }
+    for (let col = 0; col < rowCells.length; col += 1) {
+      if (rowCells[col] === "") {
+        const nextChar = chars[randomInt(chars.length)];
+        rowCells[col] = nextChar ?? chars[0] ?? "A";
+      }
+    }
+  }
+}
+function createWordSearch(options) {
+  const rows = options.rows;
+  const cols = options.cols;
+  const alphabet = options.alphabet ?? DEFAULT_ALPHABET;
+  const allowDiagonal = options.allowDiagonal ?? true;
+  const maxPlacementAttempts = options.maxPlacementAttempts ?? 250;
+  if (rows <= 0 || cols <= 0) {
+    throw new Error("rows and cols must be greater than 0");
+  }
+  if (alphabet.length === 0) {
+    throw new Error("alphabet must contain at least one character");
+  }
+  const words = options.words.map(normalizeWord).filter(Boolean);
+  if (words.length === 0) {
+    throw new Error("words must include at least one valid entry");
+  }
+  const sortedWords = [...words].sort((a, b) => b.length - a.length);
+  const directions = createDirections(allowDiagonal);
+  const grid = Array.from({ length: rows }, () => Array.from({ length: cols }, () => ""));
+  const placements = [];
+  for (const word of sortedWords) {
+    let placed = false;
+    for (let attempt = 0; attempt < maxPlacementAttempts; attempt += 1) {
+      const direction = directions[randomInt(directions.length)];
+      if (!direction) {
+        throw new Error("No directions configured for placement");
+      }
+      const [deltaRow, deltaCol] = direction;
+      const startRow = randomInt(rows);
+      const startCol = randomInt(cols);
+      if (!canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol)) {
+        continue;
+      }
+      placeWord(grid, word, startRow, startCol, deltaRow, deltaCol);
+      placements.push({ word, startRow, startCol, deltaRow, deltaCol });
+      placed = true;
+      break;
+    }
+    if (!placed) {
+      throw new Error(`Unable to place word: ${word}`);
+    }
+  }
+  fillEmptyCells(grid, alphabet.toUpperCase());
+  return { grid, placements };
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  createWordSearch
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/index.ts","../src/wordSearch.ts"],"sourcesContent":["export * from \"./types\";\nexport { createWordSearch } from \"./wordSearch\";\n","import type { WordPlacement, WordSearchOptions, WordSearchPuzzle } from \"./types\";\n\nconst DEFAULT_ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nfunction normalizeWord(word: string): string {\n  return word.trim().toUpperCase().replace(/\\s+/g, \"\");\n}\n\nfunction createDirections(allowDiagonal: boolean): Array<[number, number]> {\n  const base: Array<[number, number]> = [\n    [0, 1],\n    [1, 0],\n    [0, -1],\n    [-1, 0]\n  ];\n\n  if (!allowDiagonal) {\n    return base;\n  }\n\n  return [\n    ...base,\n    [1, 1],\n    [1, -1],\n    [-1, 1],\n    [-1, -1]\n  ];\n}\n\nfunction randomInt(max: number): number {\n  return Math.floor(Math.random() * max);\n}\n\nfunction inBounds(row: number, col: number, rows: number, cols: number): boolean {\n  return row >= 0 && row < rows && col >= 0 && col < cols;\n}\n\nfunction canPlaceWord(\n  grid: string[][],\n  word: string,\n  startRow: number,\n  startCol: number,\n  deltaRow: number,\n  deltaCol: number\n): boolean {\n  const firstRow = grid[0];\n  if (!firstRow) {\n    return false;\n  }\n\n  for (let i = 0; i < word.length; i += 1) {\n    const row = startRow + i * deltaRow;\n    const col = startCol + i * deltaCol;\n\n    if (!inBounds(row, col, grid.length, firstRow.length)) {\n      return false;\n    }\n\n    const rowCells = grid[row];\n    const existing = rowCells?.[col];\n    const char = word[i];\n    if (!rowCells || existing === undefined || char === undefined) {\n      return false;\n    }\n\n    if (existing !== \"\" && existing !== char) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction placeWord(\n  grid: string[][],\n  word: string,\n  startRow: number,\n  startCol: number,\n  deltaRow: number,\n  deltaCol: number\n): void {\n  for (let i = 0; i < word.length; i += 1) {\n    const row = startRow + i * deltaRow;\n    const col = startCol + i * deltaCol;\n    const rowCells = grid[row];\n    const char = word[i];\n    if (!rowCells || char === undefined) {\n      throw new Error(\"Invalid word placement coordinates\");\n    }\n\n    rowCells[col] = char;\n  }\n}\n\nfunction fillEmptyCells(grid: string[][], alphabet: string): void {\n  const chars = alphabet.split(\"\");\n  for (let row = 0; row < grid.length; row += 1) {\n    const rowCells = grid[row];\n    if (!rowCells) {\n      continue;\n    }\n\n    for (let col = 0; col < rowCells.length; col += 1) {\n      if (rowCells[col] === \"\") {\n        const nextChar = chars[randomInt(chars.length)];\n        rowCells[col] = nextChar ?? chars[0] ?? \"A\";\n      }\n    }\n  }\n}\n\nexport function createWordSearch(options: WordSearchOptions): WordSearchPuzzle {\n  const rows = options.rows;\n  const cols = options.cols;\n  const alphabet = options.alphabet ?? DEFAULT_ALPHABET;\n  const allowDiagonal = options.allowDiagonal ?? true;\n  const maxPlacementAttempts = options.maxPlacementAttempts ?? 250;\n\n  if (rows <= 0 || cols <= 0) {\n    throw new Error(\"rows and cols must be greater than 0\");\n  }\n\n  if (alphabet.length === 0) {\n    throw new Error(\"alphabet must contain at least one character\");\n  }\n\n  const words = options.words.map(normalizeWord).filter(Boolean);\n  if (words.length === 0) {\n    throw new Error(\"words must include at least one valid entry\");\n  }\n\n  const sortedWords = [...words].sort((a, b) => b.length - a.length);\n  const directions = createDirections(allowDiagonal);\n  const grid = Array.from({ length: rows }, () => Array.from({ length: cols }, () => \"\"));\n  const placements: WordPlacement[] = [];\n\n  for (const word of sortedWords) {\n    let placed = false;\n\n    for (let attempt = 0; attempt < maxPlacementAttempts; attempt += 1) {\n      const direction = directions[randomInt(directions.length)];\n      if (!direction) {\n        throw new Error(\"No directions configured for placement\");\n      }\n\n      const [deltaRow, deltaCol] = direction;\n      const startRow = randomInt(rows);\n      const startCol = randomInt(cols);\n\n      if (!canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol)) {\n        continue;\n      }\n\n      placeWord(grid, word, startRow, startCol, deltaRow, deltaCol);\n      placements.push({ word, startRow, startCol, deltaRow, deltaCol });\n      placed = true;\n      break;\n    }\n\n    if (!placed) {\n      throw new Error(`Unable to place word: ${word}`);\n    }\n  }\n\n  fillEmptyCells(grid, alphabet.toUpperCase());\n\n  return { grid, placements };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACEA,IAAM,mBAAmB;AAEzB,SAAS,cAAc,MAAsB;AAC3C,SAAO,KAAK,KAAK,EAAE,YAAY,EAAE,QAAQ,QAAQ,EAAE;AACrD;AAEA,SAAS,iBAAiB,eAAiD;AACzE,QAAM,OAAgC;AAAA,IACpC,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,EAAE;AAAA,IACN,CAAC,IAAI,CAAC;AAAA,EACR;AAEA,MAAI,CAAC,eAAe;AAClB,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,EAAE;AAAA,IACN,CAAC,IAAI,CAAC;AAAA,IACN,CAAC,IAAI,EAAE;AAAA,EACT;AACF;AAEA,SAAS,UAAU,KAAqB;AACtC,SAAO,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AACvC;AAEA,SAAS,SAAS,KAAa,KAAa,MAAc,MAAuB;AAC/E,SAAO,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM;AACrD;AAEA,SAAS,aACP,MACA,MACA,UACA,UACA,UACA,UACS;AACT,QAAM,WAAW,KAAK,CAAC;AACvB,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,MAAM,WAAW,IAAI;AAE3B,QAAI,CAAC,SAAS,KAAK,KAAK,KAAK,QAAQ,SAAS,MAAM,GAAG;AACrD,aAAO;AAAA,IACT;AAEA,UAAM,WAAW,KAAK,GAAG;AACzB,UAAM,WAAW,WAAW,GAAG;AAC/B,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,CAAC,YAAY,aAAa,UAAa,SAAS,QAAW;AAC7D,aAAO;AAAA,IACT;AAEA,QAAI,aAAa,MAAM,aAAa,MAAM;AACxC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,UACP,MACA,MACA,UACA,UACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,WAAW,KAAK,GAAG;AACzB,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,CAAC,YAAY,SAAS,QAAW;AACnC,YAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAEA,aAAS,GAAG,IAAI;AAAA,EAClB;AACF;AAEA,SAAS,eAAe,MAAkB,UAAwB;AAChE,QAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,WAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO,GAAG;AAC7C,UAAM,WAAW,KAAK,GAAG;AACzB,QAAI,CAAC,UAAU;AACb;AAAA,IACF;AAEA,aAAS,MAAM,GAAG,MAAM,SAAS,QAAQ,OAAO,GAAG;AACjD,UAAI,SAAS,GAAG,MAAM,IAAI;AACxB,cAAM,WAAW,MAAM,UAAU,MAAM,MAAM,CAAC;AAC9C,iBAAS,GAAG,IAAI,YAAY,MAAM,CAAC,KAAK;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,iBAAiB,SAA8C;AAC7E,QAAM,OAAO,QAAQ;AACrB,QAAM,OAAO,QAAQ;AACrB,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,uBAAuB,QAAQ,wBAAwB;AAE7D,MAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,UAAM,IAAI,MAAM,sCAAsC;AAAA,EACxD;AAEA,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAEA,QAAM,QAAQ,QAAQ,MAAM,IAAI,aAAa,EAAE,OAAO,OAAO;AAC7D,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAEA,QAAM,cAAc,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACjE,QAAM,aAAa,iBAAiB,aAAa;AACjD,QAAM,OAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,MAAM,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,MAAM,EAAE,CAAC;AACtF,QAAM,aAA8B,CAAC;AAErC,aAAW,QAAQ,aAAa;AAC9B,QAAI,SAAS;AAEb,aAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW,GAAG;AAClE,YAAM,YAAY,WAAW,UAAU,WAAW,MAAM,CAAC;AACzD,UAAI,CAAC,WAAW;AACd,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AAEA,YAAM,CAAC,UAAU,QAAQ,IAAI;AAC7B,YAAM,WAAW,UAAU,IAAI;AAC/B,YAAM,WAAW,UAAU,IAAI;AAE/B,UAAI,CAAC,aAAa,MAAM,MAAM,UAAU,UAAU,UAAU,QAAQ,GAAG;AACrE;AAAA,MACF;AAEA,gBAAU,MAAM,MAAM,UAAU,UAAU,UAAU,QAAQ;AAC5D,iBAAW,KAAK,EAAE,MAAM,UAAU,UAAU,UAAU,SAAS,CAAC;AAChE,eAAS;AACT;AAAA,IACF;AAEA,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,yBAAyB,IAAI,EAAE;AAAA,IACjD;AAAA,EACF;AAEA,iBAAe,MAAM,SAAS,YAAY,CAAC;AAE3C,SAAO,EAAE,MAAM,WAAW;AAC5B;","names":[]}

package/dist/index.mjs

@@ -0,0 +1,128 @@
+// src/wordSearch.ts
+var DEFAULT_ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
+function normalizeWord(word) {
+  return word.trim().toUpperCase().replace(/\s+/g, "");
+}
+function createDirections(allowDiagonal) {
+  const base = [
+    [0, 1],
+    [1, 0],
+    [0, -1],
+    [-1, 0]
+  ];
+  if (!allowDiagonal) {
+    return base;
+  }
+  return [
+    ...base,
+    [1, 1],
+    [1, -1],
+    [-1, 1],
+    [-1, -1]
+  ];
+}
+function randomInt(max) {
+  return Math.floor(Math.random() * max);
+}
+function inBounds(row, col, rows, cols) {
+  return row >= 0 && row < rows && col >= 0 && col < cols;
+}
+function canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol) {
+  const firstRow = grid[0];
+  if (!firstRow) {
+    return false;
+  }
+  for (let i = 0; i < word.length; i += 1) {
+    const row = startRow + i * deltaRow;
+    const col = startCol + i * deltaCol;
+    if (!inBounds(row, col, grid.length, firstRow.length)) {
+      return false;
+    }
+    const rowCells = grid[row];
+    const existing = rowCells?.[col];
+    const char = word[i];
+    if (!rowCells || existing === void 0 || char === void 0) {
+      return false;
+    }
+    if (existing !== "" && existing !== char) {
+      return false;
+    }
+  }
+  return true;
+}
+function placeWord(grid, word, startRow, startCol, deltaRow, deltaCol) {
+  for (let i = 0; i < word.length; i += 1) {
+    const row = startRow + i * deltaRow;
+    const col = startCol + i * deltaCol;
+    const rowCells = grid[row];
+    const char = word[i];
+    if (!rowCells || char === void 0) {
+      throw new Error("Invalid word placement coordinates");
+    }
+    rowCells[col] = char;
+  }
+}
+function fillEmptyCells(grid, alphabet) {
+  const chars = alphabet.split("");
+  for (let row = 0; row < grid.length; row += 1) {
+    const rowCells = grid[row];
+    if (!rowCells) {
+      continue;
+    }
+    for (let col = 0; col < rowCells.length; col += 1) {
+      if (rowCells[col] === "") {
+        const nextChar = chars[randomInt(chars.length)];
+        rowCells[col] = nextChar ?? chars[0] ?? "A";
+      }
+    }
+  }
+}
+function createWordSearch(options) {
+  const rows = options.rows;
+  const cols = options.cols;
+  const alphabet = options.alphabet ?? DEFAULT_ALPHABET;
+  const allowDiagonal = options.allowDiagonal ?? true;
+  const maxPlacementAttempts = options.maxPlacementAttempts ?? 250;
+  if (rows <= 0 || cols <= 0) {
+    throw new Error("rows and cols must be greater than 0");
+  }
+  if (alphabet.length === 0) {
+    throw new Error("alphabet must contain at least one character");
+  }
+  const words = options.words.map(normalizeWord).filter(Boolean);
+  if (words.length === 0) {
+    throw new Error("words must include at least one valid entry");
+  }
+  const sortedWords = [...words].sort((a, b) => b.length - a.length);
+  const directions = createDirections(allowDiagonal);
+  const grid = Array.from({ length: rows }, () => Array.from({ length: cols }, () => ""));
+  const placements = [];
+  for (const word of sortedWords) {
+    let placed = false;
+    for (let attempt = 0; attempt < maxPlacementAttempts; attempt += 1) {
+      const direction = directions[randomInt(directions.length)];
+      if (!direction) {
+        throw new Error("No directions configured for placement");
+      }
+      const [deltaRow, deltaCol] = direction;
+      const startRow = randomInt(rows);
+      const startCol = randomInt(cols);
+      if (!canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol)) {
+        continue;
+      }
+      placeWord(grid, word, startRow, startCol, deltaRow, deltaCol);
+      placements.push({ word, startRow, startCol, deltaRow, deltaCol });
+      placed = true;
+      break;
+    }
+    if (!placed) {
+      throw new Error(`Unable to place word: ${word}`);
+    }
+  }
+  fillEmptyCells(grid, alphabet.toUpperCase());
+  return { grid, placements };
+}
+export {
+  createWordSearch
+};
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/wordSearch.ts"],"sourcesContent":["import type { WordPlacement, WordSearchOptions, WordSearchPuzzle } from \"./types\";\n\nconst DEFAULT_ALPHABET = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nfunction normalizeWord(word: string): string {\n  return word.trim().toUpperCase().replace(/\\s+/g, \"\");\n}\n\nfunction createDirections(allowDiagonal: boolean): Array<[number, number]> {\n  const base: Array<[number, number]> = [\n    [0, 1],\n    [1, 0],\n    [0, -1],\n    [-1, 0]\n  ];\n\n  if (!allowDiagonal) {\n    return base;\n  }\n\n  return [\n    ...base,\n    [1, 1],\n    [1, -1],\n    [-1, 1],\n    [-1, -1]\n  ];\n}\n\nfunction randomInt(max: number): number {\n  return Math.floor(Math.random() * max);\n}\n\nfunction inBounds(row: number, col: number, rows: number, cols: number): boolean {\n  return row >= 0 && row < rows && col >= 0 && col < cols;\n}\n\nfunction canPlaceWord(\n  grid: string[][],\n  word: string,\n  startRow: number,\n  startCol: number,\n  deltaRow: number,\n  deltaCol: number\n): boolean {\n  const firstRow = grid[0];\n  if (!firstRow) {\n    return false;\n  }\n\n  for (let i = 0; i < word.length; i += 1) {\n    const row = startRow + i * deltaRow;\n    const col = startCol + i * deltaCol;\n\n    if (!inBounds(row, col, grid.length, firstRow.length)) {\n      return false;\n    }\n\n    const rowCells = grid[row];\n    const existing = rowCells?.[col];\n    const char = word[i];\n    if (!rowCells || existing === undefined || char === undefined) {\n      return false;\n    }\n\n    if (existing !== \"\" && existing !== char) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction placeWord(\n  grid: string[][],\n  word: string,\n  startRow: number,\n  startCol: number,\n  deltaRow: number,\n  deltaCol: number\n): void {\n  for (let i = 0; i < word.length; i += 1) {\n    const row = startRow + i * deltaRow;\n    const col = startCol + i * deltaCol;\n    const rowCells = grid[row];\n    const char = word[i];\n    if (!rowCells || char === undefined) {\n      throw new Error(\"Invalid word placement coordinates\");\n    }\n\n    rowCells[col] = char;\n  }\n}\n\nfunction fillEmptyCells(grid: string[][], alphabet: string): void {\n  const chars = alphabet.split(\"\");\n  for (let row = 0; row < grid.length; row += 1) {\n    const rowCells = grid[row];\n    if (!rowCells) {\n      continue;\n    }\n\n    for (let col = 0; col < rowCells.length; col += 1) {\n      if (rowCells[col] === \"\") {\n        const nextChar = chars[randomInt(chars.length)];\n        rowCells[col] = nextChar ?? chars[0] ?? \"A\";\n      }\n    }\n  }\n}\n\nexport function createWordSearch(options: WordSearchOptions): WordSearchPuzzle {\n  const rows = options.rows;\n  const cols = options.cols;\n  const alphabet = options.alphabet ?? DEFAULT_ALPHABET;\n  const allowDiagonal = options.allowDiagonal ?? true;\n  const maxPlacementAttempts = options.maxPlacementAttempts ?? 250;\n\n  if (rows <= 0 || cols <= 0) {\n    throw new Error(\"rows and cols must be greater than 0\");\n  }\n\n  if (alphabet.length === 0) {\n    throw new Error(\"alphabet must contain at least one character\");\n  }\n\n  const words = options.words.map(normalizeWord).filter(Boolean);\n  if (words.length === 0) {\n    throw new Error(\"words must include at least one valid entry\");\n  }\n\n  const sortedWords = [...words].sort((a, b) => b.length - a.length);\n  const directions = createDirections(allowDiagonal);\n  const grid = Array.from({ length: rows }, () => Array.from({ length: cols }, () => \"\"));\n  const placements: WordPlacement[] = [];\n\n  for (const word of sortedWords) {\n    let placed = false;\n\n    for (let attempt = 0; attempt < maxPlacementAttempts; attempt += 1) {\n      const direction = directions[randomInt(directions.length)];\n      if (!direction) {\n        throw new Error(\"No directions configured for placement\");\n      }\n\n      const [deltaRow, deltaCol] = direction;\n      const startRow = randomInt(rows);\n      const startCol = randomInt(cols);\n\n      if (!canPlaceWord(grid, word, startRow, startCol, deltaRow, deltaCol)) {\n        continue;\n      }\n\n      placeWord(grid, word, startRow, startCol, deltaRow, deltaCol);\n      placements.push({ word, startRow, startCol, deltaRow, deltaCol });\n      placed = true;\n      break;\n    }\n\n    if (!placed) {\n      throw new Error(`Unable to place word: ${word}`);\n    }\n  }\n\n  fillEmptyCells(grid, alphabet.toUpperCase());\n\n  return { grid, placements };\n}\n"],"mappings":";AAEA,IAAM,mBAAmB;AAEzB,SAAS,cAAc,MAAsB;AAC3C,SAAO,KAAK,KAAK,EAAE,YAAY,EAAE,QAAQ,QAAQ,EAAE;AACrD;AAEA,SAAS,iBAAiB,eAAiD;AACzE,QAAM,OAAgC;AAAA,IACpC,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,EAAE;AAAA,IACN,CAAC,IAAI,CAAC;AAAA,EACR;AAEA,MAAI,CAAC,eAAe;AAClB,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,EAAE;AAAA,IACN,CAAC,IAAI,CAAC;AAAA,IACN,CAAC,IAAI,EAAE;AAAA,EACT;AACF;AAEA,SAAS,UAAU,KAAqB;AACtC,SAAO,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AACvC;AAEA,SAAS,SAAS,KAAa,KAAa,MAAc,MAAuB;AAC/E,SAAO,OAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,MAAM;AACrD;AAEA,SAAS,aACP,MACA,MACA,UACA,UACA,UACA,UACS;AACT,QAAM,WAAW,KAAK,CAAC;AACvB,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,MAAM,WAAW,IAAI;AAE3B,QAAI,CAAC,SAAS,KAAK,KAAK,KAAK,QAAQ,SAAS,MAAM,GAAG;AACrD,aAAO;AAAA,IACT;AAEA,UAAM,WAAW,KAAK,GAAG;AACzB,UAAM,WAAW,WAAW,GAAG;AAC/B,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,CAAC,YAAY,aAAa,UAAa,SAAS,QAAW;AAC7D,aAAO;AAAA,IACT;AAEA,QAAI,aAAa,MAAM,aAAa,MAAM;AACxC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,UACP,MACA,MACA,UACA,UACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,WAAW,KAAK,GAAG;AACzB,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,CAAC,YAAY,SAAS,QAAW;AACnC,YAAM,IAAI,MAAM,oCAAoC;AAAA,IACtD;AAEA,aAAS,GAAG,IAAI;AAAA,EAClB;AACF;AAEA,SAAS,eAAe,MAAkB,UAAwB;AAChE,QAAM,QAAQ,SAAS,MAAM,EAAE;AAC/B,WAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO,GAAG;AAC7C,UAAM,WAAW,KAAK,GAAG;AACzB,QAAI,CAAC,UAAU;AACb;AAAA,IACF;AAEA,aAAS,MAAM,GAAG,MAAM,SAAS,QAAQ,OAAO,GAAG;AACjD,UAAI,SAAS,GAAG,MAAM,IAAI;AACxB,cAAM,WAAW,MAAM,UAAU,MAAM,MAAM,CAAC;AAC9C,iBAAS,GAAG,IAAI,YAAY,MAAM,CAAC,KAAK;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,iBAAiB,SAA8C;AAC7E,QAAM,OAAO,QAAQ;AACrB,QAAM,OAAO,QAAQ;AACrB,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,gBAAgB,QAAQ,iBAAiB;AAC/C,QAAM,uBAAuB,QAAQ,wBAAwB;AAE7D,MAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,UAAM,IAAI,MAAM,sCAAsC;AAAA,EACxD;AAEA,MAAI,SAAS,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AAEA,QAAM,QAAQ,QAAQ,MAAM,IAAI,aAAa,EAAE,OAAO,OAAO;AAC7D,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAEA,QAAM,cAAc,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AACjE,QAAM,aAAa,iBAAiB,aAAa;AACjD,QAAM,OAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,MAAM,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,MAAM,EAAE,CAAC;AACtF,QAAM,aAA8B,CAAC;AAErC,aAAW,QAAQ,aAAa;AAC9B,QAAI,SAAS;AAEb,aAAS,UAAU,GAAG,UAAU,sBAAsB,WAAW,GAAG;AAClE,YAAM,YAAY,WAAW,UAAU,WAAW,MAAM,CAAC;AACzD,UAAI,CAAC,WAAW;AACd,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AAEA,YAAM,CAAC,UAAU,QAAQ,IAAI;AAC7B,YAAM,WAAW,UAAU,IAAI;AAC/B,YAAM,WAAW,UAAU,IAAI;AAE/B,UAAI,CAAC,aAAa,MAAM,MAAM,UAAU,UAAU,UAAU,QAAQ,GAAG;AACrE;AAAA,MACF;AAEA,gBAAU,MAAM,MAAM,UAAU,UAAU,UAAU,QAAQ;AAC5D,iBAAW,KAAK,EAAE,MAAM,UAAU,UAAU,UAAU,SAAS,CAAC;AAChE,eAAS;AACT;AAAA,IACF;AAEA,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,yBAAyB,IAAI,EAAE;AAAA,IACjD;AAAA,EACF;AAEA,iBAAe,MAAM,SAAS,YAAY,CAAC;AAE3C,SAAO,EAAE,MAAM,WAAW;AAC5B;","names":[]}

package/package.json

@@ -0,0 +1,26 @@
+{
+  "name": "@js-gamifications/word-search-core",
+  "version": "1.0.1",
+  "description": "Framework-agnostic word search engine",
+  "license": "MIT",
+  "main": "./dist/index.js",
+  "module": "./dist/index.mjs",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.mjs",
+      "require": "./dist/index.js"
+    }
+  },
+  "scripts": {
+    "build": "tsup",
+    "clean": "rm -rf dist",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "lint": "tsc --noEmit"
+  }
+}