diff --git a/.gitattributes b/.gitattributes index a6344aac8c09253b3b630fb776ae94478aa0275b..a2eeaa11097b00f554d8d96085835227ef5a4eab 100644 --- a/.gitattributes +++ b/.gitattributes @@ -33,3 +33,5 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text *.zip filter=lfs diff=lfs merge=lfs -text *.zst filter=lfs diff=lfs merge=lfs -text *tfevents* filter=lfs diff=lfs merge=lfs -text +figure1.png filter=lfs diff=lfs merge=lfs -text +submodules/rlp/puzzles/puzzles.hlp filter=lfs diff=lfs merge=lfs -text diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000000000000000000000000000000000000..0f247258277714befec2beb878ca033e0bb7c4ab --- /dev/null +++ b/.gitignore @@ -0,0 +1,28 @@ +.venv/ +.hfvenv/ +__pycache__/ +*.pyc +.pytest_cache/ +*.egg-info/ +node_modules/ +frontend/node_modules/ +frontend/dist/ +.npm-cache/ +frontend/.npm-cache/ +dist/ +data/ +results/ +submodules/rlp/build/ +submodules/rlp/rlp.egg-info/ +submodules/rlp/rlp/constants*.so +submodules/rlp/rlp/lib/ +submodules/rlp/rlp/lib/*.so +submodules/rlp/rlp/lib/CMakeCache.txt +submodules/rlp/rlp/lib/CMakeFiles/ +submodules/rlp/rlp/lib/Makefile +submodules/rlp/rlp/lib/cmake_install.cmake +submodules/rlp/rlp/lib/**/CMakeFiles/ +submodules/rlp/rlp/lib/**/Makefile +submodules/rlp/rlp/lib/**/cmake_install.cmake +submodules/flowfree/flowfree_all_solutions +uv.lock diff --git a/Dockerfile b/Dockerfile new file mode 100644 index 0000000000000000000000000000000000000000..cfdfcde9dc3b26cd5c6d959733df13c5019ae63b --- /dev/null +++ b/Dockerfile @@ -0,0 +1,27 @@ +FROM node:22-bookworm-slim AS frontend-build + +WORKDIR /app/frontend +COPY frontend/package.json frontend/package-lock.json* ./ +RUN npm install +COPY frontend/ ./ +RUN npm run build + +FROM python:3.12-slim-bookworm + +WORKDIR /app + +COPY . /app + +ARG DEBIAN_MIRROR=https://ftp.us.debian.org/debian +ARG DEBIAN_SECURITY_MIRROR=https://security.debian.org/debian-security +ENV DEBIAN_MIRROR=${DEBIAN_MIRROR} +ENV DEBIAN_SECURITY_MIRROR=${DEBIAN_SECURITY_MIRROR} +ENV PYTHONUNBUFFERED=1 +ENV TOPOBENCH_FRONTEND_DIST=/app/frontend/dist + +RUN bash scripts/install.sh +COPY --from=frontend-build /app/frontend/dist /app/frontend/dist + +EXPOSE 7860 + +CMD ["uvicorn", "space_app.main:app", "--host", "0.0.0.0", "--port", "7860"] diff --git a/README.md b/README.md index 40f4d6a7a04cdd142fc91f0a57491fec8d737896..a9c83c4de26b88b232acc32411016371782561f4 100644 --- a/README.md +++ b/README.md @@ -1,10 +1,167 @@ --- -title: Testspace -emoji: 🏢 -colorFrom: purple -colorTo: purple +title: TopoBench Space +emoji: 🧩 +colorFrom: green +colorTo: yellow sdk: docker +app_port: 7860 pinned: false --- -Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference +# TopoBench + +TopoBench now includes a Hugging Face Space app for playing, timing, and verifying +the benchmark puzzles in addition to the original benchmark runner. + +## Space App + +The Space uses: + +- `FastAPI` for the backend API and static asset serving +- `React + Vite` for the frontend +- `SQLite` under `/data/topobench.sqlite` for session storage +- The existing native puzzle verifiers from this repo for correctness checking + +### Local development + +Backend dependencies: + +```bash +python3 -m pip install -e . +``` + +Frontend dependencies: + +```bash +cd frontend +npm install +npm run build +``` + +Run the app: + +```bash +uvicorn space_app.main:app --host 0.0.0.0 --port 7860 +``` + +Optional environment variables: + +- `ADMIN_API_TOKEN` +- `TOPOBENCH_DATA_DIR` +- `TOPOBENCH_DATABASE_PATH` +- `HF_HOME` + +Admin exports: + +- `GET /api/admin/solves` +- `GET /api/admin/aggregates` + +Both require `Authorization: Bearer `. + +## Benchmark Runner + +![TopoBench](figure1.png) + +This repo provides the code to run the main TopoBench benchmark with different input formats. + +Dataset Links: + +- [Plain](https://huggingface.co/datasets/topobench/topobench) +- [Intformat](https://huggingface.co/datasets/topobench/topobench_intformat) +- [Intformat_json](https://huggingface.co/datasets/topobench/topobench_intformat_json) + +## Setup (docker required) + +Build the container: + +```bash +docker build -t topobench -f docker/Dockerfile . \ + --build-arg DEBIAN_MIRROR=https://ftp.us.debian.org/debian \ + --build-arg DEBIAN_SECURITY_MIRROR=https://security.debian.org/debian-security +``` + +Troubleshooting Docker builds: + +- If the build fails while fetching Debian packages, you might want to change the mirrors + +Run it: + +```bash +docker run --rm -it \ + -e OPENROUTER_KEY=your_key_here \ + topobench \ + python evals/src/main.py run-and-verify \ + --provider openrouter \ + --model inception/mercury-2 \ + --variant intformat_json \ + --difficulty easy \ + --puzzle bridges \ + --limit 1 +``` + +Options for keys (only set the keys you need for the provider you plan to use): + +- `OPENAI_API_KEY` +- `OPENROUTER_API_KEY` +- `DEEPSEEK_API_KEY` +- `ANTHROPIC_API_KEY` +- `GOOGLE_API_KEY` + +Run all six puzzles on the plain release: + +```bash +python evals/src/main.py run \ + --provider openai \ + --model gpt-5-mini \ + --variant plain \ + --difficulty all + --limit 50 +``` + +Run only bridges on intformat_json and immediately verify in one command: + +```bash +python evals/src/main.py run-and-verify \ + --provider openrouter \ + --model inception/mercury-2 \ + --variant intformat_json \ + --difficulty easy \ + --puzzle bridges \ + --limit 50 +``` + +Format options: + +- plain +- intformat +- intformat_json + +Puzzle options: + +- bridges +- flow_free +- galaxies +- loopy +- pattern +- undead + +## Verify Existing Runs + +Each run is saved under `results/runs//` with: + +- `manifest.json` +- `responses.jsonl` + +Verify a run and export CSV summaries: + +```bash +python evals/src/main.py verify \ + --run-dir results/runs/ +``` + +Verification writes: + +- `results/reports/_details.csv` +- `results/reports/_summary.csv` + +The verifier also prints a summary table to the terminal. diff --git a/docker/Dockerfile b/docker/Dockerfile new file mode 100644 index 0000000000000000000000000000000000000000..cdc1ac7f1fafc14dc80d444682d526d45ca3da21 --- /dev/null +++ b/docker/Dockerfile @@ -0,0 +1,14 @@ +FROM python:3.12-slim-bookworm + +WORKDIR /app + +COPY . /app + +ARG DEBIAN_MIRROR=https://ftp.us.debian.org/debian +ARG DEBIAN_SECURITY_MIRROR=https://security.debian.org/debian-security +ENV DEBIAN_MIRROR=${DEBIAN_MIRROR} +ENV DEBIAN_SECURITY_MIRROR=${DEBIAN_SECURITY_MIRROR} + +RUN bash scripts/install.sh + +CMD ["python", "/bin/bash", "--help"] diff --git a/evals/prompts/bridges.txt b/evals/prompts/bridges.txt new file mode 100644 index 0000000000000000000000000000000000000000..674c0cf2a4f5c832bd68431194cadb4e0f04bc59 --- /dev/null +++ b/evals/prompts/bridges.txt @@ -0,0 +1,58 @@ +Game: Bridges (also known as Hashi or Hashiwokakero) + +Solve the following Bridges puzzle by connecting islands with bridges. You are given a 2D ASCII board representation. + +Legend: + +A grid where each cell is either: +- A number (1–8) representing an island with that many required bridges. +- A dot (.) representing an empty cell/water. + +Provide the completed grid with bridges represented by: + - `-` for horizontal bridges. + - `|` for vertical bridges. + - `=` for horizontal double bridges. + - `"` for vertical double bridges. + +Rules: + +Connect all of the islands with bridges such that: +The number of bridges connected to each island matches the number on that island. +Bridges only run horizontally or vertically. +Bridges must not cross other bridges or islands. +A maximum of two bridges can connect any pair of islands. +All islands must be part of a single connected group. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +3..1. +..4.3 +..... +..... +4.4.1 + +Solution: + +```json +{"response": " +3--1. +".4=3 +".".| +".".| +4=4.1 +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/bridges_intformat.txt b/evals/prompts/bridges_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..594a7e38ba12db7b98b3dc493ef1e127a016ff91 --- /dev/null +++ b/evals/prompts/bridges_intformat.txt @@ -0,0 +1,65 @@ +Game: Bridges (also known as Hashi or Hashiwokakero) + +Solve the following Bridges puzzle by connecting islands with bridges. You are given a 2D ASCII board representation. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- 0 = space +- 2 = double vertical bridge +- 3 = single horizontal bridge +- 4 = water/empty +- 5 = 1 (island with value 1) +- 6 = 2 (island with value 2) +- 7 = 3 (island with value 3) +- 8 = 4 (island with value 4) +- 9 = 5 (island with value 5) +- A = 6 (island with value 6) +- B = 7 (island with value 7) +- C = 8 (island with value 8) +- D = double horizontal bridge +- E = single vertical bridge + +Rules: + +Connect all of the islands with bridges such that: +The number of bridges connected to each island matches the number on that island. +Bridges only run horizontally or vertically. +Bridges must not cross other bridges or islands. +A maximum of two bridges can connect any pair of islands. +All islands must be part of a single connected group. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +7,4,4,4,7 +4,4,4,4,4 +4,5,4,4,7 +4,4,4,4,4 +8,4,8,4,6 + +Solution: + +```json +{"response": " +7,3,3,3,7 +2,4,4,4,2 +2,5,3,3,7 +2,4,4,4,4 +8,D,8,D,6 +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/bridges_intformat_json.txt b/evals/prompts/bridges_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..8e835b36cfa93dd8c0360e126c3f380f75cf085d --- /dev/null +++ b/evals/prompts/bridges_intformat_json.txt @@ -0,0 +1,59 @@ +```plaintext +Game: Bridges (also known as Hashi or Hashiwokakero) + +Solve the following Bridges puzzle by connecting islands with bridges. You are given a 2D ASCII board representation in JSON array format. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- "0" = space +- "2" = double vertical bridge +- "3" = single horizontal bridge +- "4" = water/empty +- "5" = 1 (island with value 1) +- "6" = 2 (island with value 2) +- "7" = 3 (island with value 3) +- "8" = 4 (island with value 4) +- "9" = 5 (island with value 5) +- "A" = 6 (island with value 6) +- "B" = 7 (island with value 7) +- "C" = 8 (island with value 8) +- "D" = double horizontal bridge +- "E" = single vertical bridge + +Rules: + +Connect all of the islands with bridges such that: +The number of bridges connected to each island matches the number on that island. +Bridges only run horizontally or vertically. +Bridges must not cross other bridges or islands. +A maximum of two bridges can connect any pair of islands. +All islands must be part of a single connected group. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["7", "4", "4", "4", "7"], ["4", "4", "4", "4", "4"], ["4", "5", "4", "4", "7"], ["4", "4", "4", "4", "4"], ["8", "4", "8", "4", "6"]] + +Solution: + +```json +{"response": " +[["7", "3", "3", "3", "7"], ["2", "4", "4", "4", "2"], ["2", "5", "3", "3", "7"], ["2", "4", "4", "4", "4"], ["8", "D", "8", "D", "6"]] +"} +``` + +Now solve this puzzle: +``` \ No newline at end of file diff --git a/evals/prompts/flow_free.txt b/evals/prompts/flow_free.txt new file mode 100644 index 0000000000000000000000000000000000000000..8c6c2b843b29af44698aeab8fa97c1b51f9e0f06 --- /dev/null +++ b/evals/prompts/flow_free.txt @@ -0,0 +1,53 @@ +Game: Flow Free + +Solve the following Flow Free puzzle by connecting the same letters. You are given a 2D ASCII board representation. + +Legend: + +Letters (A-Z) = colored dots that need to be connected +. = empty space that can be filled with letters to create paths + +Rules: + +1. You may only fill in dots (.) with letters that already exist on the board. +2. You cannot modify or move any of the existing letters. +3. Each pair of identical letters must be connected with a continuous, unbroken path of the same letter. +4. Paths cannot cross or overlap each other. +5. When solved, no dots should remain — the board must be completely filled with letters. +6. A path cannot be adjacent to itself horizontally or vertically. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +BA...A +..E... +..D.F. +..F..D +..C.CE +B..... + +Solution: + +```json +{"response": " +BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/flow_free_intformat.txt b/evals/prompts/flow_free_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..e2f555e4ddb3e09d219265090b9311c83c6a5e33 --- /dev/null +++ b/evals/prompts/flow_free_intformat.txt @@ -0,0 +1,53 @@ +Game: Flow Free + +Solve the following Flow Free puzzle by connecting the same letters. You are given a 2D ASCII board representation in a tokenizer optimized integer format. + +Legend: +Each board cell is delimited by a comma. Each new row is on a new line. +'2' = empty space that can be filled with letters to create paths +'3' to '9' and 'A' to 'C' = colored dots that need to be connected + +Rules: + +1. You may only fill in empty space ('2') with colours that already exist on the board. (i.e., numbers/letters from '3' to '9' and 'A' to 'C' that are already present). +2. You cannot modify or move any of the existing letters. +3. Each pair of identical colours must be connected with a continuous, unbroken path of the same colour. +4. Paths cannot cross or overlap each other. +5. When solved, no empty spaces ('2') should remain — the board must be completely filled with colours ('3' to '9' and 'A' to 'C'). +6. A path cannot be adjacent to itself horizontally or vertically. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +5,2,4,2,2,2 +3,2,2,2,2,2 +2,2,2,3,2,2 +2,6,2,2,2,2 +2,5,2,4,2,2 +2,2,2,2,2,6 + +Solution: + +```json +{"response": " +5,5,4,4,4,4 +3,5,5,5,5,4 +3,3,3,3,5,4 +6,6,5,5,5,4 +6,5,5,4,4,4 +6,6,6,6,6,6 +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/flow_free_intformat_json.txt b/evals/prompts/flow_free_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..8ae51055be26a5418ad478c73609437ebed73559 --- /dev/null +++ b/evals/prompts/flow_free_intformat_json.txt @@ -0,0 +1,43 @@ +Game: Flow Free + +Solve the following Flow Free puzzle by connecting the same letters. You are given a 2D ASCII board representation in a tokenizer optimized integer format. + +Legend: +Each board cell is delimited by a comma. Each new row is on a new line. +'2' = empty space that can be filled with letters to create paths +'3' to '9' and 'A' to 'C' = colored dots that need to be connected + +Rules: + +1. You may only fill in empty space ('2') with colours that already exist on the board. (i.e., numbers/letters from '3' to '9' and 'A' to 'C' that are already present). +2. You cannot modify or move any of the existing letters. +3. Each pair of identical colours must be connected with a continuous, unbroken path of the same colour. +4. Paths cannot cross or overlap each other. +5. When solved, no empty spaces ('2') should remain — the board must be completely filled with colours ('3' to '9' and 'A' to 'C'). +6. A path cannot be adjacent to itself horizontally or vertically. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["2", "2", "2", "2", "2", "2", "2", "2"], ["4", "2", "2", "2", "2", "2", "2", "2"], ["2", "2", "2", "2", "2", "2", "2", "2"], ["2", "2", "2", "2", "3", "2", "8", "2"], ["8", "2", "3", "2", "2", "2", "2", "2"], ["7", "2", "9", "2", "2", "6", "2", "5"], ["2", "2", "2", "9", "6", "2", "2", "2"], ["2", "2", "2", "2", "7", "4", "2", "5"]] + +Solution: + +```json +{"response": " +[["4", "4", "4", "4", "4", "4", "4", "4"], ["4", "8", "8", "8", "8", "8", "8", "4"], ["8", "8", "9", "9", "9", "9", "8", "4"], ["8", "9", "9", "3", "3", "9", "8", "4"], ["8", "9", "3", "3", "9", "9", "4", "4"], ["7", "9", "9", "9", "9", "6", "4", "5"], ["7", "9", "9", "9", "6", "6", "4", "5"], ["7", "7", "7", "7", "7", "4", "4", "5"]] +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/galaxies.txt b/evals/prompts/galaxies.txt new file mode 100644 index 0000000000000000000000000000000000000000..bee5c586d83f3fd67e98a534bcffef068bf4a06b --- /dev/null +++ b/evals/prompts/galaxies.txt @@ -0,0 +1,67 @@ +Game: Galaxies (also known as Spiral Galaxies / Tentai Show) + +Solve the following Galaxies puzzle by partitioning the grid into rotationally symmetric regions. You are given a 2D ASCII board representation. + +Legend: + +Initial grid: +o = dot ++ = grid vertex +- = horizontal grid line +| = vertical grid line +space ( ) = empty square or non-existent grid line + +Grid orientation: rows are written top-to-bottom; columns left-to-right. Each row is a string of characters; rows are separated by newline characters (\n). + +Rules: + +Partition the rectangular grid into connected regions of squares so that: +Every region is 180° rotationally symmetric. +Each region contains exactly one dot, and that dot is the region’s centre of symmetry. The dot may be on a square, on an edge between two squares, or at a vertex where four squares meet. +Regions are formed by drawing edges on grid lines; the puzzle is complete when the drawn edges separate every pair of squares that belong to different regions. +Do not modify or move any of the existing dots or grid lines and vertexes. Only add new hoizontal and veritcal edges to the grid lines. + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + ++-+-+-+-+-+ +|o o | ++ + + + + + +| o | ++ + + + + + +| o| ++ + + + + + +| o | ++o+o+ + o + +| | ++-+-+-+-+-+ + +Solution: + +```json +{"response": " ++-+-+-+-+-+ +|o| |o| | ++-+ +-+ + + +| o | ++ + +-+ +-+ +| | | |o| ++-+-+ +-+-+ +| | |o| | ++o+o+ + o + +| | | | | ++-+-+-+-+-+ +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/galaxies_intformat.txt b/evals/prompts/galaxies_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..c6a2a1c4580da81078bd14de3edded9b97c5c6c5 --- /dev/null +++ b/evals/prompts/galaxies_intformat.txt @@ -0,0 +1,69 @@ +Game: Galaxies (also known as Spiral Galaxies / Tentai Show) + +Solve the following Galaxies puzzle by partitioning the grid into rotationally symmetric regions. You are given a 2D ASCII board representation. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +Initial grid: +- 0 = space (empty square or non-existent grid line) +- 2 = + (grid vertex) +- 3 = - (horizontal grid line) +- 4 = o (dot) +- 5 = | (vertical grid line) + +Grid orientation: rows are written top-to-bottom; columns left-to-right. Each row is a string of characters; rows are separated by newline characters (\n). + +Rules: + +Partition the rectangular grid into connected regions of squares so that: +Every region is 180° rotationally symmetric. +Each region contains exactly one dot, and that dot is the region’s centre of symmetry. The dot may be on a square, on an edge between two squares, or at a vertex where four squares meet. +Regions are formed by drawing edges on grid lines; the puzzle is complete when the drawn edges separate every pair of squares that belong to different regions. +Do not modify or move any of the existing dots or grid lines and vertexes. Only add new hoizontal and veritcal edges to the grid lines. + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +2,3,2,3,2,3,2,3,2,3,2 +5,0,0,0,0,0,0,0,4,0,5 +2,0,2,4,2,0,2,0,2,0,2 +5,0,0,0,0,0,0,0,0,4,5 +2,0,2,0,2,0,2,0,2,0,2 +5,0,0,0,0,0,0,4,0,0,5 +2,0,2,0,2,0,2,0,2,0,2 +5,0,0,4,0,0,0,0,0,0,5 +2,0,2,0,2,0,2,0,2,4,2 +5,4,0,0,0,0,0,4,0,0,5 +2,3,2,3,2,3,2,3,2,3,2 + +Solution: + +```json +{"response": " +2,3,2,3,2,3,2,3,2,3,2 +5,0,0,0,0,0,5,0,4,0,5 +2,0,2,4,2,0,2,3,2,3,2 +5,0,0,0,0,0,5,0,5,4,5 +2,3,2,3,2,3,2,0,2,3,2 +5,0,0,0,5,0,0,4,0,0,5 +2,0,2,0,2,3,2,0,2,3,2 +5,0,0,4,0,0,5,0,5,0,5 +2,3,2,0,2,0,2,3,2,4,2 +5,4,5,0,0,0,5,4,5,0,5 +2,3,2,3,2,3,2,3,2,3,2 +"} +``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/galaxies_intformat_json.txt b/evals/prompts/galaxies_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..fe5ab5b686e2394114509828de44fc2dae75542a --- /dev/null +++ b/evals/prompts/galaxies_intformat_json.txt @@ -0,0 +1,51 @@ +```plaintext +Game: Galaxies (also known as Spiral Galaxies / Tentai Show) + +Solve the following Galaxies puzzle by partitioning the grid into rotationally symmetric regions. You are given a 2D ASCII board representation in JSON array format. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +Initial grid: +- "0" = space (empty square or non-existent grid line) +- "2" = + (grid vertex) +- "3" = - (horizontal grid line) +- "4" = o (dot) +- "5" = | (vertical grid line) + +Grid orientation: rows are written top-to-bottom; columns left-to-right. + +Rules: + +Partition the rectangular grid into connected regions of squares so that: +Every region is 180° rotationally symmetric. +Each region contains exactly one dot, and that dot is the region's centre of symmetry. The dot may be on a square, on an edge between two squares, or at a vertex where four squares meet. +Regions are formed by drawing edges on grid lines; the puzzle is complete when the drawn edges separate every pair of squares that belong to different regions. +Do not modify or move any of the existing dots or grid lines and vertexes. Only add new hoizontal and veritcal edges to the grid lines. + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["2", "3", "2", "3", "2", "3", "2", "3", "2", "3", "2"], ["5", "0", "0", "0", "0", "0", "0", "0", "4", "0", "5"], ["2", "0", "2", "4", "2", "0", "2", "0", "2", "0", "2"], ["5", "0", "0", "0", "0", "0", "0", "0", "0", "4", "5"], ["2", "0", "2", "0", "2", "0", "2", "0", "2", "0", "2"], ["5", "0", "0", "0", "0", "0", "0", "4", "0", "0", "5"], ["2", "0", "2", "0", "2", "0", "2", "0", "2", "0", "2"], ["5", "0", "0", "4", "0", "0", "0", "0", "0", "0", "5"], ["2", "0", "2", "0", "2", "0", "2", "0", "2", "4", "2"], ["5", "4", "0", "0", "0", "0", "0", "4", "0", "0", "5"], ["2", "3", "2", "3", "2", "3", "2", "3", "2", "3", "2"]] + +Solution: + +```json +{"response": " +[["2", "3", "2", "3", "2", "3", "2", "3", "2", "3", "2"], ["5", "0", "0", "0", "0", "0", "5", "0", "4", "0", "5"], ["2", "0", "2", "4", "2", "0", "2", "3", "2", "3", "2"], ["5", "0", "0", "0", "0", "0", "5", "0", "5", "4", "5"], ["2", "3", "2", "3", "2", "3", "2", "0", "2", "3", "2"], ["5", "0", "0", "0", "5", "0", "0", "4", "0", "0", "5"], ["2", "0", "2", "0", "2", "3", "2", "0", "2", "3", "2"], ["5", "0", "0", "4", "0", "0", "5", "0", "5", "0", "5"], ["2", "3", "2", "0", "2", "0", "2", "3", "2", "4", "2"], ["5", "4", "5", "0", "0", "0", "5", "4", "5", "0", "5"], ["2", "3", "2", "3", "2", "3", "2", "3", "2", "3", "2"]] +"} +``` + +Now solve this puzzle: +``` \ No newline at end of file diff --git a/evals/prompts/loopy.txt b/evals/prompts/loopy.txt new file mode 100644 index 0000000000000000000000000000000000000000..8c70edf659d014c54708e6eae77382ecb0ff8653 --- /dev/null +++ b/evals/prompts/loopy.txt @@ -0,0 +1,73 @@ +Game: Loopy (Slitherlink) + +Solve the following Loopy (Slitherlink) puzzle given as a 2D ASCII grid. + +Legend: + +You are given numbers arranged in a grid that represent the number of loop edges that should be adjacent to their cell. Use the following symbols to solve the puzzle: +x for no edge in that position +- and | for horizontal and vertical edges +space ( ) for empty cells where no number is given + +Rules: + +Draw a single continuous loop using some subset of the possible edges. +The loop must: +Pass along - and | positions only. +Satisfy all cell clues. +Have no branches (each vertex used by the loop has degree 2). +In the solution: +Use - and | to show edges that are part of the loop and x to show edges that are not part of the loop. +The structure of the puzzle is as follows: empty row, row with clues, empty row, row with clues, ... ending with an empty row. +The available positions for horizontal edges (-) are in the empty rows in every second column (the columns where clues can appear). +The available positions for vertical edges (|) are in the rows with clues in the first, third, fifth, etc. columns (the columns where no clues appear). +In each of the possible positions for edges, you must determine whether to place an edge (- or |) or to mark it as not part of the loop (x). + +Stay within the grid boundaries denoted as +. Do not modify the grid boundaries. + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + ++++++++++++++ ++ + ++ 2 1 3 + ++ + ++ 2 1 2 + ++ + ++ 3 + ++ + ++ 0 1 3 + ++ + ++ 3 + ++ + ++++++++++++++ + +Solution: + +```json +{"response": " ++++++++++++++ ++ - - - x - + ++|2x1x |3| |+ ++ x x x - x + ++|2x x1x x2|+ ++ - x - - - + ++x3| | x x x+ ++ - x - - - + ++| x0x x1x3|+ ++ - x - x - + ++x |3| | | x+ ++ x - x - x + ++++++++++++++"}``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/loopy_intformat.txt b/evals/prompts/loopy_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..b4f96c50c40b652c46d5698b664d34b0ab94b7e2 --- /dev/null +++ b/evals/prompts/loopy_intformat.txt @@ -0,0 +1,78 @@ +Game: Loopy (Slitherlink) + +Solve the following Loopy (Slitherlink) puzzle given as a 2D ASCII grid. + +Legend: + +The puzzle grid is encoded using integers 0-8 where each character maps to a specific symbol: + +- 0 = space +- 2 = horizontal edge +- 3 = 0 (digit) +- 4 = 1 (digit) +- 5 = 2 (digit) +- 6 = 3 (digit) +- 7 = x (edge not in loop) +- 8 = vertical edge + +You are given numbers arranged in a grid that represent the number of loop edges that should be adjacent to their cell. Use the following symbols to solve the puzzle: +7 for no edge in that position +2 and 8 for horizontal and vertical edges +0 for empty cells where no number is given + +Rules: + +Draw a single continuous loop using some subset of the possible edges. +The loop must: +Pass along 2 and 8 positions only. +Satisfy all cell clues. +Have no branches (each vertex used by the loop has degree 2). +In the solution: +Use 2 and 8 to show edges that are part of the loop and 7 to show edges that are not part of the loop. +The structure of the puzzle is as follows: empty row, row with clues, empty row, row with clues, ... ending with an empty row. +The available positions for horizontal edges (2) are in the empty rows in every second column (the columns where clues can appear). +The available positions for vertical edges (8) are in the rows with clues in the first, third, fifth, etc. columns (the columns where no clues appear). +In each of the possible positions for edges, you must determine whether to place an edge (2 or 8) or to mark it as not part of the loop (7). + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +0,0,0,0,0,0,0,0,0,0,0 +0,5,0,4,0,0,0,6,0,0,0 +0,0,0,0,0,0,0,0,0,0,0 +0,5,0,0,0,4,0,0,0,5,0 +0,0,0,0,0,0,0,0,0,0,0 +0,6,0,0,0,0,0,0,0,0,0 +0,0,0,0,0,0,0,0,0,0,0 +0,0,0,3,0,0,0,4,0,6,0 +0,0,0,0,0,0,0,0,0,0,0 +0,0,0,6,0,0,0,0,0,0,0 + +Solution: + +```json +{"response": " +0,2,0,2,0,2,0,7,0,2,0 +8,5,7,4,7,0,8,6,8,0,8 +0,7,0,7,0,7,0,2,0,7,0 +8,5,7,0,7,4,7,0,7,5,8 +0,2,0,7,0,2,0,2,0,2,0 +7,6,8,0,8,0,7,0,7,0,7 +0,2,0,7,0,2,0,2,0,2,0 +8,0,7,3,7,0,7,4,7,6,8 +0,2,0,7,0,2,0,7,0,2,0 +7,0,8,6,8,0,8,0,8,0,7 +0,7,0,2,0,7,0,2,0,7,0 +"}``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/loopy_intformat_json.txt b/evals/prompts/loopy_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..53bc7305cae7fced33542733a5624f145e3400dc --- /dev/null +++ b/evals/prompts/loopy_intformat_json.txt @@ -0,0 +1,59 @@ +Game: Loopy (Slitherlink) + +Solve the following Loopy (Slitherlink) puzzle given as a 2D ASCII grid in JSON array format. + +Legend: + +The puzzle grid is encoded using integers 0-8 where each character maps to a specific symbol: + +- "0" = space +- "2" = horizontal edge +- "3" = 0 (digit) +- "4" = 1 (digit) +- "5" = 2 (digit) +- "6" = 3 (digit) +- "7" = x (edge not in loop) +- "8" = vertical edge + +You are given numbers arranged in a grid that represent the number of loop edges that should be adjacent to their cell. Use the following symbols to solve the puzzle: +"7" for no edge in that position +"2" and "8" for horizontal and vertical edges +"0" for empty cells where no number is given + +Rules: + +Draw a single continuous loop using some subset of the possible edges. +The loop must: +Pass along "2" and "8" positions only. +Satisfy all cell clues. +Have no branches (each vertex used by the loop has degree 2). +In the solution: +Use "2" and "8" to show edges that are part of the loop and "7" to show edges that are not part of the loop. +The structure of the puzzle is as follows: empty row, row with clues, empty row, row with clues, ... ending with an empty row. +The available positions for horizontal edges ("2") are in the empty rows in every second column (the columns where clues can appear). +The available positions for vertical edges ("8") are in the rows with clues in the first, third, fifth, etc. columns (the columns where no clues appear). +In each of the possible positions for edges, you must determine whether to place an edge ("2" or "8") or to mark it as not part of the loop ("7"). + +Think step by step then output only the solved board in json format as shown below. + +Output Format +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "5", "0", "4", "0", "0", "0", "6", "0", "0", "0"], ["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "5", "0", "0", "0", "4", "0", "0", "0", "5", "0"], ["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "6", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "0", "0", "3", "0", "0", "0", "4", "0", "6", "0"], ["0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "0", "0", "6", "0", "0", "0", "0", "0", "0", "0"]] + +Solution: + +```json +{"response": " +[["0", "2", "0", "2", "0", "2", "0", "7", "0", "2", "0"], ["8", "5", "7", "4", "7", "0", "8", "6", "8", "0", "8"], ["0", "7", "0", "7", "0", "7", "0", "2", "0", "7", "0"], ["8", "5", "7", "0", "7", "4", "7", "0", "7", "5", "8"], ["0", "2", "0", "7", "0", "2", "0", "2", "0", "2", "0"], ["7", "6", "8", "0", "8", "0", "7", "0", "7", "0", "7"], ["0", "2", "0", "7", "0", "2", "0", "2", "0", "2", "0"], ["8", "0", "7", "3", "7", "0", "7", "4", "7", "6", "8"], ["0", "2", "0", "7", "0", "2", "0", "7", "0", "2", "0"], ["7", "0", "8", "6", "8", "0", "8", "0", "8", "0", "7"], ["0", "7", "0", "2", "0", "7", "0", "2", "0", "7", "0"]] +"}``` + +Now solve this puzzle: diff --git a/evals/prompts/pattern.txt b/evals/prompts/pattern.txt new file mode 100644 index 0000000000000000000000000000000000000000..4436aa77192e9a94d4fbd9ea67177dca3f99b2ff --- /dev/null +++ b/evals/prompts/pattern.txt @@ -0,0 +1,64 @@ +Game: Pattern + +Solve the following Pattern puzzle. You are given a 2D ASCII board representation. + +Legend: +-"+" for vertices +-"-" for horizontal edges +-"|" for vertical edges +-Spaces for empty cells +-Digits on top and left sides of the grid (called "clues") indicating how many cells in that row or column should form a connected pattern. + + + +Rules: +Patterns are formed by placing "##" into cells that should be filled and ".." into cells that should stay empty. For example when there are two clues of "3" in a row, it means that there should be two separate groups of three connected ## cells in that row. +Only place ## and .. in empty cells (spaces). Do not modify or move any of the existing +, -, |, or numbers. Each row and column must contain exactly the number of connected ## groups as indicated by the clues. The pattern must be continuous (all ## cells must be connected horizontally or vertically). + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + + 2 1 4 2 4 + +--+--+--+--+--+ + 3| | | | | | + +--+--+--+--+--+ + 3| | | | | | + +--+--+--+--+--+ + 1 1| | | | | | + +--+--+--+--+--+ +1 1 1| | | | | | + +--+--+--+--+--+ + 2| | | | | | + +--+--+--+--+--+ + +Solution: + +```json +{"response": " + 2 1 4 2 4 + +--+--+--+--+--+ + 3|..|..|##|##|##| + +--+--+--+--+--+ + 3|..|..|##|##|##| + +--+--+--+--+--+ + 1 1|..|..|##|..|##| + +--+--+--+--+--+ +1 1 1|##|..|##|..|##| + +--+--+--+--+--+ + 2|##|##|..|..|..| + +--+--+--+--+--+ +"}``` + +Now solve this puzzle: + diff --git a/evals/prompts/pattern_intformat.txt b/evals/prompts/pattern_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..e299a5ca6db3d8ce87ac8fc5b68482ee49d1c06a --- /dev/null +++ b/evals/prompts/pattern_intformat.txt @@ -0,0 +1,71 @@ +Game: Pattern + +Solve the following Pattern puzzle. You are given a 2D ASCII board representation. + +Legend: +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- 0 = space +- A = . (empty cell) +- B = # (filled cell) +- X = + (vertex) +- Y = - (horizontal edge) +- Z = | (vertical edge) +- 1-9 = digits 1-9 (clues) + +-Digits on top and left sides of the grid (called "clues") indicating how many cells in that row or column should form a connected pattern. + + +Rules: +Patterns are formed by placing B into cells that should be filled and A into cells that should stay empty. For example when there are two clues of "3" in a row, it means that there should be two separate groups of three connected B cells in that row. +Only place B and A in empty cells (zeros). Do not modify or move any of the existing X, Y, Z, or numbers. Each row and column must contain exactly the number of connected B groups as indicated by the clues. The pattern must be continuous (all B cells must be connected horizontally or vertically). + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0 +0,0,0,0,0,2,0,0,3,0,0,1,0,0,3,0,0,3,0 +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +1,0,2,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,2,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +1,0,2,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,2,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,3,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z,0,0,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X + +Solution: + +```json +{"response": " +0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0 +0,0,0,0,0,2,0,0,3,0,0,1,0,0,3,0,0,3,0 +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +1,0,2,Z,A,A,Z,B,B,Z,A,A,Z,B,B,Z,B,B,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,2,Z,A,A,Z,A,A,Z,A,A,Z,B,B,Z,B,B,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +1,0,2,Z,A,A,Z,B,B,Z,A,A,Z,B,B,Z,B,B,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,2,Z,B,B,Z,B,B,Z,A,A,Z,A,A,Z,A,A,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +0,0,3,Z,B,B,Z,B,B,Z,B,B,Z,A,A,Z,A,A,Z +0,0,0,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X,Y,Y,X +"}``` + +Now solve this puzzle: + diff --git a/evals/prompts/pattern_intformat_json.txt b/evals/prompts/pattern_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..76f4f6b266c5605b5b95590b8db66a1cb671c806 --- /dev/null +++ b/evals/prompts/pattern_intformat_json.txt @@ -0,0 +1,48 @@ +```plaintext +Game: Pattern + +Solve the following Pattern puzzle. You are given a 2D ASCII board representation in JSON array format. + +Legend: +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- "0" = space +- "A" = . (empty cell) +- "B" = # (filled cell) +- "X" = + (vertex) +- "Y" = - (horizontal edge) +- "Z" = | (vertical edge) +- "1"-"9" = digits 1-9 (clues) + +-Digits on top and left sides of the grid (called "clues") indicating how many cells in that row or column should form a connected pattern. + + +Rules: +Patterns are formed by placing B into cells that should be filled and A into cells that should stay empty. For example when there are two clues of "3" in a row, it means that there should be two separate groups of three connected B cells in that row. +Only place B and A in empty cells (zeros). Do not modify or move any of the existing X, Y, Z, or numbers. Each row and column must contain exactly the number of connected B groups as indicated by the clues. The pattern must be continuous (all B cells must be connected horizontally or vertically). + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["0", "0", "0", "0", "0", "0", "0", "0", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "0", "0", "0", "0", "2", "0", "0", "3", "0", "0", "1", "0", "0", "3", "0", "0", "3", "0"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["1", "0", "2", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "2", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["1", "0", "2", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "2", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "3", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z", "0", "0", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"]] + +Solution: + +```json +{"response": " +[["0", "0", "0", "0", "0", "0", "0", "0", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0"], ["0", "0", "0", "0", "0", "2", "0", "0", "3", "0", "0", "1", "0", "0", "3", "0", "0", "3", "0"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["1", "0", "2", "Z", "A", "A", "Z", "B", "B", "Z", "A", "A", "Z", "B", "B", "Z", "B", "B", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "2", "Z", "A", "A", "Z", "A", "A", "Z", "A", "A", "Z", "B", "B", "Z", "B", "B", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["1", "0", "2", "Z", "A", "A", "Z", "B", "B", "Z", "A", "A", "Z", "B", "B", "Z", "B", "B", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "2", "Z", "B", "B", "Z", "B", "B", "Z", "A", "A", "Z", "A", "A", "Z", "A", "A", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"], ["0", "0", "3", "Z", "B", "B", "Z", "B", "B", "Z", "B", "B", "Z", "A", "A", "Z", "A", "A", "Z"], ["0", "0", "0", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X", "Y", "Y", "X"]] +"}``` + +Now solve this puzzle: +``` \ No newline at end of file diff --git a/evals/prompts/undead.txt b/evals/prompts/undead.txt new file mode 100644 index 0000000000000000000000000000000000000000..2cc9b3884cf93e8e6bcd1b3cc91f412a2a4bdb9d --- /dev/null +++ b/evals/prompts/undead.txt @@ -0,0 +1,61 @@ +Game: Undead + +Solve the following Undead puzzle. You are given a 2D ASCII board representation. + +Legend: + +- '.' for empty squares. +- '/' or '\' for diagonal mirrors that reflect monster visibility diagonally. +- Edge clues (numbers) indicating visible monsters from that direction. +- Fill the grid with letters: G, V, or Z. + +Rules: + +1. The puzzle is a grid of squares. Some squares contain diagonal mirrors ('/' or '\') which cannot hold monsters. +2. All non-mirror squares must be filled with exactly one monster: + - Ghost (G): visible only in mirrors. + - Vampire (V): visible only directly. + - Zombie (Z): visible in both direct view and mirrors. +3. Total counts of each monster type are provided. +4. Numbers around the edges of the grid indicate how many monsters are visible along that row or column from that position, counting diagonal reflections. +5. If a reflected line of sight crosses the same monster multiple times, count each occurrence. +6. Mirrors reflect light in both directions. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +G: 2 V: 6 Z: 0 + + 2 0 0 0 + 2 . \ \ / 0 + 3 . . . . 3 + 0 \ \ \ \ 0 + 1 . \ . . 2 + 1 0 0 1 + +Solution: + +```json +{"response": " +G: 2 V: 6 Z: 0 + + 2 0 0 0 + 2 V \ \ / 0 + 3 G V V V 3 + 0 \ \ \ \ 0 + 1 V \ G V 2 + 1 0 0 1 +"}``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/undead_intformat.txt b/evals/prompts/undead_intformat.txt new file mode 100644 index 0000000000000000000000000000000000000000..62c86c1169c2cad95aa003391a599d99b536b328 --- /dev/null +++ b/evals/prompts/undead_intformat.txt @@ -0,0 +1,82 @@ +Game: Undead + +Solve the following Undead puzzle. You are given a 2D ASCII board representation. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- 0 = space +- 2 = . (empty square) +- 3 = / (diagonal mirror) +- 4 = 0 (digit) +- 5 = 1 (digit) +- 6 = 2 (digit) +- 7 = 3 (digit) +- 8 = 4 (digit) +- 9 = 5 (digit) +- A = 6 (digit) +- B = 7 (digit) +- C = 8 (digit) +- D = 9 (digit) +- E = : (colon) +- F = Ghost +- G = Vampire +- H = Zombie +- I = \ (backslash diagonal mirror) + +- 4-9, A-D are edge clues (digits) indicating visible monsters from that direction. +- Fill the grid with letters: Ghost (F), Vampire (G), or Zombie (H). + +Rules: + +1. The puzzle is a grid of squares. Some squares contain diagonal mirrors (3 or I) which cannot hold monsters. +2. All non-mirror squares must be filled with exactly one monster: + - Ghost (F): visible only in mirrors. + - Vampire (G): visible only directly. + - Zombie (H): visible in both direct view and mirrors. +3. Total counts of each monster type are provided in the first line of the puzzle. +4. Numbers around the edges of the grid indicate how many monsters are visible along that row or column from that position, counting diagonal reflections. +5. If a reflected line of sight crosses the same monster multiple times, count each occurrence. +6. Mirrors reflect light in both directions. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +F,E,0,8,0,G,E,0,8,0,H,E,0,9 + +0,0,0,4,0,6,0,8,0,7,0,4,0,0 +0,4,0,3,0,2,0,2,0,3,0,I,0,4 +0,6,0,2,0,2,0,2,0,I,0,2,0,6 +0,6,0,2,0,I,0,3,0,3,0,I,0,6 +0,6,0,2,0,I,0,I,0,3,0,2,0,6 +0,7,0,3,0,2,0,2,0,2,0,2,0,6 +0,0,0,7,0,4,0,6,0,4,0,9,0,0 + +Solution: + +```json +{"response": " +F,E,0,8,0,G,E,0,8,0,H,E,0,9 + +0,0,0,4,0,6,0,8,0,7,0,4,0,0 +0,4,0,3,0,F,0,G,0,3,0,I,0,4 +0,6,0,F,0,H,0,H,0,I,0,H,0,6 +0,6,0,H,0,I,0,3,0,3,0,I,0,6 +0,6,0,G,0,I,0,I,0,3,0,G,0,6 +0,7,0,3,0,F,0,H,0,F,0,G,0,6 +0,0,0,7,0,4,0,6,0,4,0,9,0,0 +"}``` + +Now solve this puzzle: \ No newline at end of file diff --git a/evals/prompts/undead_intformat_json.txt b/evals/prompts/undead_intformat_json.txt new file mode 100644 index 0000000000000000000000000000000000000000..cccdc998115412d545e7f1b09faa3b35f0a93309 --- /dev/null +++ b/evals/prompts/undead_intformat_json.txt @@ -0,0 +1,68 @@ +```plaintext +Game: Undead + +Solve the following Undead puzzle. You are given a 2D ASCII board representation in JSON array format. + +Legend: + +The puzzle grid is encoded using integers and letters (0-9, A-Z) where each character maps to a specific symbol: + +- "0" = space +- "2" = . (empty square) +- "3" = / (diagonal mirror) +- "4" = 0 (digit) +- "5" = 1 (digit) +- "6" = 2 (digit) +- "7" = 3 (digit) +- "8" = 4 (digit) +- "9" = 5 (digit) +- "A" = 6 (digit) +- "B" = 7 (digit) +- "C" = 8 (digit) +- "D" = 9 (digit) +- "E" = : (colon) +- "F" = Ghost +- "G" = Vampire +- "H" = Zombie +- "I" = \ (backslash diagonal mirror) + +- 4-9, A-D are edge clues (digits) indicating visible monsters from that direction. +- Fill the grid with letters: Ghost (F), Vampire (G), or Zombie (H). + +Rules: + +1. The puzzle is a grid of squares. Some squares contain diagonal mirrors (3 or I) which cannot hold monsters. +2. All non-mirror squares must be filled with exactly one monster: + - Ghost (F): visible only in mirrors. + - Vampire (G): visible only directly. + - Zombie (H): visible in both direct view and mirrors. +3. Total counts of each monster type are provided in the first line of the puzzle. +4. Numbers around the edges of the grid indicate how many monsters are visible along that row or column from that position, counting diagonal reflections. +5. If a reflected line of sight crosses the same monster multiple times, count each occurrence. +6. Mirrors reflect light in both directions. + +Think step by step then output only the solved board in json format as shown below. + +Output Format: + +Return your final answer exactly like this: + +```json +{"response": "{final board state}"} +``` + +Example Puzzle: + +Input: + +[["F", "E", "0", "8", "0", "G", "E", "0", "8", "0", "H", "E", "0", "9"], ["0", "0", "0", "4", "0", "6", "0", "8", "0", "7", "0", "4", "0", "0"], ["0", "4", "0", "3", "0", "2", "0", "2", "0", "3", "0", "I", "0", "4"], ["0", "6", "0", "2", "0", "2", "0", "2", "0", "I", "0", "2", "0", "6"], ["0", "6", "0", "2", "0", "I", "0", "3", "0", "3", "0", "I", "0", "6"], ["0", "6", "0", "2", "0", "I", "0", "I", "0", "3", "0", "2", "0", "6"], ["0", "7", "0", "3", "0", "2", "0", "2", "0", "2", "0", "2", "0", "6"], ["0", "0", "0", "7", "0", "4", "0", "6", "0", "4", "0", "9", "0", "0"]] + +Solution: + +```json +{"response": " +[["F", "E", "0", "8", "0", "G", "E", "0", "8", "0", "H", "E", "0", "9"], ["0", "0", "0", "4", "0", "6", "0", "8", "0", "7", "0", "4", "0", "0"], ["0", "4", "0", "3", "0", "F", "0", "G", "0", "3", "0", "I", "0", "4"], ["0", "6", "0", "F", "0", "H", "0", "H", "0", "I", "0", "H", "0", "6"], ["0", "6", "0", "H", "0", "I", "0", "3", "0", "3", "0", "I", "0", "6"], ["0", "6", "0", "G", "0", "I", "0", "I", "0", "3", "0", "G", "0", "6"], ["0", "7", "0", "3", "0", "F", "0", "H", "0", "F", "0", "G", "0", "6"], ["0", "0", "0", "7", "0", "4", "0", "6", "0", "4", "0", "9", "0", "0"]] +"}``` + +Now solve this puzzle: +``` \ No newline at end of file diff --git a/evals/src/clients.py b/evals/src/clients.py new file mode 100644 index 0000000000000000000000000000000000000000..29550ba057b7092e73b69e2ba074a7be4de02f76 --- /dev/null +++ b/evals/src/clients.py @@ -0,0 +1,275 @@ +from __future__ import annotations + +import json +import os +from dataclasses import dataclass +from typing import Any + +from dotenv import load_dotenv + + +load_dotenv() + + +def _parse_extra_arg(value: str) -> Any: + """Parse CLI request args while allowing plain strings.""" + try: + return json.loads(value) + except json.JSONDecodeError: + return value + + +def parse_request_args(pairs: list[str] | None) -> dict[str, Any]: + parsed: dict[str, Any] = {} + for pair in pairs or []: + if "=" not in pair: + raise ValueError( + f"Invalid --request-arg '{pair}'. Expected KEY=VALUE." + ) + key, raw_value = pair.split("=", 1) + key = key.strip() + if not key: + raise ValueError(f"Invalid --request-arg '{pair}'. Empty key.") + parsed[key] = _parse_extra_arg(raw_value.strip()) + return parsed + + +@dataclass(frozen=True) +class GenerationResult: + text: str + input_tokens: int | None = None + output_tokens: int | None = None + total_tokens: int | None = None + raw: dict[str, Any] | None = None + + +class ModelClient: + def generate( + self, + provider: str, + model: str, + prompt: str, + *, + max_output_tokens: int, + temperature: float | None, + extra_args: dict[str, Any] | None = None, + ) -> GenerationResult: + provider = provider.lower() + extra_args = dict(extra_args or {}) + + if provider == "openai": + return self._generate_openai( + model, + prompt, + max_output_tokens=max_output_tokens, + temperature=temperature, + extra_args=extra_args, + ) + if provider == "openrouter": + return self._generate_openrouter( + model, + prompt, + max_output_tokens=max_output_tokens, + temperature=temperature, + extra_args=extra_args, + ) + if provider == "deepseek": + return self._generate_deepseek( + model, + prompt, + max_output_tokens=max_output_tokens, + temperature=temperature, + extra_args=extra_args, + ) + if provider == "anthropic": + return self._generate_anthropic( + model, + prompt, + max_output_tokens=max_output_tokens, + temperature=temperature, + extra_args=extra_args, + ) + if provider == "google": + return self._generate_google( + model, + prompt, + temperature=temperature, + extra_args=extra_args, + ) + + raise ValueError( + f"Unsupported provider '{provider}'. Use openai, openrouter, " + "deepseek, anthropic, or google." + ) + + def _generate_openai( + self, + model: str, + prompt: str, + *, + max_output_tokens: int, + temperature: float | None, + extra_args: dict[str, Any], + ) -> GenerationResult: + from openai import OpenAI + + client = OpenAI(api_key=os.environ.get("OPENAI_API_KEY")) + params: dict[str, Any] = { + "model": model, + "input": prompt, + "max_output_tokens": max_output_tokens, + } + if temperature is not None: + params["temperature"] = temperature + params.update(extra_args) + + response = client.responses.create(**params) + usage = getattr(response, "usage", None) + return GenerationResult( + text=response.output_text or "", + input_tokens=getattr(usage, "input_tokens", None), + output_tokens=getattr(usage, "output_tokens", None), + total_tokens=getattr(usage, "total_tokens", None), + raw=response.model_dump() if hasattr(response, "model_dump") else None, + ) + + def _generate_openrouter( + self, + model: str, + prompt: str, + *, + max_output_tokens: int, + temperature: float | None, + extra_args: dict[str, Any], + ) -> GenerationResult: + from openai import OpenAI + + client = OpenAI( + api_key=os.environ.get("OPENROUTER_API_KEY") + or os.environ.get("OPENROUTER_KEY"), + base_url="https://openrouter.ai/api/v1", + ) + params: dict[str, Any] = { + "model": model, + "messages": [{"role": "user", "content": prompt}], + "max_tokens": max_output_tokens, + } + if temperature is not None: + params["temperature"] = temperature + params.update(extra_args) + + response = client.chat.completions.create(**params) + usage = getattr(response, "usage", None) + message = response.choices[0].message + return GenerationResult( + text=message.content or "", + input_tokens=getattr(usage, "prompt_tokens", None), + output_tokens=getattr(usage, "completion_tokens", None), + total_tokens=getattr(usage, "total_tokens", None), + raw=response.model_dump() if hasattr(response, "model_dump") else None, + ) + + def _generate_deepseek( + self, + model: str, + prompt: str, + *, + max_output_tokens: int, + temperature: float | None, + extra_args: dict[str, Any], + ) -> GenerationResult: + from openai import OpenAI + + client = OpenAI( + api_key=os.environ.get("DEEPSEEK_API_KEY"), + base_url="https://api.deepseek.com", + ) + params: dict[str, Any] = { + "model": model, + "messages": [{"role": "user", "content": prompt}], + "max_tokens": max_output_tokens, + } + if temperature is not None: + params["temperature"] = temperature + params.update(extra_args) + + response = client.chat.completions.create(**params) + usage = getattr(response, "usage", None) + message = response.choices[0].message + return GenerationResult( + text=message.content or "", + input_tokens=getattr(usage, "prompt_tokens", None), + output_tokens=getattr(usage, "completion_tokens", None), + total_tokens=getattr(usage, "total_tokens", None), + raw=response.model_dump() if hasattr(response, "model_dump") else None, + ) + + def _generate_anthropic( + self, + model: str, + prompt: str, + *, + max_output_tokens: int, + temperature: float | None, + extra_args: dict[str, Any], + ) -> GenerationResult: + from anthropic import Anthropic + + client = Anthropic(api_key=os.environ.get("ANTHROPIC_API_KEY")) + params: dict[str, Any] = { + "model": model, + "max_tokens": max_output_tokens, + "messages": [{"role": "user", "content": prompt}], + } + if temperature is not None: + params["temperature"] = temperature + params.update(extra_args) + + response = client.messages.create(**params) + text_parts = [part.text for part in response.content if getattr(part, "text", "")] + usage = getattr(response, "usage", None) + input_tokens = getattr(usage, "input_tokens", None) + output_tokens = getattr(usage, "output_tokens", None) + total_tokens = None + if input_tokens is not None and output_tokens is not None: + total_tokens = input_tokens + output_tokens + return GenerationResult( + text="".join(text_parts), + input_tokens=input_tokens, + output_tokens=output_tokens, + total_tokens=total_tokens, + raw=response.model_dump() if hasattr(response, "model_dump") else None, + ) + + def _generate_google( + self, + model: str, + prompt: str, + *, + temperature: float | None, + extra_args: dict[str, Any], + ) -> GenerationResult: + from google import genai + + client = genai.Client(api_key=os.environ.get("GOOGLE_API_KEY")) + config = dict(extra_args) + if temperature is not None: + config["temperature"] = temperature + response = client.models.generate_content( + model=model, + contents=prompt, + config=config or None, + ) + text = getattr(response, "text", None) or "" + usage = getattr(response, "usage_metadata", None) + input_tokens = getattr(usage, "prompt_token_count", None) + output_tokens = getattr(usage, "candidates_token_count", None) + total_tokens = getattr(usage, "total_token_count", None) + raw = response.model_dump() if hasattr(response, "model_dump") else None + return GenerationResult( + text=text, + input_tokens=input_tokens, + output_tokens=output_tokens, + total_tokens=total_tokens, + raw=raw, + ) diff --git a/evals/src/evals.py b/evals/src/evals.py new file mode 100644 index 0000000000000000000000000000000000000000..928de862c52716abfc0a3655979aa1feb1f10290 --- /dev/null +++ b/evals/src/evals.py @@ -0,0 +1,195 @@ +from __future__ import annotations + +import json +from dataclasses import asdict +from datetime import UTC, datetime +from pathlib import Path +from typing import Any + +from tqdm import tqdm + +from clients import ModelClient +from puzzles import DATASET_REPOS, RUNS_DIR, PuzzleSpec, expand_puzzles, load_dataset_frame, load_prompt + + +def slugify(value: str) -> str: + cleaned = [] + for ch in value: + if ch.isalnum(): + cleaned.append(ch.lower()) + elif ch in {"-", "_", "."}: + cleaned.append("-") + slug = "".join(cleaned).strip("-") + return slug or "run" + + +def timestamp_slug() -> str: + return datetime.now(UTC).strftime("%Y%m%d-%H%M%S") + + +def build_run_name( + *, + model: str, + variant: str, + difficulty: str, + puzzles: list[PuzzleSpec], +) -> str: + puzzle_part = "all" if len(puzzles) == 6 else "-".join(p.key for p in puzzles) + return f"{timestamp_slug()}-{slugify(model)}-{variant}-{difficulty}-{puzzle_part}" + + +def write_json(path: Path, payload: Any) -> None: + path.parent.mkdir(parents=True, exist_ok=True) + path.write_text(json.dumps(payload, indent=2), encoding="utf-8") + + +def append_jsonl(path: Path, row: dict[str, Any]) -> None: + path.parent.mkdir(parents=True, exist_ok=True) + with path.open("a", encoding="utf-8") as handle: + handle.write(json.dumps(row, ensure_ascii=False) + "\n") + + +def load_json(path: Path) -> Any: + return json.loads(path.read_text(encoding="utf-8")) + + +def load_jsonl(path: Path) -> list[dict[str, Any]]: + if not path.exists(): + return [] + rows = [] + with path.open("r", encoding="utf-8") as handle: + for line in handle: + line = line.strip() + if line: + rows.append(json.loads(line)) + return rows + + +def create_run_manifest( + *, + run_name: str, + provider: str, + model: str, + variant: str, + difficulty: str, + limit: int | None, + max_output_tokens: int, + temperature: float | None, + request_args: dict[str, Any], + puzzles: list[PuzzleSpec], +) -> dict[str, Any]: + return { + "run_name": run_name, + "created_at": datetime.now(UTC).isoformat(), + "provider": provider, + "model": model, + "variant": variant, + "dataset_repo": DATASET_REPOS[variant], + "difficulty": difficulty, + "limit": limit, + "max_output_tokens": max_output_tokens, + "temperature": temperature, + "request_args": request_args, + "puzzles": [asdict(puzzle) for puzzle in puzzles], + } + + +def run_benchmarks( + *, + provider: str, + model: str, + variant: str, + difficulty: str, + puzzle_names: list[str], + limit: int | None, + max_output_tokens: int, + temperature: float | None, + request_args: dict[str, Any], + run_name: str | None, + overwrite: bool, +) -> Path: + puzzles = expand_puzzles(puzzle_names) + resolved_run_name = run_name or build_run_name( + model=model, + variant=variant, + difficulty=difficulty, + puzzles=puzzles, + ) + run_dir = RUNS_DIR / resolved_run_name + responses_path = run_dir / "responses.jsonl" + manifest_path = run_dir / "manifest.json" + + if run_dir.exists() and not overwrite: + raise FileExistsError( + f"Run directory already exists: {run_dir}. " + "Pass --overwrite or choose --run-name." + ) + if overwrite and run_dir.exists(): + for path in run_dir.glob("*"): + if path.is_file(): + path.unlink() + else: + raise RuntimeError( + f"Refusing to overwrite unexpected directory inside {run_dir}: {path}" + ) + + client = ModelClient() + run_dir.mkdir(parents=True, exist_ok=True) + + manifest = create_run_manifest( + run_name=resolved_run_name, + provider=provider, + model=model, + variant=variant, + difficulty=difficulty, + limit=limit, + max_output_tokens=max_output_tokens, + temperature=temperature, + request_args=request_args, + puzzles=puzzles, + ) + write_json(manifest_path, manifest) + + for puzzle in puzzles: + dataset = load_dataset_frame( + puzzle, + variant=variant, + difficulty=difficulty, + limit=limit, + ) + prompt = load_prompt(puzzle, variant) + progress = tqdm( + dataset.itertuples(index=False), + total=len(dataset), + desc=f"{puzzle.key}:{difficulty}", + ) + + for row in progress: + prompt_text = f"{prompt.rstrip()}\n\n{row.problem}" + generation = client.generate( + provider=provider, + model=model, + prompt=prompt_text, + max_output_tokens=max_output_tokens, + temperature=temperature, + extra_args=request_args, + ) + record = { + "filename": row.filename, + "puzzlename": row.puzzlename, + "difficulty": row.difficulty, + "args": getattr(row, "args", None), + "variant": variant, + "provider": provider, + "model": model, + "prompt_file": puzzle.prompt_path(variant).name, + "dataset_repo": DATASET_REPOS[variant], + "response_text": generation.text, + "input_tokens": generation.input_tokens, + "output_tokens": generation.output_tokens, + "total_tokens": generation.total_tokens, + "created_at": datetime.now(UTC).isoformat(), + } + append_jsonl(responses_path, record) + + return run_dir diff --git a/evals/src/evals_verifier.py b/evals/src/evals_verifier.py new file mode 100644 index 0000000000000000000000000000000000000000..b9c3415393ebc9b068137e8e090462b720b89d92 --- /dev/null +++ b/evals/src/evals_verifier.py @@ -0,0 +1,348 @@ +from __future__ import annotations + +import ast +import importlib.util +import json +import re +import sys +from pathlib import Path +from typing import Any + +import pandas as pd +from json_repair import repair_json + +from evals import load_json, load_jsonl, write_json +from puzzles import MAPPINGS_DIR, REPORTS_DIR, SUBMODULES_DIR, PUZZLES, build_row_lookup, load_dataset_frame + + +RLP_PATH = SUBMODULES_DIR / "rlp" +FLOWFREE_PATH = SUBMODULES_DIR / "flowfree" +sys.path.insert(0, str(RLP_PATH)) + +from rlp.ascii_parser import ( # type: ignore + check_bridges_structural_validity, + check_galaxies_structural_validity, + check_undead_structural_validity, +) +from rlp.puzzle import Puzzle as RLPPuzzle # type: ignore +from verifier import verify_ascii_state # type: ignore + + +MAPPING_FILES = { + "bridges": "bridges.json", + "flow_free": "flow_free.json", + "galaxies": "galaxies.json", + "loopy": "loopy.json", + "pattern": "pattern.json", + "undead": "undead.json", +} + +_mapping_cache: dict[str, dict[str, str]] = {} +_puzzle_cache: dict[tuple[str, str], RLPPuzzle] = {} + + +def _flowfree_verifier_module(): + spec = importlib.util.spec_from_file_location( + "flowfree_verifier", + str(FLOWFREE_PATH / "verifier.py"), + ) + if spec is None or spec.loader is None: + raise RuntimeError("Could not load FlowFree verifier module.") + module = importlib.util.module_from_spec(spec) + spec.loader.exec_module(module) + return module + + +def load_mapping(puzzle_type: str) -> dict[str, str]: + if puzzle_type not in _mapping_cache: + payload = json.loads( + (MAPPINGS_DIR / MAPPING_FILES[puzzle_type]).read_text(encoding="utf-8") + ) + _mapping_cache[puzzle_type] = payload["char_map"] + return _mapping_cache[puzzle_type] + + +def decode_intformat_board(encoded_board: str, puzzle_type: str) -> str: + reverse_map = {value: key for key, value in load_mapping(puzzle_type).items()} + rows = [] + for line in encoded_board.strip().splitlines(): + cells = [cell.strip() for cell in line.split(",")] + rows.append("".join(reverse_map.get(cell, "?") for cell in cells)) + return "\n".join(rows) + + +def decode_intformat_json_board(encoded_board: str, puzzle_type: str) -> str: + reverse_map = {value: key for key, value in load_mapping(puzzle_type).items()} + try: + grid = json.loads(encoded_board) + except json.JSONDecodeError: + try: + grid = ast.literal_eval(encoded_board) + except (SyntaxError, ValueError): + return encoded_board + if not isinstance(grid, list): + return encoded_board + rows = [] + for row in grid: + if not isinstance(row, list): + return encoded_board + rows.append("".join(reverse_map.get(str(cell), "?") for cell in row)) + return "\n".join(rows) + + +def extract_board(response_text: str) -> str | None: + if not response_text: + return None + + candidates: list[str] = [] + + stripped = response_text.strip() + if stripped.startswith("{") or stripped.startswith("["): + candidates.append(stripped) + + fenced = re.findall(r"```(?:json)?\s*(.*?)\s*```", response_text, re.DOTALL) + candidates.extend(fenced) + + object_matches = re.findall(r"(\{.*?\})", response_text, re.DOTALL) + candidates.extend(object_matches) + + for candidate in reversed(candidates): + try: + fixed = repair_json(candidate) + parsed = json.loads(fixed) + except Exception: + continue + + if isinstance(parsed, dict) and "response" in parsed: + value = parsed["response"] + return value if isinstance(value, str) else json.dumps(value) + if isinstance(parsed, list): + return json.dumps(parsed) + + return None + + +def verify_flow_free(problem_ascii: str, extracted_board: str) -> dict[str, Any]: + verifier = _flowfree_verifier_module() + solver_src = str(FLOWFREE_PATH / "flowfree_all_solutions.c") + solver_bin = str(FLOWFREE_PATH / "flowfree_all_solutions") + result = { + "board_exists": bool(extracted_board), + "board_valid": False, + "board_modified": False, + "correct": False, + } + if not extracted_board: + return result + + is_valid, _ = verifier.verify_solution( + problem_ascii, + extracted_board, + solver_src=solver_src, + solver_bin=solver_bin, + print_solutions=False, + ) + result["correct"] = bool(is_valid) + + problem_lines = [line for line in problem_ascii.strip().splitlines() if line] + solution_lines = [line for line in extracted_board.strip().splitlines() if line] + if len(problem_lines) == len(solution_lines) and problem_lines: + result["board_valid"] = all( + len(problem_row) == len(solution_row) + for problem_row, solution_row in zip(problem_lines, solution_lines) + ) + modified = False + for problem_row, solution_row in zip(problem_lines, solution_lines): + for start_cell, end_cell in zip(problem_row, solution_row): + if start_cell != "." and start_cell != end_cell: + modified = True + break + if modified: + break + result["board_modified"] = modified + return result + + +def get_or_create_rlp_puzzle(puzzle_type: str, args: str) -> RLPPuzzle: + cache_key = (puzzle_type, args) + if cache_key not in _puzzle_cache: + try: + puzzle = RLPPuzzle(puzzle_type, arg=args, headless=True) + except OSError as exc: + raise RuntimeError( + "RLP verifier libraries are not built yet. " + "Run 'bash scripts/install.sh' first." + ) from exc + puzzle.new_game() + _puzzle_cache[cache_key] = puzzle + return _puzzle_cache[cache_key] + + +def verify_with_rlp( + *, + puzzle_type: str, + problem_ascii: str, + extracted_board: str, + args: str, +) -> dict[str, Any]: + result = { + "board_exists": bool(extracted_board), + "board_valid": False, + "board_modified": False, + "correct": False, + } + if not extracted_board: + return result + + if puzzle_type == "bridges": + result["board_valid"] = bool( + check_bridges_structural_validity(extracted_board, problem_ascii) + ) + elif puzzle_type == "galaxies": + result["board_valid"] = bool( + check_galaxies_structural_validity(extracted_board, problem_ascii) + ) + elif puzzle_type == "undead": + result["board_valid"] = bool(check_undead_structural_validity(extracted_board)) + else: + result["board_valid"] = True + + if not result["board_valid"]: + result["board_modified"] = True + return result + + puzzle = get_or_create_rlp_puzzle(puzzle_type, args) + result["correct"] = ( + verify_ascii_state( + puzzle, + extracted_board, + problem_ascii=problem_ascii, + ) + == "SOLVED" + ) + return result + + +def decode_board_for_variant(board: str | None, variant: str, puzzle_type: str) -> str | None: + if board is None: + return None + if variant == "plain": + return board + if variant == "intformat": + return decode_intformat_board(board, puzzle_type) + if variant == "intformat_json": + return decode_intformat_json_board(board, puzzle_type) + raise ValueError(f"Unknown variant '{variant}'") + + +def summarize(frame: pd.DataFrame) -> pd.DataFrame: + summary = ( + frame.groupby(["provider", "model", "variant", "puzzlename", "difficulty"], dropna=False) + .agg( + total=("filename", "count"), + board_exists=("board_exists", "sum"), + board_valid=("board_valid", "sum"), + correct=("correct", "sum"), + avg_output_tokens=("output_tokens", "mean"), + avg_total_tokens=("total_tokens", "mean"), + ) + .reset_index() + ) + summary["accuracy"] = summary["correct"] / summary["total"] + return summary.sort_values( + ["puzzlename", "difficulty", "provider", "model"] + ).reset_index(drop=True) + + +def verify_run(run_dir: Path) -> dict[str, Path]: + manifest = load_json(run_dir / "manifest.json") + records = load_jsonl(run_dir / "responses.jsonl") + variant = manifest["variant"] + + puzzle_frames = { + key: load_dataset_frame( + spec, + variant=variant, + difficulty="all", + limit=None, + ) + for key, spec in PUZZLES.items() + } + row_lookups = { + key: build_row_lookup(frame) + for key, frame in puzzle_frames.items() + } + + detail_rows: list[dict[str, Any]] = [] + for record in records: + puzzlename = record["puzzlename"] + spec = PUZZLES[puzzlename] + row = row_lookups[puzzlename][record["filename"]] + extracted_board = extract_board(record.get("response_text", "")) + decoded_problem = decode_board_for_variant( + row["problem"], + variant, + spec.verifier_type, + ) + decoded_board = decode_board_for_variant( + extracted_board, + variant, + spec.verifier_type, + ) + args = row.get("args") or record.get("args") or spec.default_args + + if spec.verifier_type == "flow_free": + verification = verify_flow_free(decoded_problem or "", decoded_board or "") + else: + verification = verify_with_rlp( + puzzle_type=spec.verifier_type, + problem_ascii=decoded_problem or "", + extracted_board=decoded_board or "", + args=args, + ) + + detail_rows.append( + { + "filename": record["filename"], + "puzzlename": puzzlename, + "difficulty": row["difficulty"], + "provider": record["provider"], + "model": record["model"], + "variant": variant, + "args": args, + "prompt_file": record["prompt_file"], + "board_exists": verification["board_exists"], + "board_valid": verification["board_valid"], + "board_modified": verification["board_modified"], + "correct": verification["correct"], + "input_tokens": record.get("input_tokens"), + "output_tokens": record.get("output_tokens"), + "total_tokens": record.get("total_tokens"), + "response_text": record.get("response_text", ""), + "decoded_problem": decoded_problem, + "decoded_board": decoded_board, + } + ) + + detail_frame = pd.DataFrame(detail_rows) + summary_frame = summarize(detail_frame) + + REPORTS_DIR.mkdir(parents=True, exist_ok=True) + detail_csv = REPORTS_DIR / f"{run_dir.name}_details.csv" + summary_csv = REPORTS_DIR / f"{run_dir.name}_summary.csv" + detail_frame.to_csv(detail_csv, index=False) + summary_frame.to_csv(summary_csv, index=False) + write_json( + REPORTS_DIR / f"{run_dir.name}_summary.json", + { + "run_dir": str(run_dir), + "rows": len(detail_frame), + "summary_rows": len(summary_frame), + }, + ) + + print(summary_frame.to_string(index=False)) + print(f"\nDetailed CSV: {detail_csv}") + print(f"Summary CSV: {summary_csv}") + + return {"detail_csv": detail_csv, "summary_csv": summary_csv} diff --git a/evals/src/main.py b/evals/src/main.py new file mode 100644 index 0000000000000000000000000000000000000000..489e39a809c180708b6d53b02d738c1f39eb5d04 --- /dev/null +++ b/evals/src/main.py @@ -0,0 +1,150 @@ +from __future__ import annotations + +import argparse +from pathlib import Path + +from clients import parse_request_args +from evals import run_benchmarks +from puzzles import RUNS_DIR, list_puzzle_names + + +def build_parser() -> argparse.ArgumentParser: + parser = argparse.ArgumentParser( + description="Run TopoBench benchmark evaluations and verify them locally." + ) + subparsers = parser.add_subparsers(dest="command", required=True) + + run_parser = subparsers.add_parser("run", help="Run one or more puzzle benchmarks.") + add_run_arguments(run_parser) + + verify_parser = subparsers.add_parser( + "verify", + help="Verify a completed run using the copied submodule verifiers.", + ) + verify_parser.add_argument( + "--run-dir", + required=True, + type=Path, + help="Run directory under results/runs/ or an absolute path.", + ) + + combined_parser = subparsers.add_parser( + "run-and-verify", + help="Run the benchmark and immediately verify it.", + ) + add_run_arguments(combined_parser) + + return parser + + +def add_run_arguments(parser: argparse.ArgumentParser) -> None: + parser.add_argument( + "--provider", + required=True, + choices=["openai", "openrouter", "deepseek", "anthropic", "google"], + help="Which API provider client to use.", + ) + parser.add_argument( + "--model", + required=True, + help="Provider-specific model id.", + ) + parser.add_argument( + "--variant", + default="plain", + choices=["plain", "intformat", "intformat_json"], + help="Which published dataset/prompt variant to use.", + ) + parser.add_argument( + "--difficulty", + default="all", + choices=["all", "easy", "medium", "hard"], + help="Filter benchmark rows by difficulty.", + ) + parser.add_argument( + "--puzzle", + action="append", + choices=["all", *list_puzzle_names()], + help="Puzzle(s) to run. Repeat the flag to select several. Defaults to all.", + ) + parser.add_argument( + "--limit", + type=int, + default=None, + help="Maximum number of rows per selected puzzle after filtering.", + ) + parser.add_argument( + "--max-output-tokens", + type=int, + default=8192, + help="Provider output token limit.", + ) + parser.add_argument( + "--temperature", + type=float, + default=None, + help="Optional sampling temperature.", + ) + parser.add_argument( + "--request-arg", + action="append", + default=[], + help="Extra provider request arg in KEY=VALUE form. VALUE may be JSON.", + ) + parser.add_argument( + "--run-name", + default=None, + help="Optional custom run directory name.", + ) + parser.add_argument( + "--overwrite", + action="store_true", + help="Overwrite an existing run directory of the same name.", + ) + + +def resolve_run_dir(path: Path) -> Path: + if path.is_absolute(): + return path + return RUNS_DIR / path + + +def main() -> None: + parser = build_parser() + args = parser.parse_args() + + if args.command == "verify": + from evals_verifier import verify_run + + verify_run(resolve_run_dir(args.run_dir)) + return + + request_args = parse_request_args(args.request_arg) + run_dir = run_benchmarks( + provider=args.provider, + model=args.model, + variant=args.variant, + difficulty=args.difficulty, + puzzle_names=args.puzzle or ["all"], + limit=args.limit, + max_output_tokens=args.max_output_tokens, + temperature=args.temperature, + request_args=request_args, + run_name=args.run_name, + overwrite=args.overwrite, + ) + print(f"Run saved to: {run_dir}") + + if args.command == "run-and-verify": + from evals_verifier import verify_run + + verify_run(run_dir) + + +if __name__ == "__main__": + try: + main() + except KeyboardInterrupt: + raise SystemExit("Interrupted.") + except Exception as exc: + raise SystemExit(str(exc)) diff --git a/evals/src/puzzles.py b/evals/src/puzzles.py new file mode 100644 index 0000000000000000000000000000000000000000..7bffd49a79f606ff657f40bdc815eb91b3be44d9 --- /dev/null +++ b/evals/src/puzzles.py @@ -0,0 +1,140 @@ +from __future__ import annotations + +from dataclasses import dataclass +from pathlib import Path +from typing import Iterable + +import pandas as pd +from datasets import load_dataset + + +ROOT_DIR = Path(__file__).resolve().parents[2] +EVALS_DIR = ROOT_DIR / "evals" +PROMPTS_DIR = EVALS_DIR / "prompts" +RESULTS_DIR = ROOT_DIR / "results" +RUNS_DIR = RESULTS_DIR / "runs" +REPORTS_DIR = RESULTS_DIR / "reports" +MAPPINGS_DIR = ROOT_DIR / "mappings" / "topobench_mappings" +SUBMODULES_DIR = ROOT_DIR / "submodules" + +DATASET_REPOS = { + "plain": "topobench/topobench", + "intformat": "topobench/topobench_intformat", + "intformat_json": "topobench/topobench_intformat_json", +} + + +@dataclass(frozen=True) +class PuzzleSpec: + key: str + dataset_name: str + prompt_stem: str + verifier_type: str + default_args: str + + def prompt_path(self, variant: str) -> Path: + suffix = { + "plain": ".txt", + "intformat": "_intformat.txt", + "intformat_json": "_intformat_json.txt", + }[variant] + return PROMPTS_DIR / f"{self.prompt_stem}{suffix}" + + +PUZZLES: dict[str, PuzzleSpec] = { + "bridges": PuzzleSpec( + key="bridges", + dataset_name="bridges", + prompt_stem="bridges", + verifier_type="bridges", + default_args="5x5deL", + ), + "flow_free": PuzzleSpec( + key="flow_free", + dataset_name="flow_free", + prompt_stem="flow_free", + verifier_type="flow_free", + default_args="5x5", + ), + "galaxies": PuzzleSpec( + key="galaxies", + dataset_name="galaxies", + prompt_stem="galaxies", + verifier_type="galaxies", + default_args="4x4", + ), + "loopy": PuzzleSpec( + key="loopy", + dataset_name="loopy", + prompt_stem="loopy", + verifier_type="loopy", + default_args="5x5t0", + ), + "pattern": PuzzleSpec( + key="pattern", + dataset_name="pattern", + prompt_stem="pattern", + verifier_type="pattern", + default_args="5x5", + ), + "undead": PuzzleSpec( + key="undead", + dataset_name="undead", + prompt_stem="undead", + verifier_type="undead", + default_args="4x4", + ), +} + + +def get_puzzle(name: str) -> PuzzleSpec: + try: + return PUZZLES[name] + except KeyError as exc: + valid = ", ".join(sorted(PUZZLES)) + raise ValueError(f"Unknown puzzle '{name}'. Valid values: {valid}") from exc + + +def list_puzzle_names() -> list[str]: + return sorted(PUZZLES) + + +def expand_puzzles(names: Iterable[str]) -> list[PuzzleSpec]: + items = list(names) + if not items or items == ["all"]: + return [PUZZLES[name] for name in list_puzzle_names()] + return [get_puzzle(name) for name in items] + + +def load_prompt(puzzle: PuzzleSpec, variant: str) -> str: + return puzzle.prompt_path(variant).read_text(encoding="utf-8") + + +def load_dataset_frame( + puzzle: PuzzleSpec, + *, + variant: str, + difficulty: str, + limit: int | None, + split: str = "test", +) -> pd.DataFrame: + repo_id = DATASET_REPOS[variant] + frame = load_dataset(repo_id, split=split).to_pandas() + frame = frame[frame["puzzlename"] == puzzle.dataset_name].copy() + + if "include" in frame.columns: + frame = frame[frame["include"].fillna(False)] + + if difficulty != "all": + frame = frame[frame["difficulty"] == difficulty] + + frame = frame.sort_values(["difficulty", "filename"]).reset_index(drop=True) + + if limit is not None: + frame = frame.head(limit).copy() + + return frame.reset_index(drop=True) + + +def build_row_lookup(frame: pd.DataFrame) -> dict[str, pd.Series]: + return {row["filename"]: row for _, row in frame.iterrows()} diff --git a/figure1.png b/figure1.png new file mode 100644 index 0000000000000000000000000000000000000000..bacede6a5a3e9d091bf2aca6ce5069e8a5dba990 --- /dev/null +++ b/figure1.png @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:76ad0c523cacc973ec409f29f50cf058b028d6927dd0782e6f6a11f9f96d294b +size 4486299 diff --git a/frontend/.gitignore b/frontend/.gitignore new file mode 100644 index 0000000000000000000000000000000000000000..a547bf36d8d11a4f89c59c144f24795749086dd1 --- /dev/null +++ b/frontend/.gitignore @@ -0,0 +1,24 @@ +# Logs +logs +*.log +npm-debug.log* +yarn-debug.log* +yarn-error.log* +pnpm-debug.log* +lerna-debug.log* + +node_modules +dist +dist-ssr +*.local + +# Editor directories and files +.vscode/* +!.vscode/extensions.json +.idea +.DS_Store +*.suo +*.ntvs* +*.njsproj +*.sln +*.sw? diff --git a/frontend/README.md b/frontend/README.md new file mode 100644 index 0000000000000000000000000000000000000000..7dbf7ebf3b2a3d84ad526bc47810d1d211331b8b --- /dev/null +++ b/frontend/README.md @@ -0,0 +1,73 @@ +# React + TypeScript + Vite + +This template provides a minimal setup to get React working in Vite with HMR and some ESLint rules. + +Currently, two official plugins are available: + +- [@vitejs/plugin-react](https://github.com/vitejs/vite-plugin-react/blob/main/packages/plugin-react) uses [Oxc](https://oxc.rs) +- [@vitejs/plugin-react-swc](https://github.com/vitejs/vite-plugin-react/blob/main/packages/plugin-react-swc) uses [SWC](https://swc.rs/) + +## React Compiler + +The React Compiler is not enabled on this template because of its impact on dev & build performances. To add it, see [this documentation](https://react.dev/learn/react-compiler/installation). + +## Expanding the ESLint configuration + +If you are developing a production application, we recommend updating the configuration to enable type-aware lint rules: + +```js +export default defineConfig([ + globalIgnores(['dist']), + { + files: ['**/*.{ts,tsx}'], + extends: [ + // Other configs... + + // Remove tseslint.configs.recommended and replace with this + tseslint.configs.recommendedTypeChecked, + // Alternatively, use this for stricter rules + tseslint.configs.strictTypeChecked, + // Optionally, add this for stylistic rules + tseslint.configs.stylisticTypeChecked, + + // Other configs... + ], + languageOptions: { + parserOptions: { + project: ['./tsconfig.node.json', './tsconfig.app.json'], + tsconfigRootDir: import.meta.dirname, + }, + // other options... + }, + }, +]) +``` + +You can also install [eslint-plugin-react-x](https://github.com/Rel1cx/eslint-react/tree/main/packages/plugins/eslint-plugin-react-x) and [eslint-plugin-react-dom](https://github.com/Rel1cx/eslint-react/tree/main/packages/plugins/eslint-plugin-react-dom) for React-specific lint rules: + +```js +// eslint.config.js +import reactX from 'eslint-plugin-react-x' +import reactDom from 'eslint-plugin-react-dom' + +export default defineConfig([ + globalIgnores(['dist']), + { + files: ['**/*.{ts,tsx}'], + extends: [ + // Other configs... + // Enable lint rules for React + reactX.configs['recommended-typescript'], + // Enable lint rules for React DOM + reactDom.configs.recommended, + ], + languageOptions: { + parserOptions: { + project: ['./tsconfig.node.json', './tsconfig.app.json'], + tsconfigRootDir: import.meta.dirname, + }, + // other options... + }, + }, +]) +``` diff --git a/frontend/eslint.config.js b/frontend/eslint.config.js new file mode 100644 index 0000000000000000000000000000000000000000..ef614d25c11dd1e89a8df0b2eaf934170b44daa8 --- /dev/null +++ b/frontend/eslint.config.js @@ -0,0 +1,22 @@ +import js from '@eslint/js' +import globals from 'globals' +import reactHooks from 'eslint-plugin-react-hooks' +import reactRefresh from 'eslint-plugin-react-refresh' +import tseslint from 'typescript-eslint' +import { defineConfig, globalIgnores } from 'eslint/config' + +export default defineConfig([ + globalIgnores(['dist']), + { + files: ['**/*.{ts,tsx}'], + extends: [ + js.configs.recommended, + tseslint.configs.recommended, + reactHooks.configs.flat.recommended, + reactRefresh.configs.vite, + ], + languageOptions: { + globals: globals.browser, + }, + }, +]) diff --git a/frontend/index.html b/frontend/index.html new file mode 100644 index 0000000000000000000000000000000000000000..0fca6f0434183b2c6f46d5336c59f6954c56b470 --- /dev/null +++ b/frontend/index.html @@ -0,0 +1,13 @@ + + + + + + + frontend + + +
+ + + diff --git a/frontend/package-lock.json b/frontend/package-lock.json new file mode 100644 index 0000000000000000000000000000000000000000..7213bb8c9212c71307e79e7584d5c7c7d784895b --- /dev/null +++ b/frontend/package-lock.json @@ -0,0 +1,2793 @@ +{ + "name": "frontend", + "version": "0.0.0", + "lockfileVersion": 3, + "requires": true, + "packages": { + "": { + "name": "frontend", + "version": "0.0.0", + "dependencies": { + "react": "^19.2.6", + "react-dom": "^19.2.6", + "react-router-dom": "^7.9.6" + }, + "devDependencies": { + "@eslint/js": "^10.0.1", + "@types/node": "^24.12.3", + "@types/react": "^19.2.14", + "@types/react-dom": "^19.2.3", + "@vitejs/plugin-react": "^6.0.1", + "eslint": "^10.3.0", + "eslint-plugin-react-hooks": "^7.1.1", + "eslint-plugin-react-refresh": "^0.5.2", + "globals": "^17.6.0", + "typescript": "~6.0.2", + "typescript-eslint": "^8.59.2", + "vite": "^8.0.12" + } + }, + "node_modules/@babel/code-frame": { + "version": "7.29.0", + "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.29.0.tgz", + "integrity": "sha512-9NhCeYjq9+3uxgdtp20LSiJXJvN0FeCtNGpJxuMFZ1Kv3cWUNb6DOhJwUvcVCzKGR66cw4njwM6hrJLqgOwbcw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/helper-validator-identifier": "^7.28.5", + "js-tokens": "^4.0.0", + "picocolors": "^1.1.1" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/compat-data": { + "version": "7.29.3", + "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.29.3.tgz", + "integrity": "sha512-LIVqM46zQWZhj17qA8wb4nW/ixr2y1Nw+r1etiAWgRM6U1IqP+LNhL1yg440jYZR72jCWcWbLWzIosH+uP1fqg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/core": { + "version": "7.29.0", + "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.29.0.tgz", + "integrity": "sha512-CGOfOJqWjg2qW/Mb6zNsDm+u5vFQ8DxXfbM09z69p5Z6+mE1ikP2jUXw+j42Pf1XTYED2Rni5f95npYeuwMDQA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/code-frame": "^7.29.0", + "@babel/generator": "^7.29.0", + "@babel/helper-compilation-targets": "^7.28.6", + "@babel/helper-module-transforms": "^7.28.6", + "@babel/helpers": "^7.28.6", + "@babel/parser": "^7.29.0", + "@babel/template": "^7.28.6", + "@babel/traverse": "^7.29.0", + "@babel/types": "^7.29.0", + "@jridgewell/remapping": "^2.3.5", + "convert-source-map": "^2.0.0", + "debug": "^4.1.0", + "gensync": "^1.0.0-beta.2", + "json5": "^2.2.3", + "semver": "^6.3.1" + }, + "engines": { + "node": ">=6.9.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/babel" + } + }, + "node_modules/@babel/generator": { + "version": "7.29.1", + "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.29.1.tgz", + "integrity": "sha512-qsaF+9Qcm2Qv8SRIMMscAvG4O3lJ0F1GuMo5HR/Bp02LopNgnZBC/EkbevHFeGs4ls/oPz9v+Bsmzbkbe+0dUw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/parser": "^7.29.0", + "@babel/types": "^7.29.0", + "@jridgewell/gen-mapping": "^0.3.12", + "@jridgewell/trace-mapping": "^0.3.28", + "jsesc": "^3.0.2" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-compilation-targets": { + "version": "7.28.6", + "resolved": "https://registry.npmjs.org/@babel/helper-compilation-targets/-/helper-compilation-targets-7.28.6.tgz", + "integrity": "sha512-JYtls3hqi15fcx5GaSNL7SCTJ2MNmjrkHXg4FSpOA/grxK8KwyZ5bubHsCq8FXCkua6xhuaaBit+3b7+VZRfcA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/compat-data": "^7.28.6", + "@babel/helper-validator-option": "^7.27.1", + "browserslist": "^4.24.0", + "lru-cache": "^5.1.1", + "semver": "^6.3.1" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-globals": { + "version": "7.28.0", + "resolved": "https://registry.npmjs.org/@babel/helper-globals/-/helper-globals-7.28.0.tgz", + "integrity": "sha512-+W6cISkXFa1jXsDEdYA8HeevQT/FULhxzR99pxphltZcVaugps53THCeiWA8SguxxpSp3gKPiuYfSWopkLQ4hw==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-module-imports": { + "version": "7.28.6", + "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.28.6.tgz", + "integrity": "sha512-l5XkZK7r7wa9LucGw9LwZyyCUscb4x37JWTPz7swwFE/0FMQAGpiWUZn8u9DzkSBWEcK25jmvubfpw2dnAMdbw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/traverse": "^7.28.6", + "@babel/types": "^7.28.6" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-module-transforms": { + "version": "7.28.6", + "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.28.6.tgz", + "integrity": "sha512-67oXFAYr2cDLDVGLXTEABjdBJZ6drElUSI7WKp70NrpyISso3plG9SAGEF6y7zbha/wOzUByWWTJvEDVNIUGcA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/helper-module-imports": "^7.28.6", + "@babel/helper-validator-identifier": "^7.28.5", + "@babel/traverse": "^7.28.6" + }, + "engines": { + "node": ">=6.9.0" + }, + "peerDependencies": { + "@babel/core": "^7.0.0" + } + }, + "node_modules/@babel/helper-string-parser": { + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.27.1.tgz", + "integrity": "sha512-qMlSxKbpRlAridDExk92nSobyDdpPijUq2DW6oDnUqd0iOGxmQjyqhMIihI9+zv4LPyZdRje2cavWPbCbWm3eA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-validator-identifier": { + "version": "7.28.5", + "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.28.5.tgz", + "integrity": "sha512-qSs4ifwzKJSV39ucNjsvc6WVHs6b7S03sOh2OcHF9UHfVPqWWALUsNUVzhSBiItjRZoLHx7nIarVjqKVusUZ1Q==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helper-validator-option": { + "version": "7.27.1", + "resolved": "https://registry.npmjs.org/@babel/helper-validator-option/-/helper-validator-option-7.27.1.tgz", + "integrity": "sha512-YvjJow9FxbhFFKDSuFnVCe2WxXk1zWc22fFePVNEaWJEu8IrZVlda6N0uHwzZrUM1il7NC9Mlp4MaJYbYd9JSg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/helpers": { + "version": "7.29.2", + "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.29.2.tgz", + "integrity": "sha512-HoGuUs4sCZNezVEKdVcwqmZN8GoHirLUcLaYVNBK2J0DadGtdcqgr3BCbvH8+XUo4NGjNl3VOtSjEKNzqfFgKw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/template": "^7.28.6", + "@babel/types": "^7.29.0" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/parser": { + "version": "7.29.3", + "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.29.3.tgz", + "integrity": "sha512-b3ctpQwp+PROvU/cttc4OYl4MzfJUWy6FZg+PMXfzmt/+39iHVF0sDfqay8TQM3JA2EUOyKcFZt75jWriQijsA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/types": "^7.29.0" + }, + "bin": { + "parser": "bin/babel-parser.js" + }, + "engines": { + "node": ">=6.0.0" + } + }, + "node_modules/@babel/template": { + "version": "7.28.6", + "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.28.6.tgz", + "integrity": "sha512-YA6Ma2KsCdGb+WC6UpBVFJGXL58MDA6oyONbjyF/+5sBgxY/dwkhLogbMT2GXXyU84/IhRw/2D1Os1B/giz+BQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/code-frame": "^7.28.6", + "@babel/parser": "^7.28.6", + "@babel/types": "^7.28.6" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/traverse": { + "version": "7.29.0", + "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.29.0.tgz", + "integrity": "sha512-4HPiQr0X7+waHfyXPZpWPfWL/J7dcN1mx9gL6WdQVMbPnF3+ZhSMs8tCxN7oHddJE9fhNE7+lxdnlyemKfJRuA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/code-frame": "^7.29.0", + "@babel/generator": "^7.29.0", + "@babel/helper-globals": "^7.28.0", + "@babel/parser": "^7.29.0", + "@babel/template": "^7.28.6", + "@babel/types": "^7.29.0", + "debug": "^4.3.1" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@babel/types": { + "version": "7.29.0", + "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.29.0.tgz", + "integrity": "sha512-LwdZHpScM4Qz8Xw2iKSzS+cfglZzJGvofQICy7W7v4caru4EaAmyUuO6BGrbyQ2mYV11W0U8j5mBhd14dd3B0A==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/helper-string-parser": "^7.27.1", + "@babel/helper-validator-identifier": "^7.28.5" + }, + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/@emnapi/core": { + "version": "1.10.0", + "resolved": "https://registry.npmjs.org/@emnapi/core/-/core-1.10.0.tgz", + "integrity": "sha512-yq6OkJ4p82CAfPl0u9mQebQHKPJkY7WrIuk205cTYnYe+k2Z8YBh11FrbRG/H6ihirqcacOgl2BIO8oyMQLeXw==", + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "@emnapi/wasi-threads": "1.2.1", + "tslib": "^2.4.0" + } + }, + "node_modules/@emnapi/runtime": { + "version": "1.10.0", + "resolved": "https://registry.npmjs.org/@emnapi/runtime/-/runtime-1.10.0.tgz", + "integrity": "sha512-ewvYlk86xUoGI0zQRNq/mC+16R1QeDlKQy21Ki3oSYXNgLb45GV1P6A0M+/s6nyCuNDqe5VpaY84BzXGwVbwFA==", + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "tslib": "^2.4.0" + } + }, + "node_modules/@emnapi/wasi-threads": { + "version": "1.2.1", + "resolved": "https://registry.npmjs.org/@emnapi/wasi-threads/-/wasi-threads-1.2.1.tgz", + "integrity": "sha512-uTII7OYF+/Mes/MrcIOYp5yOtSMLBWSIoLPpcgwipoiKbli6k322tcoFsxoIIxPDqW01SQGAgko4EzZi2BNv2w==", + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "tslib": "^2.4.0" + } + }, + "node_modules/@eslint-community/eslint-utils": { + "version": "4.9.1", + "resolved": "https://registry.npmjs.org/@eslint-community/eslint-utils/-/eslint-utils-4.9.1.tgz", + "integrity": "sha512-phrYmNiYppR7znFEdqgfWHXR6NCkZEK7hwWDHZUjit/2/U0r6XvkDl0SYnoM51Hq7FhCGdLDT6zxCCOY1hexsQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "eslint-visitor-keys": "^3.4.3" + }, + "engines": { + "node": "^12.22.0 || ^14.17.0 || >=16.0.0" + }, + "funding": { + "url": "https://opencollective.com/eslint" + }, + "peerDependencies": { + "eslint": "^6.0.0 || ^7.0.0 || >=8.0.0" + } + }, + "node_modules/@eslint-community/eslint-utils/node_modules/eslint-visitor-keys": { + "version": "3.4.3", + "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-3.4.3.tgz", + "integrity": "sha512-wpc+LXeiyiisxPlEkUzU6svyS1frIO3Mgxj1fdy7Pm8Ygzguax2N3Fa/D/ag1WqbOprdI+uY6wMUl8/a2G+iag==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": "^12.22.0 || ^14.17.0 || >=16.0.0" + }, + "funding": { + "url": "https://opencollective.com/eslint" + } + }, + "node_modules/@eslint-community/regexpp": { + "version": "4.12.2", + "resolved": "https://registry.npmjs.org/@eslint-community/regexpp/-/regexpp-4.12.2.tgz", + "integrity": "sha512-EriSTlt5OC9/7SXkRSCAhfSxxoSUgBm33OH+IkwbdpgoqsSsUg7y3uh+IICI/Qg4BBWr3U2i39RpmycbxMq4ew==", + "dev": true, + "license": "MIT", + "engines": { + "node": "^12.0.0 || ^14.0.0 || >=16.0.0" + } + }, + "node_modules/@eslint/config-array": { + "version": "0.23.5", + "resolved": "https://registry.npmjs.org/@eslint/config-array/-/config-array-0.23.5.tgz", + "integrity": "sha512-Y3kKLvC1dvTOT+oGlqNQ1XLqK6D1HU2YXPc52NmAlJZbMMWDzGYXMiPRJ8TYD39muD/OTjlZmNJ4ib7dvSrMBA==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@eslint/object-schema": "^3.0.5", + "debug": "^4.3.1", + "minimatch": "^10.2.4" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + } + }, + "node_modules/@eslint/config-helpers": { + "version": "0.6.0", + "resolved": "https://registry.npmjs.org/@eslint/config-helpers/-/config-helpers-0.6.0.tgz", + "integrity": "sha512-ii6Bw9jJ2zi2cWA2Z+9/QZ/+3DX6kwaV5Q986D/CdP3Lap3w/pgQZ373FV7byY/i7L4IRH/G43I5dz1ClsCbpA==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@eslint/core": "^1.2.1" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + } + }, + "node_modules/@eslint/core": { + "version": "1.2.1", + "resolved": "https://registry.npmjs.org/@eslint/core/-/core-1.2.1.tgz", + "integrity": "sha512-MwcE1P+AZ4C6DWlpin/OmOA54mmIZ/+xZuJiQd4SyB29oAJjN30UW9wkKNptW2ctp4cEsvhlLY/CsQ1uoHDloQ==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@types/json-schema": "^7.0.15" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + } + }, + "node_modules/@eslint/js": { + "version": "10.0.1", + "resolved": "https://registry.npmjs.org/@eslint/js/-/js-10.0.1.tgz", + "integrity": "sha512-zeR9k5pd4gxjZ0abRoIaxdc7I3nDktoXZk2qOv9gCNWx3mVwEn32VRhyLaRsDiJjTs0xq/T8mfPtyuXu7GWBcA==", + "dev": true, + "license": "MIT", + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + }, + "funding": { + "url": "https://eslint.org/donate" + }, + "peerDependencies": { + "eslint": "^10.0.0" + }, + "peerDependenciesMeta": { + "eslint": { + "optional": true + } + } + }, + "node_modules/@eslint/object-schema": { + "version": "3.0.5", + "resolved": "https://registry.npmjs.org/@eslint/object-schema/-/object-schema-3.0.5.tgz", + "integrity": "sha512-vqTaUEgxzm+YDSdElad6PiRoX4t8VGDjCtt05zn4nU810UIx/uNEV7/lZJ6KwFThKZOzOxzXy48da+No7HZaMw==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + } + }, + "node_modules/@eslint/plugin-kit": { + "version": "0.7.1", + "resolved": "https://registry.npmjs.org/@eslint/plugin-kit/-/plugin-kit-0.7.1.tgz", + "integrity": "sha512-rZAP3aVgB9ds9KOeUSL+zZ21hPmo8dh6fnIFwRQj5EAZl9gzR7wxYbYXYysAM8CTqGmUGyp2S4kUdV17MnGuWQ==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@eslint/core": "^1.2.1", + "levn": "^0.4.1" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + } + }, + "node_modules/@humanfs/core": { + "version": "0.19.2", + "resolved": "https://registry.npmjs.org/@humanfs/core/-/core-0.19.2.tgz", + "integrity": "sha512-UhXNm+CFMWcbChXywFwkmhqjs3PRCmcSa/hfBgLIb7oQ5HNb1wS0icWsGtSAUNgefHeI+eBrA8I1fxmbHsGdvA==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@humanfs/types": "^0.15.0" + }, + "engines": { + "node": ">=18.18.0" + } + }, + "node_modules/@humanfs/node": { + "version": "0.16.8", + "resolved": "https://registry.npmjs.org/@humanfs/node/-/node-0.16.8.tgz", + "integrity": "sha512-gE1eQNZ3R++kTzFUpdGlpmy8kDZD/MLyHqDwqjkVQI0JMdI1D51sy1H958PNXYkM2rAac7e5/CnIKZrHtPh3BQ==", + "dev": true, + "license": "Apache-2.0", + "dependencies": { + "@humanfs/core": "^0.19.2", + "@humanfs/types": "^0.15.0", + "@humanwhocodes/retry": "^0.4.0" + }, + "engines": { + "node": ">=18.18.0" + } + }, + "node_modules/@humanfs/types": { + "version": "0.15.0", + "resolved": "https://registry.npmjs.org/@humanfs/types/-/types-0.15.0.tgz", + "integrity": "sha512-ZZ1w0aoQkwuUuC7Yf+7sdeaNfqQiiLcSRbfI08oAxqLtpXQr9AIVX7Ay7HLDuiLYAaFPu8oBYNq/QIi9URHJ3Q==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": ">=18.18.0" + } + }, + "node_modules/@humanwhocodes/module-importer": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@humanwhocodes/module-importer/-/module-importer-1.0.1.tgz", + "integrity": "sha512-bxveV4V8v5Yb4ncFTT3rPSgZBOpCkjfK0y4oVVVJwIuDVBRMDXrPyXRL988i5ap9m9bnyEEjWfm5WkBmtffLfA==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": ">=12.22" + }, + "funding": { + "type": "github", + "url": "https://github.com/sponsors/nzakas" + } + }, + "node_modules/@humanwhocodes/retry": { + "version": "0.4.3", + "resolved": "https://registry.npmjs.org/@humanwhocodes/retry/-/retry-0.4.3.tgz", + "integrity": "sha512-bV0Tgo9K4hfPCek+aMAn81RppFKv2ySDQeMoSZuvTASywNTnVJCArCZE2FWqpvIatKu7VMRLWlR1EazvVhDyhQ==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": ">=18.18" + }, + "funding": { + "type": "github", + "url": "https://github.com/sponsors/nzakas" + } + }, + "node_modules/@jridgewell/gen-mapping": { + "version": "0.3.13", + "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.13.tgz", + "integrity": "sha512-2kkt/7niJ6MgEPxF0bYdQ6etZaA+fQvDcLKckhy1yIQOzaoKjBBjSj63/aLVjYE3qhRt5dvM+uUyfCg6UKCBbA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@jridgewell/sourcemap-codec": "^1.5.0", + "@jridgewell/trace-mapping": "^0.3.24" + } + }, + "node_modules/@jridgewell/remapping": { + "version": "2.3.5", + "resolved": "https://registry.npmjs.org/@jridgewell/remapping/-/remapping-2.3.5.tgz", + "integrity": "sha512-LI9u/+laYG4Ds1TDKSJW2YPrIlcVYOwi2fUC6xB43lueCjgxV4lffOCZCtYFiH6TNOX+tQKXx97T4IKHbhyHEQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@jridgewell/gen-mapping": "^0.3.5", + "@jridgewell/trace-mapping": "^0.3.24" + } + }, + "node_modules/@jridgewell/resolve-uri": { + "version": "3.1.2", + "resolved": "https://registry.npmjs.org/@jridgewell/resolve-uri/-/resolve-uri-3.1.2.tgz", + "integrity": "sha512-bRISgCIjP20/tbWSPWMEi54QVPRZExkuD9lJL+UIxUKtwVJA8wW1Trb1jMs1RFXo1CBTNZ/5hpC9QvmKWdopKw==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.0.0" + } + }, + "node_modules/@jridgewell/sourcemap-codec": { + "version": "1.5.5", + "resolved": "https://registry.npmjs.org/@jridgewell/sourcemap-codec/-/sourcemap-codec-1.5.5.tgz", + "integrity": "sha512-cYQ9310grqxueWbl+WuIUIaiUaDcj7WOq5fVhEljNVgRfOUhY9fy2zTvfoqWsnebh8Sl70VScFbICvJnLKB0Og==", + "dev": true, + "license": "MIT" + }, + "node_modules/@jridgewell/trace-mapping": { + "version": "0.3.31", + "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.31.tgz", + "integrity": "sha512-zzNR+SdQSDJzc8joaeP8QQoCQr8NuYx2dIIytl1QeBEZHJ9uW6hebsrYgbz8hJwUQao3TWCMtmfV8Nu1twOLAw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@jridgewell/resolve-uri": "^3.1.0", + "@jridgewell/sourcemap-codec": "^1.4.14" + } + }, + "node_modules/@napi-rs/wasm-runtime": { + "version": "1.1.4", + "resolved": "https://registry.npmjs.org/@napi-rs/wasm-runtime/-/wasm-runtime-1.1.4.tgz", + "integrity": "sha512-3NQNNgA1YSlJb/kMH1ildASP9HW7/7kYnRI2szWJaofaS1hWmbGI4H+d3+22aGzXXN9IJ+n+GiFVcGipJP18ow==", + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "@tybys/wasm-util": "^0.10.1" + }, + "funding": { + "type": "github", + "url": "https://github.com/sponsors/Brooooooklyn" + }, + "peerDependencies": { + "@emnapi/core": "^1.7.1", + "@emnapi/runtime": "^1.7.1" + } + }, + "node_modules/@oxc-project/types": { + "version": "0.130.0", + "resolved": "https://registry.npmjs.org/@oxc-project/types/-/types-0.130.0.tgz", + "integrity": "sha512-ibD2usx9JRu7f5pu2tMKMI4cpA4NgXJQoYRP4pQ7Pxmn1l6k/53qWtQWZayhYy3X4QZkt90Ot+mJEaeXouio6Q==", + "dev": true, + "license": "MIT", + "funding": { + "url": "https://github.com/sponsors/Boshen" + } + }, + "node_modules/@rolldown/binding-android-arm64": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-android-arm64/-/binding-android-arm64-1.0.1.tgz", + "integrity": "sha512-fJI3I0r3C3Oj/zdBCpaCmBRZYf07xpaq4yCfDDoSFm+beWNzbIl26puW8RraUdugoJw/95zerNOn6jasAhzSmg==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "android" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-darwin-arm64": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-arm64/-/binding-darwin-arm64-1.0.1.tgz", + "integrity": "sha512-cKnAhWEsV7TPcA/5EAteDp6KcJZBQ2G+BqE7zayMMi7kMvwRsbv7WT9aOnn0WNl4SKEIf43vjS31iUPu80nzXg==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-darwin-x64": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-x64/-/binding-darwin-x64-1.0.1.tgz", + "integrity": "sha512-YKrVwQjIRBPo+5G/u03wGjbdy4q7pyzCe93DK9VJ7zkVmeg8LJ7GbgsiHWdR4xSoe4CAXRD7Bcjgbtr64bkXNg==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-freebsd-x64": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-freebsd-x64/-/binding-freebsd-x64-1.0.1.tgz", + "integrity": "sha512-z/oBsREo46SsFqBwYtFe0kpJeBijAT48O/WXLI4suiCLBkr03RTtTJMCzSdDd2znlh8VJizL09XVkQgk8IZonw==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "freebsd" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-arm-gnueabihf": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm-gnueabihf/-/binding-linux-arm-gnueabihf-1.0.1.tgz", + "integrity": "sha512-ik8q7GM11zxvYxFc2PeDcT6TBvhCQMaUxfph/M5l9sKuTs/Sjg3L+Byw0F7w0ZVLBZmx30P+gG0ECzzN+MFcmQ==", + "cpu": [ + "arm" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-arm64-gnu": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-gnu/-/binding-linux-arm64-gnu-1.0.1.tgz", + "integrity": "sha512-QoSx2EkyrrdZ6kcyE8stqZ62t0Yra8Fs5ia9lOxJrh6TMQJK7gQKmscdTHf7pOXKREKrVwOtJcQG3qVSfc866A==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-arm64-musl": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-musl/-/binding-linux-arm64-musl-1.0.1.tgz", + "integrity": "sha512-uwNwFpwKeNiZawfAWBgg0VIztPTV3ihhh1vV334h9ivnNLorxnQMU6Fz8wG1Zb4Qh9LC1/MkcyT3YlDXG3Rsgg==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-ppc64-gnu": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-ppc64-gnu/-/binding-linux-ppc64-gnu-1.0.1.tgz", + "integrity": "sha512-zY1bul7OWr7DFBiJ++wofXvnr8B45ce3QsQUhKrIhXsygAh7bTkwyeM1bi1a2g5C/yC/N8TZyGDEoMfm/l9mpg==", + "cpu": [ + "ppc64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-s390x-gnu": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-s390x-gnu/-/binding-linux-s390x-gnu-1.0.1.tgz", + "integrity": "sha512-0frlsT/f4Ft6I7SMESTKnF3cZsdicQn1dCMkF/jT9wDLE+gGoiQfv1nmT9e+s7s/fekvvy6tZM2jHvI2tkbJDQ==", + "cpu": [ + "s390x" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-x64-gnu": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-gnu/-/binding-linux-x64-gnu-1.0.1.tgz", + "integrity": "sha512-XABVmGp9Tg0WspTVvwduTc4fpqy6JnAUrSQe6OuyqD/03nI7r0O9OWUkMIwFrjKAIqolvqoA4ZrJppgwE0Gxmw==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-linux-x64-musl": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-musl/-/binding-linux-x64-musl-1.0.1.tgz", + "integrity": "sha512-bV4fzswuzVcKD90o/VM6QqKxnxlDq0g2BISDLNVmxrnhpv1DDbyPhCIjYfvzYLV+MvkKKnQt2Q6AO86SEBULUQ==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-openharmony-arm64": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-openharmony-arm64/-/binding-openharmony-arm64-1.0.1.tgz", + "integrity": "sha512-/Mh0Zhq3OP7fVs0kcQHZP6lZEthMGTaSf8UBQYSFEZDWGXXlEC+nJ6EqenaK2t4LBXMe3A+K/G2BVXXdtOr4PQ==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "openharmony" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-wasm32-wasi": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-wasm32-wasi/-/binding-wasm32-wasi-1.0.1.tgz", + "integrity": "sha512-+1xc9X45l8ufsBAm6Gjvx2qDRIY9lTVt0cgWNcJ+1gdhXvkbxePA60yRTwSTuXL09CMhyJmjpV7E3NoyxbqFQQ==", + "cpu": [ + "wasm32" + ], + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "@emnapi/core": "1.10.0", + "@emnapi/runtime": "1.10.0", + "@napi-rs/wasm-runtime": "^1.1.4" + }, + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-win32-arm64-msvc": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-arm64-msvc/-/binding-win32-arm64-msvc-1.0.1.tgz", + "integrity": "sha512-1D+UqZdfnuR+Jy1GgMJwi85bD40H21uNmOPRWQhw4oRSuolZ/B5rixZ45DK2KXOTCvmVCecauWgEhbw8bI7tOw==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/binding-win32-x64-msvc": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-x64-msvc/-/binding-win32-x64-msvc-1.0.1.tgz", + "integrity": "sha512-INAycaWuhlOK3wk4mRHGsdgwYWmd9cChdPdE9bwWmy6rn9VqVNYNFGhOdXrofXUxwHIncSiPNb8tNm8knDVIeQ==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MIT", + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": "^20.19.0 || >=22.12.0" + } + }, + "node_modules/@rolldown/pluginutils": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/@rolldown/pluginutils/-/pluginutils-1.0.1.tgz", + "integrity": "sha512-2j9bGt5Jh8hj+vPtgzPtl72j0yRxHAyumoo6TNfAjsLB04UtpSvPbPcDcBMxz7n+9CYB0c1GxQFxYRg2jimqGw==", + "dev": true, + "license": "MIT" + }, + "node_modules/@tybys/wasm-util": { + "version": "0.10.2", + "resolved": "https://registry.npmjs.org/@tybys/wasm-util/-/wasm-util-0.10.2.tgz", + "integrity": "sha512-RoBvJ2X0wuKlWFIjrwffGw1IqZHKQqzIchKaadZZfnNpsAYp2mM0h36JtPCjNDAHGgYez/15uMBpfGwchhiMgg==", + "dev": true, + "license": "MIT", + "optional": true, + "dependencies": { + "tslib": "^2.4.0" + } + }, + "node_modules/@types/esrecurse": { + "version": "4.3.1", + "resolved": "https://registry.npmjs.org/@types/esrecurse/-/esrecurse-4.3.1.tgz", + "integrity": "sha512-xJBAbDifo5hpffDBuHl0Y8ywswbiAp/Wi7Y/GtAgSlZyIABppyurxVueOPE8LUQOxdlgi6Zqce7uoEpqNTeiUw==", + "dev": true, + "license": "MIT" + }, + "node_modules/@types/estree": { + "version": "1.0.9", + "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.9.tgz", + "integrity": "sha512-GhdPgy1el4/ImP05X05Uw4cw2/M93BCUmnEvWZNStlCzEKME4Fkk+YpoA5OiHNQmoS7Cafb8Xa3Pya8m1Qrzeg==", + "dev": true, + "license": "MIT" + }, + "node_modules/@types/json-schema": { + "version": "7.0.15", + "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.15.tgz", + "integrity": "sha512-5+fP8P8MFNC+AyZCDxrB2pkZFPGzqQWUzpSeuuVLvm8VMcorNYavBqoFcxK8bQz4Qsbn4oUEEem4wDLfcysGHA==", + "dev": true, + "license": "MIT" + }, + "node_modules/@types/node": { + "version": "24.12.4", + "resolved": "https://registry.npmjs.org/@types/node/-/node-24.12.4.tgz", + "integrity": "sha512-GUUEShf+PBCGW2KaXwcIt3Yk+e3pkKwWKb9GSyM9WQVE+ep2jzmHdGsHzu4wgcZy5fN9FBdVzjpBQsYlpfpgLA==", + "dev": true, + "license": "MIT", + "dependencies": { + "undici-types": "~7.16.0" + } + }, + "node_modules/@types/react": { + "version": "19.2.15", + "resolved": "https://registry.npmjs.org/@types/react/-/react-19.2.15.tgz", + "integrity": "sha512-eRwcGNHve+E8qtEQSSRl6urh+rFop4v8gm6O8rGv25CodbvFdLjA1vVQ1KkiFE0w0UPOnb8tDiFKL5lp0rtY5Q==", + "dev": true, + "license": "MIT", + "dependencies": { + "csstype": "^3.2.2" + } + }, + "node_modules/@types/react-dom": { + "version": "19.2.3", + "resolved": "https://registry.npmjs.org/@types/react-dom/-/react-dom-19.2.3.tgz", + "integrity": "sha512-jp2L/eY6fn+KgVVQAOqYItbF0VY/YApe5Mz2F0aykSO8gx31bYCZyvSeYxCHKvzHG5eZjc+zyaS5BrBWya2+kQ==", + "dev": true, + "license": "MIT", + "peerDependencies": { + "@types/react": "^19.2.0" + } + }, + "node_modules/@typescript-eslint/eslint-plugin": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-8.59.4.tgz", + "integrity": "sha512-PegsU+XfyJJNjd4+u/k6f9yTyp0lEXXiPopUNobZcIAUJFGICFLN+sP0Rb3JehVmiij1Ph0dFGYqODoRo/2+6A==", + "dev": true, + "license": "MIT", + "dependencies": { + "@eslint-community/regexpp": "^4.12.2", + "@typescript-eslint/scope-manager": "8.59.4", + "@typescript-eslint/type-utils": "8.59.4", + "@typescript-eslint/utils": "8.59.4", + "@typescript-eslint/visitor-keys": "8.59.4", + "ignore": "^7.0.5", + "natural-compare": "^1.4.0", + "ts-api-utils": "^2.5.0" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "@typescript-eslint/parser": "^8.59.4", + "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0", + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/eslint-plugin/node_modules/ignore": { + "version": "7.0.5", + "resolved": "https://registry.npmjs.org/ignore/-/ignore-7.0.5.tgz", + "integrity": "sha512-Hs59xBNfUIunMFgWAbGX5cq6893IbWg4KnrjbYwX3tx0ztorVgTDA6B2sxf8ejHJ4wz8BqGUMYlnzNBer5NvGg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">= 4" + } + }, + "node_modules/@typescript-eslint/parser": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-8.59.4.tgz", + "integrity": "sha512-zORHqO/tuhxY1zWuTvMUqddRxpiFJ72xVfcNoWpqdLjs6lfPbuQBJuW4pk+49/uBMy7Ssr4bzgjiKmmDB1UbZQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/scope-manager": "8.59.4", + "@typescript-eslint/types": "8.59.4", + "@typescript-eslint/typescript-estree": "8.59.4", + "@typescript-eslint/visitor-keys": "8.59.4", + "debug": "^4.4.3" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0", + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/project-service": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/project-service/-/project-service-8.59.4.tgz", + "integrity": "sha512-Ly00Vu4oAacfDeHp2Zg85ioNG6l8HG+tN1D7J+xTHSxu9y0awYKJ2zH1rFBn8ZSfuGK+7FxK3Cgl3uAz0aZZLg==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/tsconfig-utils": "^8.59.4", + "@typescript-eslint/types": "^8.59.4", + "debug": "^4.4.3" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/scope-manager": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-8.59.4.tgz", + "integrity": "sha512-mUeR/3H1WrTAddJrwut8OoPjfauaztMQmRwV5fQTUyNVJCLiUXXe4lGEyYIL2oFDpP7UtgbGJXCt72wT0z2S3Q==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/types": "8.59.4", + "@typescript-eslint/visitor-keys": "8.59.4" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + } + }, + "node_modules/@typescript-eslint/tsconfig-utils": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/tsconfig-utils/-/tsconfig-utils-8.59.4.tgz", + "integrity": "sha512-DLCpnKgD4alVxTBSKulK+gU1KCqOgUXfDRDXh2mZgzokQKa/70ax93I2uVO3m/LLvIAtWZIFoiifudmIqAxpMA==", + "dev": true, + "license": "MIT", + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/type-utils": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/type-utils/-/type-utils-8.59.4.tgz", + "integrity": "sha512-uonTuPAAKr9XaBGqJ3LjYTh72zy5DyGesljO9gtmk/eFW0W1fRHjnwVYKB35Lm8d5Q5CluEW3gPHjTvZTmgrfA==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/types": "8.59.4", + "@typescript-eslint/typescript-estree": "8.59.4", + "@typescript-eslint/utils": "8.59.4", + "debug": "^4.4.3", + "ts-api-utils": "^2.5.0" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0", + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/types": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/types/-/types-8.59.4.tgz", + "integrity": "sha512-F1o7WJcCq+bc8dwcO/YsSEOudAH8RDtaOhM6wcAQhcUsFhnWQl81JKy48q1hoxAU0qrzM89+31GYh1515Zde3Q==", + "dev": true, + "license": "MIT", + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + } + }, + "node_modules/@typescript-eslint/typescript-estree": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-8.59.4.tgz", + "integrity": "sha512-F+RuOmcDXo4+TPdfd/TCLS3m2nw8gE9XXyZLrA3JBfaA5tz9TtdkyD3YJFmPxulyc2cKbEok/CvFE3MgSLWnag==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/project-service": "8.59.4", + "@typescript-eslint/tsconfig-utils": "8.59.4", + "@typescript-eslint/types": "8.59.4", + "@typescript-eslint/visitor-keys": "8.59.4", + "debug": "^4.4.3", + "minimatch": "^10.2.2", + "semver": "^7.7.3", + "tinyglobby": "^0.2.15", + "ts-api-utils": "^2.5.0" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/typescript-estree/node_modules/semver": { + "version": "7.8.0", + "resolved": "https://registry.npmjs.org/semver/-/semver-7.8.0.tgz", + "integrity": "sha512-AcM7dV/5ul4EekoQ29Agm5vri8JNqRyj39o0qpX6vDF2GZrtutZl5RwgD1XnZjiTAfncsJhMI48QQH3sN87YNA==", + "dev": true, + "license": "ISC", + "bin": { + "semver": "bin/semver.js" + }, + "engines": { + "node": ">=10" + } + }, + "node_modules/@typescript-eslint/utils": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/utils/-/utils-8.59.4.tgz", + "integrity": "sha512-cYXeNAUsG4lJo5dbc1FcKm+JwIWrj1/UpTORsC6tGMjEZ81DYcvIr9/ueikhMa/Y/gDQYGp+YX9/xQrXje5BJw==", + "dev": true, + "license": "MIT", + "dependencies": { + "@eslint-community/eslint-utils": "^4.9.1", + "@typescript-eslint/scope-manager": "8.59.4", + "@typescript-eslint/types": "8.59.4", + "@typescript-eslint/typescript-estree": "8.59.4" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0", + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/@typescript-eslint/visitor-keys": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-8.59.4.tgz", + "integrity": "sha512-U3gxVaDVnuZKhSspW/MzMxE1kq7zOdc072FcSNoqA1I9p8HyKbBFfEHoWckBAMgNMph4MamwS5iTVzFmrnt8TQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/types": "8.59.4", + "eslint-visitor-keys": "^5.0.0" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + } + }, + "node_modules/@vitejs/plugin-react": { + "version": "6.0.2", + "resolved": "https://registry.npmjs.org/@vitejs/plugin-react/-/plugin-react-6.0.2.tgz", + "integrity": "sha512-DlSMqo4WhThw4vB8Mpn0Woe9J+Jfq1geJ61AKW0QEgLzGMNwtIMdxbDUzLxcun8W7NbJO0e2Jg/Nxm3cCSVzzg==", + "dev": true, + "license": "MIT", + "dependencies": { + "@rolldown/pluginutils": "^1.0.0" + }, + "engines": { + "node": "^20.19.0 || >=22.12.0" + }, + "peerDependencies": { + "@rolldown/plugin-babel": "^0.1.7 || ^0.2.0", + "babel-plugin-react-compiler": "^1.0.0", + "vite": "^8.0.0" + }, + "peerDependenciesMeta": { + "@rolldown/plugin-babel": { + "optional": true + }, + "babel-plugin-react-compiler": { + "optional": true + } + } + }, + "node_modules/acorn": { + "version": "8.16.0", + "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.16.0.tgz", + "integrity": "sha512-UVJyE9MttOsBQIDKw1skb9nAwQuR5wuGD3+82K6JgJlm/Y+KI92oNsMNGZCYdDsVtRHSak0pcV5Dno5+4jh9sw==", + "dev": true, + "license": "MIT", + "bin": { + "acorn": "bin/acorn" + }, + "engines": { + "node": ">=0.4.0" + } + }, + "node_modules/acorn-jsx": { + "version": "5.3.2", + "resolved": "https://registry.npmjs.org/acorn-jsx/-/acorn-jsx-5.3.2.tgz", + "integrity": "sha512-rq9s+JNhf0IChjtDXxllJ7g41oZk5SlXtp0LHwyA5cejwn7vKmKp4pPri6YEePv2PU65sAsegbXtIinmDFDXgQ==", + "dev": true, + "license": "MIT", + "peerDependencies": { + "acorn": "^6.0.0 || ^7.0.0 || ^8.0.0" + } + }, + "node_modules/ajv": { + "version": "6.15.0", + "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.15.0.tgz", + "integrity": "sha512-fgFx7Hfoq60ytK2c7DhnF8jIvzYgOMxfugjLOSMHjLIPgenqa7S7oaagATUq99mV6IYvN2tRmC0wnTYX6iPbMw==", + "dev": true, + "license": "MIT", + "dependencies": { + "fast-deep-equal": "^3.1.1", + "fast-json-stable-stringify": "^2.0.0", + "json-schema-traverse": "^0.4.1", + "uri-js": "^4.2.2" + }, + "funding": { + "type": "github", + "url": "https://github.com/sponsors/epoberezkin" + } + }, + "node_modules/balanced-match": { + "version": "4.0.4", + "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-4.0.4.tgz", + "integrity": "sha512-BLrgEcRTwX2o6gGxGOCNyMvGSp35YofuYzw9h1IMTRmKqttAZZVU67bdb9Pr2vUHA8+j3i2tJfjO6C6+4myGTA==", + "dev": true, + "license": "MIT", + "engines": { + "node": "18 || 20 || >=22" + } + }, + "node_modules/baseline-browser-mapping": { + "version": "2.10.31", + "resolved": "https://registry.npmjs.org/baseline-browser-mapping/-/baseline-browser-mapping-2.10.31.tgz", + "integrity": "sha512-MujYO3eP72uvmSE0i4wltsodRfIpZATP3jvzRNRGGxgzId7aVocVJJV3nf01qnzzKFGxQVC9bpWxl5cjxTr/7Q==", + "dev": true, + "license": "Apache-2.0", + "bin": { + "baseline-browser-mapping": "dist/cli.cjs" + }, + "engines": { + "node": ">=6.0.0" + } + }, + "node_modules/brace-expansion": { + "version": "5.0.6", + "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-5.0.6.tgz", + "integrity": "sha512-kLpxurY4Z4r9sgMsyG0Z9uzsBlgiU/EFKhj/h91/8yHu0edo7XuixOIH3VcJ8kkxs6/jPzoI6U9Vj3WqbMQ94g==", + "dev": true, + "license": "MIT", + "dependencies": { + "balanced-match": "^4.0.2" + }, + "engines": { + "node": "18 || 20 || >=22" + } + }, + "node_modules/browserslist": { + "version": "4.28.2", + "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.28.2.tgz", + "integrity": "sha512-48xSriZYYg+8qXna9kwqjIVzuQxi+KYWp2+5nCYnYKPTr0LvD89Jqk2Or5ogxz0NUMfIjhh2lIUX/LyX9B4oIg==", + "dev": true, + "funding": [ + { + "type": "opencollective", + "url": "https://opencollective.com/browserslist" + }, + { + "type": "tidelift", + "url": "https://tidelift.com/funding/github/npm/browserslist" + }, + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], + "license": "MIT", + "dependencies": { + "baseline-browser-mapping": "^2.10.12", + "caniuse-lite": "^1.0.30001782", + "electron-to-chromium": "^1.5.328", + "node-releases": "^2.0.36", + "update-browserslist-db": "^1.2.3" + }, + "bin": { + "browserslist": "cli.js" + }, + "engines": { + "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7" + } + }, + "node_modules/caniuse-lite": { + "version": "1.0.30001793", + "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001793.tgz", + "integrity": "sha512-iwSsYWaCOoh26cV8NwNRViHlrfUvYsHDfRVcbtmw0Kg6PJIZZXwMkj1442FYLBGkeUf1juAsU3DTfxW579mrPA==", + "dev": true, + "funding": [ + { + "type": "opencollective", + "url": "https://opencollective.com/browserslist" + }, + { + "type": "tidelift", + "url": "https://tidelift.com/funding/github/npm/caniuse-lite" + }, + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], + "license": "CC-BY-4.0" + }, + "node_modules/convert-source-map": { + "version": "2.0.0", + "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-2.0.0.tgz", + "integrity": "sha512-Kvp459HrV2FEJ1CAsi1Ku+MY3kasH19TFykTz2xWmMeq6bk2NU3XXvfJ+Q61m0xktWwt+1HSYf3JZsTms3aRJg==", + "dev": true, + "license": "MIT" + }, + "node_modules/cookie": { + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/cookie/-/cookie-1.1.1.tgz", + "integrity": "sha512-ei8Aos7ja0weRpFzJnEA9UHJ/7XQmqglbRwnf2ATjcB9Wq874VKH9kfjjirM6UhU2/E5fFYadylyhFldcqSidQ==", + "license": "MIT", + "engines": { + "node": ">=18" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/express" + } + }, + "node_modules/cross-spawn": { + "version": "7.0.6", + "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.6.tgz", + "integrity": "sha512-uV2QOWP2nWzsy2aMp8aRibhi9dlzF5Hgh5SHaB9OiTGEyDTiJJyx0uy51QXdyWbtAHNua4XJzUKca3OzKUd3vA==", + "dev": true, + "license": "MIT", + "dependencies": { + "path-key": "^3.1.0", + "shebang-command": "^2.0.0", + "which": "^2.0.1" + }, + "engines": { + "node": ">= 8" + } + }, + "node_modules/csstype": { + "version": "3.2.3", + "resolved": "https://registry.npmjs.org/csstype/-/csstype-3.2.3.tgz", + "integrity": "sha512-z1HGKcYy2xA8AGQfwrn0PAy+PB7X/GSj3UVJW9qKyn43xWa+gl5nXmU4qqLMRzWVLFC8KusUX8T/0kCiOYpAIQ==", + "dev": true, + "license": "MIT" + }, + "node_modules/debug": { + "version": "4.4.3", + "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz", + "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==", + "dev": true, + "license": "MIT", + "dependencies": { + "ms": "^2.1.3" + }, + "engines": { + "node": ">=6.0" + }, + "peerDependenciesMeta": { + "supports-color": { + "optional": true + } + } + }, + "node_modules/deep-is": { + "version": "0.1.4", + "resolved": "https://registry.npmjs.org/deep-is/-/deep-is-0.1.4.tgz", + "integrity": "sha512-oIPzksmTg4/MriiaYGO+okXDT7ztn/w3Eptv/+gSIdMdKsJo0u4CfYNFJPy+4SKMuCqGw2wxnA+URMg3t8a/bQ==", + "dev": true, + "license": "MIT" + }, + "node_modules/detect-libc": { + "version": "2.1.2", + "resolved": "https://registry.npmjs.org/detect-libc/-/detect-libc-2.1.2.tgz", + "integrity": "sha512-Btj2BOOO83o3WyH59e8MgXsxEQVcarkUOpEYrubB0urwnN10yQ364rsiByU11nZlqWYZm05i/of7io4mzihBtQ==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": ">=8" + } + }, + "node_modules/electron-to-chromium": { + "version": "1.5.359", + "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.5.359.tgz", + "integrity": "sha512-8lPELWuYZIWk7NDvCNthtmMw/7Q5Wu25NpM4djFMHBmk8DubPAtL4YTOp7ou0e7HyJtwkVlWv8XMLURnrtgJQw==", + "dev": true, + "license": "ISC" + }, + "node_modules/escalade": { + "version": "3.2.0", + "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.2.0.tgz", + "integrity": "sha512-WUj2qlxaQtO4g6Pq5c29GTcWGDyd8itL8zTlipgECz3JesAiiOKotd8JU6otB3PACgG6xkJUyVhboMS+bje/jA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6" + } + }, + "node_modules/escape-string-regexp": { + "version": "4.0.0", + "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-4.0.0.tgz", + "integrity": "sha512-TtpcNJ3XAzx3Gq8sWRzJaVajRs0uVxA2YAkdb1jm2YkPz4G6egUFAyA3n5vtEIZefPk5Wa4UXbKuS5fKkJWdgA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/eslint": { + "version": "10.4.0", + "resolved": "https://registry.npmjs.org/eslint/-/eslint-10.4.0.tgz", + "integrity": "sha512-loXy6bWOoP3EP6JA7jo6p5jMpBJmHmsNZM5SFRHLdh1MGOPurMnNBj4ZlAbaqUAaQWbCr7jHV4P7gzAyryZWkQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@eslint-community/eslint-utils": "^4.8.0", + "@eslint-community/regexpp": "^4.12.2", + "@eslint/config-array": "^0.23.5", + "@eslint/config-helpers": "^0.6.0", + "@eslint/core": "^1.2.1", + "@eslint/plugin-kit": "^0.7.1", + "@humanfs/node": "^0.16.6", + "@humanwhocodes/module-importer": "^1.0.1", + "@humanwhocodes/retry": "^0.4.2", + "@types/estree": "^1.0.6", + "ajv": "^6.14.0", + "cross-spawn": "^7.0.6", + "debug": "^4.3.2", + "escape-string-regexp": "^4.0.0", + "eslint-scope": "^9.1.2", + "eslint-visitor-keys": "^5.0.1", + "espree": "^11.2.0", + "esquery": "^1.7.0", + "esutils": "^2.0.2", + "fast-deep-equal": "^3.1.3", + "file-entry-cache": "^8.0.0", + "find-up": "^5.0.0", + "glob-parent": "^6.0.2", + "ignore": "^5.2.0", + "imurmurhash": "^0.1.4", + "is-glob": "^4.0.0", + "json-stable-stringify-without-jsonify": "^1.0.1", + "minimatch": "^10.2.4", + "natural-compare": "^1.4.0", + "optionator": "^0.9.3" + }, + "bin": { + "eslint": "bin/eslint.js" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + }, + "funding": { + "url": "https://eslint.org/donate" + }, + "peerDependencies": { + "jiti": "*" + }, + "peerDependenciesMeta": { + "jiti": { + "optional": true + } + } + }, + "node_modules/eslint-plugin-react-hooks": { + "version": "7.1.1", + "resolved": "https://registry.npmjs.org/eslint-plugin-react-hooks/-/eslint-plugin-react-hooks-7.1.1.tgz", + "integrity": "sha512-f2I7Gw6JbvCexzIInuSbZpfdQ44D7iqdWX01FKLvrPgqxoE7oMj8clOfto8U6vYiz4yd5oKu39rRSVOe1zRu0g==", + "dev": true, + "license": "MIT", + "dependencies": { + "@babel/core": "^7.24.4", + "@babel/parser": "^7.24.4", + "hermes-parser": "^0.25.1", + "zod": "^3.25.0 || ^4.0.0", + "zod-validation-error": "^3.5.0 || ^4.0.0" + }, + "engines": { + "node": ">=18" + }, + "peerDependencies": { + "eslint": "^3.0.0 || ^4.0.0 || ^5.0.0 || ^6.0.0 || ^7.0.0 || ^8.0.0-0 || ^9.0.0 || ^10.0.0" + } + }, + "node_modules/eslint-plugin-react-refresh": { + "version": "0.5.2", + "resolved": "https://registry.npmjs.org/eslint-plugin-react-refresh/-/eslint-plugin-react-refresh-0.5.2.tgz", + "integrity": "sha512-hmgTH57GfzoTFjVN0yBwTggnsVUF2tcqi7RJZHqi9lIezSs4eFyAMktA68YD4r5kNw1mxyY4dmkyoFDb3FIqrA==", + "dev": true, + "license": "MIT", + "peerDependencies": { + "eslint": "^9 || ^10" + } + }, + "node_modules/eslint-scope": { + "version": "9.1.2", + "resolved": "https://registry.npmjs.org/eslint-scope/-/eslint-scope-9.1.2.tgz", + "integrity": "sha512-xS90H51cKw0jltxmvmHy2Iai1LIqrfbw57b79w/J7MfvDfkIkFZ+kj6zC3BjtUwh150HsSSdxXZcsuv72miDFQ==", + "dev": true, + "license": "BSD-2-Clause", + "dependencies": { + "@types/esrecurse": "^4.3.1", + "@types/estree": "^1.0.8", + "esrecurse": "^4.3.0", + "estraverse": "^5.2.0" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + }, + "funding": { + "url": "https://opencollective.com/eslint" + } + }, + "node_modules/eslint-visitor-keys": { + "version": "5.0.1", + "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-5.0.1.tgz", + "integrity": "sha512-tD40eHxA35h0PEIZNeIjkHoDR4YjjJp34biM0mDvplBe//mB+IHCqHDGV7pxF+7MklTvighcCPPZC7ynWyjdTA==", + "dev": true, + "license": "Apache-2.0", + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + }, + "funding": { + "url": "https://opencollective.com/eslint" + } + }, + "node_modules/espree": { + "version": "11.2.0", + "resolved": "https://registry.npmjs.org/espree/-/espree-11.2.0.tgz", + "integrity": "sha512-7p3DrVEIopW1B1avAGLuCSh1jubc01H2JHc8B4qqGblmg5gI9yumBgACjWo4JlIc04ufug4xJ3SQI8HkS/Rgzw==", + "dev": true, + "license": "BSD-2-Clause", + "dependencies": { + "acorn": "^8.16.0", + "acorn-jsx": "^5.3.2", + "eslint-visitor-keys": "^5.0.1" + }, + "engines": { + "node": "^20.19.0 || ^22.13.0 || >=24" + }, + "funding": { + "url": "https://opencollective.com/eslint" + } + }, + "node_modules/esquery": { + "version": "1.7.0", + "resolved": "https://registry.npmjs.org/esquery/-/esquery-1.7.0.tgz", + "integrity": "sha512-Ap6G0WQwcU/LHsvLwON1fAQX9Zp0A2Y6Y/cJBl9r/JbW90Zyg4/zbG6zzKa2OTALELarYHmKu0GhpM5EO+7T0g==", + "dev": true, + "license": "BSD-3-Clause", + "dependencies": { + "estraverse": "^5.1.0" + }, + "engines": { + "node": ">=0.10" + } + }, + "node_modules/esrecurse": { + "version": "4.3.0", + "resolved": "https://registry.npmjs.org/esrecurse/-/esrecurse-4.3.0.tgz", + "integrity": "sha512-KmfKL3b6G+RXvP8N1vr3Tq1kL/oCFgn2NYXEtqP8/L3pKapUA4G8cFVaoF3SU323CD4XypR/ffioHmkti6/Tag==", + "dev": true, + "license": "BSD-2-Clause", + "dependencies": { + "estraverse": "^5.2.0" + }, + "engines": { + "node": ">=4.0" + } + }, + "node_modules/estraverse": { + "version": "5.3.0", + "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.3.0.tgz", + "integrity": "sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==", + "dev": true, + "license": "BSD-2-Clause", + "engines": { + "node": ">=4.0" + } + }, + "node_modules/esutils": { + "version": "2.0.3", + "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz", + "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==", + "dev": true, + "license": "BSD-2-Clause", + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/fast-deep-equal": { + "version": "3.1.3", + "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz", + "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==", + "dev": true, + "license": "MIT" + }, + "node_modules/fast-json-stable-stringify": { + "version": "2.1.0", + "resolved": "https://registry.npmjs.org/fast-json-stable-stringify/-/fast-json-stable-stringify-2.1.0.tgz", + "integrity": "sha512-lhd/wF+Lk98HZoTCtlVraHtfh5XYijIjalXck7saUtuanSDyLMxnHhSXEDJqHxD7msR8D0uCmqlkwjCV8xvwHw==", + "dev": true, + "license": "MIT" + }, + "node_modules/fast-levenshtein": { + "version": "2.0.6", + "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz", + "integrity": "sha512-DCXu6Ifhqcks7TZKY3Hxp3y6qphY5SJZmrWMDrKcERSOXWQdMhU9Ig/PYrzyw/ul9jOIyh0N4M0tbC5hodg8dw==", + "dev": true, + "license": "MIT" + }, + "node_modules/fdir": { + "version": "6.5.0", + "resolved": "https://registry.npmjs.org/fdir/-/fdir-6.5.0.tgz", + "integrity": "sha512-tIbYtZbucOs0BRGqPJkshJUYdL+SDH7dVM8gjy+ERp3WAUjLEFJE+02kanyHtwjWOnwrKYBiwAmM0p4kLJAnXg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=12.0.0" + }, + "peerDependencies": { + "picomatch": "^3 || ^4" + }, + "peerDependenciesMeta": { + "picomatch": { + "optional": true + } + } + }, + "node_modules/file-entry-cache": { + "version": "8.0.0", + "resolved": "https://registry.npmjs.org/file-entry-cache/-/file-entry-cache-8.0.0.tgz", + "integrity": "sha512-XXTUwCvisa5oacNGRP9SfNtYBNAMi+RPwBFmblZEF7N7swHYQS6/Zfk7SRwx4D5j3CH211YNRco1DEMNVfZCnQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "flat-cache": "^4.0.0" + }, + "engines": { + "node": ">=16.0.0" + } + }, + "node_modules/find-up": { + "version": "5.0.0", + "resolved": "https://registry.npmjs.org/find-up/-/find-up-5.0.0.tgz", + "integrity": "sha512-78/PXT1wlLLDgTzDs7sjq9hzz0vXD+zn+7wypEe4fXQxCmdmqfGsEPQxmiCSQI3ajFV91bVSsvNtrJRiW6nGng==", + "dev": true, + "license": "MIT", + "dependencies": { + "locate-path": "^6.0.0", + "path-exists": "^4.0.0" + }, + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/flat-cache": { + "version": "4.0.1", + "resolved": "https://registry.npmjs.org/flat-cache/-/flat-cache-4.0.1.tgz", + "integrity": "sha512-f7ccFPK3SXFHpx15UIGyRJ/FJQctuKZ0zVuN3frBo4HnK3cay9VEW0R6yPYFHC0AgqhukPzKjq22t5DmAyqGyw==", + "dev": true, + "license": "MIT", + "dependencies": { + "flatted": "^3.2.9", + "keyv": "^4.5.4" + }, + "engines": { + "node": ">=16" + } + }, + "node_modules/flatted": { + "version": "3.4.2", + "resolved": "https://registry.npmjs.org/flatted/-/flatted-3.4.2.tgz", + "integrity": "sha512-PjDse7RzhcPkIJwy5t7KPWQSZ9cAbzQXcafsetQoD7sOJRQlGikNbx7yZp2OotDnJyrDcbyRq3Ttb18iYOqkxA==", + "dev": true, + "license": "ISC" + }, + "node_modules/fsevents": { + "version": "2.3.3", + "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.3.tgz", + "integrity": "sha512-5xoDfX+fL7faATnagmWPpbFtwh/R77WmMMqqHGS65C3vvB0YHrgF+B1YmZ3441tMj5n63k0212XNoJwzlhffQw==", + "dev": true, + "hasInstallScript": true, + "license": "MIT", + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": "^8.16.0 || ^10.6.0 || >=11.0.0" + } + }, + "node_modules/gensync": { + "version": "1.0.0-beta.2", + "resolved": "https://registry.npmjs.org/gensync/-/gensync-1.0.0-beta.2.tgz", + "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6.9.0" + } + }, + "node_modules/glob-parent": { + "version": "6.0.2", + "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-6.0.2.tgz", + "integrity": "sha512-XxwI8EOhVQgWp6iDL+3b0r86f4d6AX6zSU55HfB4ydCEuXLXc5FcYeOu+nnGftS4TEju/11rt4KJPTMgbfmv4A==", + "dev": true, + "license": "ISC", + "dependencies": { + "is-glob": "^4.0.3" + }, + "engines": { + "node": ">=10.13.0" + } + }, + "node_modules/globals": { + "version": "17.6.0", + "resolved": "https://registry.npmjs.org/globals/-/globals-17.6.0.tgz", + "integrity": "sha512-sepffkT8stwnIYbsMBpoCHJuJM5l98FUF2AnE07hfvE0m/qp3R586hw4jF4uadbhvg1ooIdzuu7CsfD2jzCaNA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=18" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/hermes-estree": { + "version": "0.25.1", + "resolved": "https://registry.npmjs.org/hermes-estree/-/hermes-estree-0.25.1.tgz", + "integrity": "sha512-0wUoCcLp+5Ev5pDW2OriHC2MJCbwLwuRx+gAqMTOkGKJJiBCLjtrvy4PWUGn6MIVefecRpzoOZ/UV6iGdOr+Cw==", + "dev": true, + "license": "MIT" + }, + "node_modules/hermes-parser": { + "version": "0.25.1", + "resolved": "https://registry.npmjs.org/hermes-parser/-/hermes-parser-0.25.1.tgz", + "integrity": "sha512-6pEjquH3rqaI6cYAXYPcz9MS4rY6R4ngRgrgfDshRptUZIc3lw0MCIJIGDj9++mfySOuPTHB4nrSW99BCvOPIA==", + "dev": true, + "license": "MIT", + "dependencies": { + "hermes-estree": "0.25.1" + } + }, + "node_modules/ignore": { + "version": "5.3.2", + "resolved": "https://registry.npmjs.org/ignore/-/ignore-5.3.2.tgz", + "integrity": "sha512-hsBTNUqQTDwkWtcdYI2i06Y/nUBEsNEDJKjWdigLvegy8kDuJAS8uRlpkkcQpyEXL0Z/pjDy5HBmMjRCJ2gq+g==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">= 4" + } + }, + "node_modules/imurmurhash": { + "version": "0.1.4", + "resolved": "https://registry.npmjs.org/imurmurhash/-/imurmurhash-0.1.4.tgz", + "integrity": "sha512-JmXMZ6wuvDmLiHEml9ykzqO6lwFbof0GG4IkcGaENdCRDDmMVnny7s5HsIgHCbaq0w2MyPhDqkhTUgS2LU2PHA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=0.8.19" + } + }, + "node_modules/is-extglob": { + "version": "2.1.1", + "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz", + "integrity": "sha512-SbKbANkN603Vi4jEZv49LeVJMn4yGwsbzZworEoyEiutsN3nJYdbO36zfhGJ6QEDpOZIFkDtnq5JRxmvl3jsoQ==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/is-glob": { + "version": "4.0.3", + "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.3.tgz", + "integrity": "sha512-xelSayHH36ZgE7ZWhli7pW34hNbNl8Ojv5KVmkJD4hBdD3th8Tfk9vYasLM+mXWOZhFkgZfxhLSnrwRr4elSSg==", + "dev": true, + "license": "MIT", + "dependencies": { + "is-extglob": "^2.1.1" + }, + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/isexe": { + "version": "2.0.0", + "resolved": "https://registry.npmjs.org/isexe/-/isexe-2.0.0.tgz", + "integrity": "sha512-RHxMLp9lnKHGHRng9QFhRCMbYAcVpn69smSGcq3f36xjgVVWThj4qqLbTLlq7Ssj8B+fIQ1EuCEGI2lKsyQeIw==", + "dev": true, + "license": "ISC" + }, + "node_modules/js-tokens": { + "version": "4.0.0", + "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-4.0.0.tgz", + "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==", + "dev": true, + "license": "MIT" + }, + "node_modules/jsesc": { + "version": "3.1.0", + "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-3.1.0.tgz", + "integrity": "sha512-/sM3dO2FOzXjKQhJuo0Q173wf2KOo8t4I8vHy6lF9poUp7bKT0/NHE8fPX23PwfhnykfqnC2xRxOnVw5XuGIaA==", + "dev": true, + "license": "MIT", + "bin": { + "jsesc": "bin/jsesc" + }, + "engines": { + "node": ">=6" + } + }, + "node_modules/json-buffer": { + "version": "3.0.1", + "resolved": "https://registry.npmjs.org/json-buffer/-/json-buffer-3.0.1.tgz", + "integrity": "sha512-4bV5BfR2mqfQTJm+V5tPPdf+ZpuhiIvTuAB5g8kcrXOZpTT/QwwVRWBywX1ozr6lEuPdbHxwaJlm9G6mI2sfSQ==", + "dev": true, + "license": "MIT" + }, + "node_modules/json-schema-traverse": { + "version": "0.4.1", + "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz", + "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==", + "dev": true, + "license": "MIT" + }, + "node_modules/json-stable-stringify-without-jsonify": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/json-stable-stringify-without-jsonify/-/json-stable-stringify-without-jsonify-1.0.1.tgz", + "integrity": "sha512-Bdboy+l7tA3OGW6FjyFHWkP5LuByj1Tk33Ljyq0axyzdk9//JSi2u3fP1QSmd1KNwq6VOKYGlAu87CisVir6Pw==", + "dev": true, + "license": "MIT" + }, + "node_modules/json5": { + "version": "2.2.3", + "resolved": "https://registry.npmjs.org/json5/-/json5-2.2.3.tgz", + "integrity": "sha512-XmOWe7eyHYH14cLdVPoyg+GOH3rYX++KpzrylJwSW98t3Nk+U8XOl8FWKOgwtzdb8lXGf6zYwDUzeHMWfxasyg==", + "dev": true, + "license": "MIT", + "bin": { + "json5": "lib/cli.js" + }, + "engines": { + "node": ">=6" + } + }, + "node_modules/keyv": { + "version": "4.5.4", + "resolved": "https://registry.npmjs.org/keyv/-/keyv-4.5.4.tgz", + "integrity": "sha512-oxVHkHR/EJf2CNXnWxRLW6mg7JyCCUcG0DtEGmL2ctUo1PNTin1PUil+r/+4r5MpVgC/fn1kjsx7mjSujKqIpw==", + "dev": true, + "license": "MIT", + "dependencies": { + "json-buffer": "3.0.1" + } + }, + "node_modules/levn": { + "version": "0.4.1", + "resolved": "https://registry.npmjs.org/levn/-/levn-0.4.1.tgz", + "integrity": "sha512-+bT2uH4E5LGE7h/n3evcS/sQlJXCpIp6ym8OWJ5eV6+67Dsql/LaaT7qJBAt2rzfoa/5QBGBhxDix1dMt2kQKQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "prelude-ls": "^1.2.1", + "type-check": "~0.4.0" + }, + "engines": { + "node": ">= 0.8.0" + } + }, + "node_modules/lightningcss": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss/-/lightningcss-1.32.0.tgz", + "integrity": "sha512-NXYBzinNrblfraPGyrbPoD19C1h9lfI/1mzgWYvXUTe414Gz/X1FD2XBZSZM7rRTrMA8JL3OtAaGifrIKhQ5yQ==", + "dev": true, + "license": "MPL-2.0", + "dependencies": { + "detect-libc": "^2.0.3" + }, + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + }, + "optionalDependencies": { + "lightningcss-android-arm64": "1.32.0", + "lightningcss-darwin-arm64": "1.32.0", + "lightningcss-darwin-x64": "1.32.0", + "lightningcss-freebsd-x64": "1.32.0", + "lightningcss-linux-arm-gnueabihf": "1.32.0", + "lightningcss-linux-arm64-gnu": "1.32.0", + "lightningcss-linux-arm64-musl": "1.32.0", + "lightningcss-linux-x64-gnu": "1.32.0", + "lightningcss-linux-x64-musl": "1.32.0", + "lightningcss-win32-arm64-msvc": "1.32.0", + "lightningcss-win32-x64-msvc": "1.32.0" + } + }, + "node_modules/lightningcss-android-arm64": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-android-arm64/-/lightningcss-android-arm64-1.32.0.tgz", + "integrity": "sha512-YK7/ClTt4kAK0vo6w3X+Pnm0D2cf2vPHbhOXdoNti1Ga0al1P4TBZhwjATvjNwLEBCnKvjJc2jQgHXH0NEwlAg==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "android" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-darwin-arm64": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-darwin-arm64/-/lightningcss-darwin-arm64-1.32.0.tgz", + "integrity": "sha512-RzeG9Ju5bag2Bv1/lwlVJvBE3q6TtXskdZLLCyfg5pt+HLz9BqlICO7LZM7VHNTTn/5PRhHFBSjk5lc4cmscPQ==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-darwin-x64": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-darwin-x64/-/lightningcss-darwin-x64-1.32.0.tgz", + "integrity": "sha512-U+QsBp2m/s2wqpUYT/6wnlagdZbtZdndSmut/NJqlCcMLTWp5muCrID+K5UJ6jqD2BFshejCYXniPDbNh73V8w==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "darwin" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-freebsd-x64": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-freebsd-x64/-/lightningcss-freebsd-x64-1.32.0.tgz", + "integrity": "sha512-JCTigedEksZk3tHTTthnMdVfGf61Fky8Ji2E4YjUTEQX14xiy/lTzXnu1vwiZe3bYe0q+SpsSH/CTeDXK6WHig==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "freebsd" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-linux-arm-gnueabihf": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-linux-arm-gnueabihf/-/lightningcss-linux-arm-gnueabihf-1.32.0.tgz", + "integrity": "sha512-x6rnnpRa2GL0zQOkt6rts3YDPzduLpWvwAF6EMhXFVZXD4tPrBkEFqzGowzCsIWsPjqSK+tyNEODUBXeeVHSkw==", + "cpu": [ + "arm" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-linux-arm64-gnu": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-linux-arm64-gnu/-/lightningcss-linux-arm64-gnu-1.32.0.tgz", + "integrity": "sha512-0nnMyoyOLRJXfbMOilaSRcLH3Jw5z9HDNGfT/gwCPgaDjnx0i8w7vBzFLFR1f6CMLKF8gVbebmkUN3fa/kQJpQ==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-linux-arm64-musl": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-linux-arm64-musl/-/lightningcss-linux-arm64-musl-1.32.0.tgz", + "integrity": "sha512-UpQkoenr4UJEzgVIYpI80lDFvRmPVg6oqboNHfoH4CQIfNA+HOrZ7Mo7KZP02dC6LjghPQJeBsvXhJod/wnIBg==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-linux-x64-gnu": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-linux-x64-gnu/-/lightningcss-linux-x64-gnu-1.32.0.tgz", + "integrity": "sha512-V7Qr52IhZmdKPVr+Vtw8o+WLsQJYCTd8loIfpDaMRWGUZfBOYEJeyJIkqGIDMZPwPx24pUMfwSxxI8phr/MbOA==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-linux-x64-musl": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-linux-x64-musl/-/lightningcss-linux-x64-musl-1.32.0.tgz", + "integrity": "sha512-bYcLp+Vb0awsiXg/80uCRezCYHNg1/l3mt0gzHnWV9XP1W5sKa5/TCdGWaR/zBM2PeF/HbsQv/j2URNOiVuxWg==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "linux" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-win32-arm64-msvc": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-win32-arm64-msvc/-/lightningcss-win32-arm64-msvc-1.32.0.tgz", + "integrity": "sha512-8SbC8BR40pS6baCM8sbtYDSwEVQd4JlFTOlaD3gWGHfThTcABnNDBda6eTZeqbofalIJhFx0qKzgHJmcPTnGdw==", + "cpu": [ + "arm64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/lightningcss-win32-x64-msvc": { + "version": "1.32.0", + "resolved": "https://registry.npmjs.org/lightningcss-win32-x64-msvc/-/lightningcss-win32-x64-msvc-1.32.0.tgz", + "integrity": "sha512-Amq9B/SoZYdDi1kFrojnoqPLxYhQ4Wo5XiL8EVJrVsB8ARoC1PWW6VGtT0WKCemjy8aC+louJnjS7U18x3b06Q==", + "cpu": [ + "x64" + ], + "dev": true, + "license": "MPL-2.0", + "optional": true, + "os": [ + "win32" + ], + "engines": { + "node": ">= 12.0.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/parcel" + } + }, + "node_modules/locate-path": { + "version": "6.0.0", + "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-6.0.0.tgz", + "integrity": "sha512-iPZK6eYjbxRu3uB4/WZ3EsEIMJFMqAoopl3R+zuq0UjcAm/MO6KCweDgPfP3elTztoKP3KtnVHxTn2NHBSDVUw==", + "dev": true, + "license": "MIT", + "dependencies": { + "p-locate": "^5.0.0" + }, + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/lru-cache": { + "version": "5.1.1", + "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-5.1.1.tgz", + "integrity": "sha512-KpNARQA3Iwv+jTA0utUVVbrh+Jlrr1Fv0e56GGzAFOXN7dk/FviaDW8LHmK52DlcH4WP2n6gI8vN1aesBFgo9w==", + "dev": true, + "license": "ISC", + "dependencies": { + "yallist": "^3.0.2" + } + }, + "node_modules/minimatch": { + "version": "10.2.5", + "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-10.2.5.tgz", + "integrity": "sha512-MULkVLfKGYDFYejP07QOurDLLQpcjk7Fw+7jXS2R2czRQzR56yHRveU5NDJEOviH+hETZKSkIk5c+T23GjFUMg==", + "dev": true, + "license": "BlueOak-1.0.0", + "dependencies": { + "brace-expansion": "^5.0.5" + }, + "engines": { + "node": "18 || 20 || >=22" + }, + "funding": { + "url": "https://github.com/sponsors/isaacs" + } + }, + "node_modules/ms": { + "version": "2.1.3", + "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz", + "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==", + "dev": true, + "license": "MIT" + }, + "node_modules/nanoid": { + "version": "3.3.12", + "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.12.tgz", + "integrity": "sha512-ZB9RH/39qpq5Vu6Y+NmUaFhQR6pp+M2Xt76XBnEwDaGcVAqhlvxrl3B2bKS5D3NH3QR76v3aSrKaF/Kiy7lEtQ==", + "dev": true, + "funding": [ + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], + "license": "MIT", + "bin": { + "nanoid": "bin/nanoid.cjs" + }, + "engines": { + "node": "^10 || ^12 || ^13.7 || ^14 || >=15.0.1" + } + }, + "node_modules/natural-compare": { + "version": "1.4.0", + "resolved": "https://registry.npmjs.org/natural-compare/-/natural-compare-1.4.0.tgz", + "integrity": "sha512-OWND8ei3VtNC9h7V60qff3SVobHr996CTwgxubgyQYEpg290h9J0buyECNNJexkFm5sOajh5G116RYA1c8ZMSw==", + "dev": true, + "license": "MIT" + }, + "node_modules/node-releases": { + "version": "2.0.44", + "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-2.0.44.tgz", + "integrity": "sha512-5WUyunoPMsvvEhS8AxHtRzP+oA8UCkJ7YRxatWKjngndhDGLiqEVAQKWjFAiAiuL8zMRGzGSJxFnLetoa43qGQ==", + "dev": true, + "license": "MIT" + }, + "node_modules/optionator": { + "version": "0.9.4", + "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.9.4.tgz", + "integrity": "sha512-6IpQ7mKUxRcZNLIObR0hz7lxsapSSIYNZJwXPGeF0mTVqGKFIXj1DQcMoT22S3ROcLyY/rz0PWaWZ9ayWmad9g==", + "dev": true, + "license": "MIT", + "dependencies": { + "deep-is": "^0.1.3", + "fast-levenshtein": "^2.0.6", + "levn": "^0.4.1", + "prelude-ls": "^1.2.1", + "type-check": "^0.4.0", + "word-wrap": "^1.2.5" + }, + "engines": { + "node": ">= 0.8.0" + } + }, + "node_modules/p-limit": { + "version": "3.1.0", + "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-3.1.0.tgz", + "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "yocto-queue": "^0.1.0" + }, + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/p-locate": { + "version": "5.0.0", + "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-5.0.0.tgz", + "integrity": "sha512-LaNjtRWUBY++zB5nE/NwcaoMylSPk+S+ZHNB1TzdbMJMny6dynpAGt7X/tl/QYq3TIeE6nxHppbo2LGymrG5Pw==", + "dev": true, + "license": "MIT", + "dependencies": { + "p-limit": "^3.0.2" + }, + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/path-exists": { + "version": "4.0.0", + "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-4.0.0.tgz", + "integrity": "sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=8" + } + }, + "node_modules/path-key": { + "version": "3.1.1", + "resolved": "https://registry.npmjs.org/path-key/-/path-key-3.1.1.tgz", + "integrity": "sha512-ojmeN0qd+y0jszEtoY48r0Peq5dwMEkIlCOu6Q5f41lfkswXuKtYrhgoTpLnyIcHm24Uhqx+5Tqm2InSwLhE6Q==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=8" + } + }, + "node_modules/picocolors": { + "version": "1.1.1", + "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.1.1.tgz", + "integrity": "sha512-xceH2snhtb5M9liqDsmEw56le376mTZkEX/jEb/RxNFyegNul7eNslCXP9FDj/Lcu0X8KEyMceP2ntpaHrDEVA==", + "dev": true, + "license": "ISC" + }, + "node_modules/picomatch": { + "version": "4.0.4", + "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-4.0.4.tgz", + "integrity": "sha512-QP88BAKvMam/3NxH6vj2o21R6MjxZUAd6nlwAS/pnGvN9IVLocLHxGYIzFhg6fUQ+5th6P4dv4eW9jX3DSIj7A==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=12" + }, + "funding": { + "url": "https://github.com/sponsors/jonschlinkert" + } + }, + "node_modules/postcss": { + "version": "8.5.15", + "resolved": "https://registry.npmjs.org/postcss/-/postcss-8.5.15.tgz", + "integrity": "sha512-FfR8sjd4em2T6fb3I2MwAJU7HWVMr9zba+enmQeeWFfCbm+UOC/0X4DS8XtpUTMwWMGbjKYP7xjfNekzyGmB3A==", + "dev": true, + "funding": [ + { + "type": "opencollective", + "url": "https://opencollective.com/postcss/" + }, + { + "type": "tidelift", + "url": "https://tidelift.com/funding/github/npm/postcss" + }, + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], + "license": "MIT", + "dependencies": { + "nanoid": "^3.3.12", + "picocolors": "^1.1.1", + "source-map-js": "^1.2.1" + }, + "engines": { + "node": "^10 || ^12 || >=14" + } + }, + "node_modules/prelude-ls": { + "version": "1.2.1", + "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz", + "integrity": "sha512-vkcDPrRZo1QZLbn5RLGPpg/WmIQ65qoWWhcGKf/b5eplkkarX0m9z8ppCat4mlOqUsWpyNuYgO3VRyrYHSzX5g==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">= 0.8.0" + } + }, + "node_modules/punycode": { + "version": "2.3.1", + "resolved": "https://registry.npmjs.org/punycode/-/punycode-2.3.1.tgz", + "integrity": "sha512-vYt7UD1U9Wg6138shLtLOvdAu+8DsC/ilFtEVHcH+wydcSpNE20AfSOduf6MkRFahL5FY7X1oU7nKVZFtfq8Fg==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=6" + } + }, + "node_modules/react": { + "version": "19.2.6", + "resolved": "https://registry.npmjs.org/react/-/react-19.2.6.tgz", + "integrity": "sha512-sfWGGfavi0xr8Pg0sVsyHMAOziVYKgPLNrS7ig+ivMNb3wbCBw3KxtflsGBAwD3gYQlE/AEZsTLgToRrSCjb0Q==", + "license": "MIT", + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/react-dom": { + "version": "19.2.6", + "resolved": "https://registry.npmjs.org/react-dom/-/react-dom-19.2.6.tgz", + "integrity": "sha512-0prMI+hvBbPjsWnxDLxlCGyM8PN6UuWjEUCYmZhO67xIV9Xasa/r/vDnq+Xyq4Lo27g8QSbO5YzARu0D1Sps3g==", + "license": "MIT", + "dependencies": { + "scheduler": "^0.27.0" + }, + "peerDependencies": { + "react": "^19.2.6" + } + }, + "node_modules/react-router": { + "version": "7.15.1", + "resolved": "https://registry.npmjs.org/react-router/-/react-router-7.15.1.tgz", + "integrity": "sha512-R8rl9HhgikFYoPJymnUtPXWbnDb3oget6lQnfIoupbt61aT9aOhRkDsY2XRhZRyX1Z/8a5sL74fXmFNm3NRK5A==", + "license": "MIT", + "dependencies": { + "cookie": "^1.0.1", + "set-cookie-parser": "^2.6.0" + }, + "engines": { + "node": ">=20.0.0" + }, + "peerDependencies": { + "react": ">=18", + "react-dom": ">=18" + }, + "peerDependenciesMeta": { + "react-dom": { + "optional": true + } + } + }, + "node_modules/react-router-dom": { + "version": "7.15.1", + "resolved": "https://registry.npmjs.org/react-router-dom/-/react-router-dom-7.15.1.tgz", + "integrity": "sha512-AzF62gjY6U9rkMq4RfP/r2EVtQ7DMfNMjyOp/flLTCrtRylLiK4wT4pSq6O8rOXZ2eXdZYJPEYe+ifomiv+Igg==", + "license": "MIT", + "dependencies": { + "react-router": "7.15.1" + }, + "engines": { + "node": ">=20.0.0" + }, + "peerDependencies": { + "react": ">=18", + "react-dom": ">=18" + } + }, + "node_modules/rolldown": { + "version": "1.0.1", + "resolved": "https://registry.npmjs.org/rolldown/-/rolldown-1.0.1.tgz", + "integrity": "sha512-X0KQHljNnEkWNqqiz9zJrGunh1B0HgOxLXvnFpCOcadzcy5qohZ3tqMEUg00vncoRovXuK3ZqCT9KnnKzoInFQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@oxc-project/types": "=0.130.0", + "@rolldown/pluginutils": "^1.0.0" + }, + "bin": { + "rolldown": "bin/cli.mjs" + }, + "engines": { + "node": "^20.19.0 || >=22.12.0" + }, + "optionalDependencies": { + "@rolldown/binding-android-arm64": "1.0.1", + "@rolldown/binding-darwin-arm64": "1.0.1", + "@rolldown/binding-darwin-x64": "1.0.1", + "@rolldown/binding-freebsd-x64": "1.0.1", + "@rolldown/binding-linux-arm-gnueabihf": "1.0.1", + "@rolldown/binding-linux-arm64-gnu": "1.0.1", + "@rolldown/binding-linux-arm64-musl": "1.0.1", + "@rolldown/binding-linux-ppc64-gnu": "1.0.1", + "@rolldown/binding-linux-s390x-gnu": "1.0.1", + "@rolldown/binding-linux-x64-gnu": "1.0.1", + "@rolldown/binding-linux-x64-musl": "1.0.1", + "@rolldown/binding-openharmony-arm64": "1.0.1", + "@rolldown/binding-wasm32-wasi": "1.0.1", + "@rolldown/binding-win32-arm64-msvc": "1.0.1", + "@rolldown/binding-win32-x64-msvc": "1.0.1" + } + }, + "node_modules/scheduler": { + "version": "0.27.0", + "resolved": "https://registry.npmjs.org/scheduler/-/scheduler-0.27.0.tgz", + "integrity": "sha512-eNv+WrVbKu1f3vbYJT/xtiF5syA5HPIMtf9IgY/nKg0sWqzAUEvqY/xm7OcZc/qafLx/iO9FgOmeSAp4v5ti/Q==", + "license": "MIT" + }, + "node_modules/semver": { + "version": "6.3.1", + "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz", + "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==", + "dev": true, + "license": "ISC", + "bin": { + "semver": "bin/semver.js" + } + }, + "node_modules/set-cookie-parser": { + "version": "2.7.2", + "resolved": "https://registry.npmjs.org/set-cookie-parser/-/set-cookie-parser-2.7.2.tgz", + "integrity": "sha512-oeM1lpU/UvhTxw+g3cIfxXHyJRc/uidd3yK1P242gzHds0udQBYzs3y8j4gCCW+ZJ7ad0yctld8RYO+bdurlvw==", + "license": "MIT" + }, + "node_modules/shebang-command": { + "version": "2.0.0", + "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-2.0.0.tgz", + "integrity": "sha512-kHxr2zZpYtdmrN1qDjrrX/Z1rR1kG8Dx+gkpK1G4eXmvXswmcE1hTWBWYUzlraYw1/yZp6YuDY77YtvbN0dmDA==", + "dev": true, + "license": "MIT", + "dependencies": { + "shebang-regex": "^3.0.0" + }, + "engines": { + "node": ">=8" + } + }, + "node_modules/shebang-regex": { + "version": "3.0.0", + "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-3.0.0.tgz", + "integrity": "sha512-7++dFhtcx3353uBaq8DDR4NuxBetBzC7ZQOhmTQInHEd6bSrXdiEyzCvG07Z44UYdLShWUyXt5M/yhz8ekcb1A==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=8" + } + }, + "node_modules/source-map-js": { + "version": "1.2.1", + "resolved": "https://registry.npmjs.org/source-map-js/-/source-map-js-1.2.1.tgz", + "integrity": "sha512-UXWMKhLOwVKb728IUtQPXxfYU+usdybtUrK/8uGE8CQMvrhOpwvzDBwj0QhSL7MQc7vIsISBG8VQ8+IDQxpfQA==", + "dev": true, + "license": "BSD-3-Clause", + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/tinyglobby": { + "version": "0.2.16", + "resolved": "https://registry.npmjs.org/tinyglobby/-/tinyglobby-0.2.16.tgz", + "integrity": "sha512-pn99VhoACYR8nFHhxqix+uvsbXineAasWm5ojXoN8xEwK5Kd3/TrhNn1wByuD52UxWRLy8pu+kRMniEi6Eq9Zg==", + "dev": true, + "license": "MIT", + "dependencies": { + "fdir": "^6.5.0", + "picomatch": "^4.0.4" + }, + "engines": { + "node": ">=12.0.0" + }, + "funding": { + "url": "https://github.com/sponsors/SuperchupuDev" + } + }, + "node_modules/ts-api-utils": { + "version": "2.5.0", + "resolved": "https://registry.npmjs.org/ts-api-utils/-/ts-api-utils-2.5.0.tgz", + "integrity": "sha512-OJ/ibxhPlqrMM0UiNHJ/0CKQkoKF243/AEmplt3qpRgkW8VG7IfOS41h7V8TjITqdByHzrjcS/2si+y4lIh8NA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=18.12" + }, + "peerDependencies": { + "typescript": ">=4.8.4" + } + }, + "node_modules/tslib": { + "version": "2.8.1", + "resolved": "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz", + "integrity": "sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w==", + "dev": true, + "license": "0BSD", + "optional": true + }, + "node_modules/type-check": { + "version": "0.4.0", + "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.4.0.tgz", + "integrity": "sha512-XleUoc9uwGXqjWwXaUTZAmzMcFZ5858QA2vvx1Ur5xIcixXIP+8LnFDgRplU30us6teqdlskFfu+ae4K79Ooew==", + "dev": true, + "license": "MIT", + "dependencies": { + "prelude-ls": "^1.2.1" + }, + "engines": { + "node": ">= 0.8.0" + } + }, + "node_modules/typescript": { + "version": "6.0.3", + "resolved": "https://registry.npmjs.org/typescript/-/typescript-6.0.3.tgz", + "integrity": "sha512-y2TvuxSZPDyQakkFRPZHKFm+KKVqIisdg9/CZwm9ftvKXLP8NRWj38/ODjNbr43SsoXqNuAisEf1GdCxqWcdBw==", + "dev": true, + "license": "Apache-2.0", + "bin": { + "tsc": "bin/tsc", + "tsserver": "bin/tsserver" + }, + "engines": { + "node": ">=14.17" + } + }, + "node_modules/typescript-eslint": { + "version": "8.59.4", + "resolved": "https://registry.npmjs.org/typescript-eslint/-/typescript-eslint-8.59.4.tgz", + "integrity": "sha512-Rw6+44QNFaXtgHSjPy+Kw8hrJniMYzR85E9yLmOLcfZ91/rz+JXQbDTCmc6ccxMPY6K6PgAq26f0JCBfR7LIPQ==", + "dev": true, + "license": "MIT", + "dependencies": { + "@typescript-eslint/eslint-plugin": "8.59.4", + "@typescript-eslint/parser": "8.59.4", + "@typescript-eslint/typescript-estree": "8.59.4", + "@typescript-eslint/utils": "8.59.4" + }, + "engines": { + "node": "^18.18.0 || ^20.9.0 || >=21.1.0" + }, + "funding": { + "type": "opencollective", + "url": "https://opencollective.com/typescript-eslint" + }, + "peerDependencies": { + "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0", + "typescript": ">=4.8.4 <6.1.0" + } + }, + "node_modules/undici-types": { + "version": "7.16.0", + "resolved": "https://registry.npmjs.org/undici-types/-/undici-types-7.16.0.tgz", + "integrity": "sha512-Zz+aZWSj8LE6zoxD+xrjh4VfkIG8Ya6LvYkZqtUQGJPZjYl53ypCaUwWqo7eI0x66KBGeRo+mlBEkMSeSZ38Nw==", + "dev": true, + "license": "MIT" + }, + "node_modules/update-browserslist-db": { + "version": "1.2.3", + "resolved": "https://registry.npmjs.org/update-browserslist-db/-/update-browserslist-db-1.2.3.tgz", + "integrity": "sha512-Js0m9cx+qOgDxo0eMiFGEueWztz+d4+M3rGlmKPT+T4IS/jP4ylw3Nwpu6cpTTP8R1MAC1kF4VbdLt3ARf209w==", + "dev": true, + "funding": [ + { + "type": "opencollective", + "url": "https://opencollective.com/browserslist" + }, + { + "type": "tidelift", + "url": "https://tidelift.com/funding/github/npm/browserslist" + }, + { + "type": "github", + "url": "https://github.com/sponsors/ai" + } + ], + "license": "MIT", + "dependencies": { + "escalade": "^3.2.0", + "picocolors": "^1.1.1" + }, + "bin": { + "update-browserslist-db": "cli.js" + }, + "peerDependencies": { + "browserslist": ">= 4.21.0" + } + }, + "node_modules/uri-js": { + "version": "4.4.1", + "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz", + "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==", + "dev": true, + "license": "BSD-2-Clause", + "dependencies": { + "punycode": "^2.1.0" + } + }, + "node_modules/vite": { + "version": "8.0.13", + "resolved": "https://registry.npmjs.org/vite/-/vite-8.0.13.tgz", + "integrity": "sha512-MFtjBYgzmSxmgA4RAfjIyXWpGe1oALnjgUTzzV7QLx/TKxCzjtMH6Fd9/eVK+5Fg1qNoz5VAwsmMs/NofrmJvw==", + "dev": true, + "license": "MIT", + "dependencies": { + "lightningcss": "^1.32.0", + "picomatch": "^4.0.4", + "postcss": "^8.5.14", + "rolldown": "1.0.1", + "tinyglobby": "^0.2.16" + }, + "bin": { + "vite": "bin/vite.js" + }, + "engines": { + "node": "^20.19.0 || >=22.12.0" + }, + "funding": { + "url": "https://github.com/vitejs/vite?sponsor=1" + }, + "optionalDependencies": { + "fsevents": "~2.3.3" + }, + "peerDependencies": { + "@types/node": "^20.19.0 || >=22.12.0", + "@vitejs/devtools": "^0.1.18", + "esbuild": "^0.27.0 || ^0.28.0", + "jiti": ">=1.21.0", + "less": "^4.0.0", + "sass": "^1.70.0", + "sass-embedded": "^1.70.0", + "stylus": ">=0.54.8", + "sugarss": "^5.0.0", + "terser": "^5.16.0", + "tsx": "^4.8.1", + "yaml": "^2.4.2" + }, + "peerDependenciesMeta": { + "@types/node": { + "optional": true + }, + "@vitejs/devtools": { + "optional": true + }, + "esbuild": { + "optional": true + }, + "jiti": { + "optional": true + }, + "less": { + "optional": true + }, + "sass": { + "optional": true + }, + "sass-embedded": { + "optional": true + }, + "stylus": { + "optional": true + }, + "sugarss": { + "optional": true + }, + "terser": { + "optional": true + }, + "tsx": { + "optional": true + }, + "yaml": { + "optional": true + } + } + }, + "node_modules/which": { + "version": "2.0.2", + "resolved": "https://registry.npmjs.org/which/-/which-2.0.2.tgz", + "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==", + "dev": true, + "license": "ISC", + "dependencies": { + "isexe": "^2.0.0" + }, + "bin": { + "node-which": "bin/node-which" + }, + "engines": { + "node": ">= 8" + } + }, + "node_modules/word-wrap": { + "version": "1.2.5", + "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.5.tgz", + "integrity": "sha512-BN22B5eaMMI9UMtjrGd5g5eCYPpCPDUy0FJXbYsaT5zYxjFOckS53SQDE3pWkVoWpHXVb3BrYcEN4Twa55B5cA==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=0.10.0" + } + }, + "node_modules/yallist": { + "version": "3.1.1", + "resolved": "https://registry.npmjs.org/yallist/-/yallist-3.1.1.tgz", + "integrity": "sha512-a4UGQaWPH59mOXUYnAG2ewncQS4i4F43Tv3JoAM+s2VDAmS9NsK8GpDMLrCHPksFT7h3K6TOoUNn2pb7RoXx4g==", + "dev": true, + "license": "ISC" + }, + "node_modules/yocto-queue": { + "version": "0.1.0", + "resolved": "https://registry.npmjs.org/yocto-queue/-/yocto-queue-0.1.0.tgz", + "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=10" + }, + "funding": { + "url": "https://github.com/sponsors/sindresorhus" + } + }, + "node_modules/zod": { + "version": "4.4.3", + "resolved": "https://registry.npmjs.org/zod/-/zod-4.4.3.tgz", + "integrity": "sha512-ytENFjIJFl2UwYglde2jchW2Hwm4GJFLDiSXWdTrJQBIN9Fcyp7n4DhxJEiWNAJMV1/BqWfW/kkg71UDcHJyTQ==", + "dev": true, + "license": "MIT", + "funding": { + "url": "https://github.com/sponsors/colinhacks" + } + }, + "node_modules/zod-validation-error": { + "version": "4.0.2", + "resolved": "https://registry.npmjs.org/zod-validation-error/-/zod-validation-error-4.0.2.tgz", + "integrity": "sha512-Q6/nZLe6jxuU80qb/4uJ4t5v2VEZ44lzQjPDhYJNztRQ4wyWc6VF3D3Kb/fAuPetZQnhS3hnajCf9CsWesghLQ==", + "dev": true, + "license": "MIT", + "engines": { + "node": ">=18.0.0" + }, + "peerDependencies": { + "zod": "^3.25.0 || ^4.0.0" + } + } + } +} diff --git a/frontend/package.json b/frontend/package.json new file mode 100644 index 0000000000000000000000000000000000000000..d6d013b573e2f9502a219b23a8b2e8bc4e94b699 --- /dev/null +++ b/frontend/package.json @@ -0,0 +1,31 @@ +{ + "name": "frontend", + "private": true, + "version": "0.0.0", + "type": "module", + "scripts": { + "dev": "vite", + "build": "tsc -b && vite build", + "lint": "eslint .", + "preview": "vite preview" + }, + "dependencies": { + "react": "^19.2.6", + "react-dom": "^19.2.6", + "react-router-dom": "^7.9.6" + }, + "devDependencies": { + "@eslint/js": "^10.0.1", + "@types/node": "^24.12.3", + "@types/react": "^19.2.14", + "@types/react-dom": "^19.2.3", + "@vitejs/plugin-react": "^6.0.1", + "eslint": "^10.3.0", + "eslint-plugin-react-hooks": "^7.1.1", + "eslint-plugin-react-refresh": "^0.5.2", + "globals": "^17.6.0", + "typescript": "~6.0.2", + "typescript-eslint": "^8.59.2", + "vite": "^8.0.12" + } +} diff --git a/frontend/public/favicon.svg b/frontend/public/favicon.svg new file mode 100644 index 0000000000000000000000000000000000000000..6893eb13237060adc0c968a690149a49faa2d7d3 --- /dev/null +++ b/frontend/public/favicon.svg @@ -0,0 +1 @@ + \ No newline at end of file diff --git a/frontend/public/icons.svg b/frontend/public/icons.svg new file mode 100644 index 0000000000000000000000000000000000000000..e9522193d9f796a9748e9ad8c952a5df73c87db9 --- /dev/null +++ b/frontend/public/icons.svg @@ -0,0 +1,24 @@ + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/frontend/src/App.tsx b/frontend/src/App.tsx new file mode 100644 index 0000000000000000000000000000000000000000..12203cc126e17faee265cc5f87043b345290569b --- /dev/null +++ b/frontend/src/App.tsx @@ -0,0 +1,17 @@ +import { BrowserRouter, Route, Routes } from "react-router-dom"; + +import { DonePage } from "./routes/DonePage"; +import { HomePage } from "./routes/HomePage"; +import { PlayPage } from "./routes/PlayPage"; + +export default function App() { + return ( + + + } /> + } /> + } /> + + + ); +} diff --git a/frontend/src/assets/hero.png b/frontend/src/assets/hero.png new file mode 100644 index 0000000000000000000000000000000000000000..02251f4b956c55af2d76fd0788124d7eee2b45eb Binary files /dev/null and b/frontend/src/assets/hero.png differ diff --git a/frontend/src/assets/react.svg b/frontend/src/assets/react.svg new file mode 100644 index 0000000000000000000000000000000000000000..6c87de9bb3358469122cc991d5cf578927246184 --- /dev/null +++ b/frontend/src/assets/react.svg @@ -0,0 +1 @@ + \ No newline at end of file diff --git a/frontend/src/assets/vite.svg b/frontend/src/assets/vite.svg new file mode 100644 index 0000000000000000000000000000000000000000..5101b674df391399da71c767aa5c976426c9dc7a --- /dev/null +++ b/frontend/src/assets/vite.svg @@ -0,0 +1 @@ +Vite diff --git a/frontend/src/components/PuzzleEditor.tsx b/frontend/src/components/PuzzleEditor.tsx new file mode 100644 index 0000000000000000000000000000000000000000..3a26c4e46e042557d875d67940b90a244b4a093b --- /dev/null +++ b/frontend/src/components/PuzzleEditor.tsx @@ -0,0 +1,866 @@ +import { useState } from "react"; + +import type { PuzzleType } from "../lib/api"; + +type Props = { + puzzleType: PuzzleType; + problemAscii: string; + boardAscii: string; + onChange: (nextAscii: string) => void; +}; + +type BridgesOpportunity = { + id: string; + kind: "horizontal" | "vertical"; + cells: Array<[number, number]>; + from: [number, number]; + to: [number, number]; +}; + +type LoopyEdge = { + id: string; + kind: "horizontal" | "vertical"; + row: number; + col: number; + boardRow: number; + boardCol: number; +}; + +type GalaxyBoundary = { + id: string; + kind: "horizontal" | "vertical"; + row: number; + col: number; + boardRow: number; + boardCol: number; +}; + +type GalaxyDot = { + rowCoord: number; + colCoord: number; +}; + +type PatternRow = { + prefix: string; + cells: string[]; + border: string; +}; + +type UndeadRow = { + left: string; + cells: string[]; + right: string; +}; + +const FLOW_FREE_COLORS = [ + "#f15b5d", + "#f5a623", + "#f6df5a", + "#7ed957", + "#36cfc9", + "#4b8ef7", + "#7a5cff", + "#ff8bd1", + "#7d5a50", + "#5f6a6b", +]; + +function splitLines(board: string): string[] { + return board.replace(/\r/g, "").split("\n"); +} + +function cloneGrid(lines: string[]): string[][] { + return lines.map((line) => [...line]); +} + +function joinGrid(grid: string[][]): string { + return grid.map((row) => row.join("")).join("\n"); +} + +function padLines(lines: string[], width: number): string[] { + return lines.map((line) => line.padEnd(width, " ")); +} + +function isClueChar(char: string): boolean { + return /[0-9A-G]/.test(char); +} + +function parseBridges(problemAscii: string) { + const lines = splitLines(problemAscii); + const opportunities: BridgesOpportunity[] = []; + const cellToOpportunity = new Map(); + for (let r = 0; r < lines.length; r += 1) { + for (let c = 0; c < lines[r].length; c += 1) { + if (!isClueChar(lines[r][c])) { + continue; + } + + let next = c + 1; + while (next < lines[r].length && lines[r][next] === ".") { + next += 1; + } + if (next < lines[r].length && isClueChar(lines[r][next]) && next > c + 1) { + const opp: BridgesOpportunity = { + id: `h-${r}-${c}-${next}`, + kind: "horizontal", + cells: [], + from: [r, c], + to: [r, next], + }; + for (let cell = c + 1; cell < next; cell += 1) { + opp.cells.push([r, cell]); + cellToOpportunity.set(`${r}:${cell}`, opp); + } + opportunities.push(opp); + } + + let nextRow = r + 1; + while (nextRow < lines.length && c < lines[nextRow].length && lines[nextRow][c] === ".") { + nextRow += 1; + } + if ( + nextRow < lines.length && + c < lines[nextRow].length && + isClueChar(lines[nextRow][c]) && + nextRow > r + 1 + ) { + const opp: BridgesOpportunity = { + id: `v-${r}-${c}-${nextRow}`, + kind: "vertical", + cells: [], + from: [r, c], + to: [nextRow, c], + }; + for (let cell = r + 1; cell < nextRow; cell += 1) { + opp.cells.push([cell, c]); + cellToOpportunity.set(`${cell}:${c}`, opp); + } + opportunities.push(opp); + } + } + } + return { lines, opportunities, cellToOpportunity }; +} + +function bridgesBoardFromStates( + problemAscii: string, + states: Record, +): string { + const parsed = parseBridges(problemAscii); + const grid = cloneGrid(parsed.lines); + for (const opportunity of parsed.opportunities) { + const level = states[opportunity.id] ?? 0; + const symbol = + opportunity.kind === "horizontal" + ? level === 2 + ? "=" + : level === 1 + ? "-" + : "." + : level === 2 + ? '"' + : level === 1 + ? "|" + : "."; + for (const [r, c] of opportunity.cells) { + grid[r][c] = symbol; + } + } + return joinGrid(grid); +} + +function bridgesStatesFromBoard( + problemAscii: string, + boardAscii: string, +): Record { + const parsed = parseBridges(problemAscii); + const boardLines = splitLines(boardAscii); + const states: Record = {}; + for (const opportunity of parsed.opportunities) { + const [r, c] = opportunity.cells[0]; + const char = boardLines[r]?.[c] ?? "."; + if (opportunity.kind === "horizontal") { + states[opportunity.id] = char === "=" ? 2 : char === "-" ? 1 : 0; + } else { + states[opportunity.id] = char === '"' ? 2 : char === "|" ? 1 : 0; + } + } + return states; +} + +function parseLoopy(problemAscii: string) { + const lines = splitLines(problemAscii); + const rows = Math.max(0, Math.floor((lines.length - 3) / 2)); + const cols = Math.max(0, Math.floor(((lines[0]?.length ?? 0) - 3) / 2)); + const clues = new Map(); + const horizontalEdges: LoopyEdge[] = []; + const verticalEdges: LoopyEdge[] = []; + + for (let r = 0; r < rows; r += 1) { + for (let c = 0; c < cols; c += 1) { + const char = lines[2 + 2 * r]?.[2 + 2 * c] ?? " "; + if (/\d/.test(char)) { + clues.set(`${r}:${c}`, char); + } + } + } + + for (let r = 0; r <= rows; r += 1) { + for (let c = 0; c < cols; c += 1) { + horizontalEdges.push({ + id: `h-${r}-${c}`, + kind: "horizontal", + row: r, + col: c, + boardRow: 1 + 2 * r, + boardCol: 2 + 2 * c, + }); + } + } + + for (let r = 0; r < rows; r += 1) { + for (let c = 0; c <= cols; c += 1) { + verticalEdges.push({ + id: `v-${r}-${c}`, + kind: "vertical", + row: r, + col: c, + boardRow: 2 + 2 * r, + boardCol: 1 + 2 * c, + }); + } + } + + return { lines, rows, cols, clues, horizontalEdges, verticalEdges }; +} + +function loopyEdgeStates( + problemAscii: string, + boardAscii: string, +): Record { + const puzzle = parseLoopy(problemAscii); + const width = puzzle.lines[0]?.length ?? 0; + const boardLines = padLines(splitLines(boardAscii), width); + const states: Record = {}; + + for (const edge of [...puzzle.horizontalEdges, ...puzzle.verticalEdges]) { + const char = boardLines[edge.boardRow]?.[edge.boardCol] ?? " "; + states[edge.id] = char === "-" || char === "|" ? "line" : char === "x" ? "blocked" : "unknown"; + } + return states; +} + +function loopyBoardFromStates( + problemAscii: string, + states: Record, +): string { + const puzzle = parseLoopy(problemAscii); + const width = puzzle.lines[0]?.length ?? 0; + const grid = cloneGrid(padLines(puzzle.lines, width)); + + for (const edge of puzzle.horizontalEdges) { + const state = states[edge.id] ?? "unknown"; + grid[edge.boardRow][edge.boardCol] = state === "line" ? "-" : state === "blocked" ? "x" : " "; + } + for (const edge of puzzle.verticalEdges) { + const state = states[edge.id] ?? "unknown"; + grid[edge.boardRow][edge.boardCol] = state === "line" ? "|" : state === "blocked" ? "x" : " "; + } + + return joinGrid(grid); +} + +function parseGalaxies(problemAscii: string) { + const lines = splitLines(problemAscii); + const rows = Math.max(0, Math.floor(((lines.length ?? 0) - 1) / 2)); + const cols = Math.max(0, Math.floor(((lines[0]?.length ?? 0) - 1) / 2)); + const horizontalBoundaries: GalaxyBoundary[] = []; + const verticalBoundaries: GalaxyBoundary[] = []; + const dots: GalaxyDot[] = []; + + for (let boardRow = 0; boardRow < lines.length; boardRow += 1) { + const line = lines[boardRow] ?? ""; + for (let boardCol = 0; boardCol < line.length; boardCol += 1) { + if (line[boardCol] === "o") { + dots.push({ rowCoord: boardRow, colCoord: boardCol }); + } + } + } + + for (let r = 1; r < rows; r += 1) { + for (let c = 0; c < cols; c += 1) { + horizontalBoundaries.push({ + id: `h-${r}-${c}`, + kind: "horizontal", + row: r, + col: c, + boardRow: 2 * r, + boardCol: 1 + 2 * c, + }); + } + } + + for (let r = 0; r < rows; r += 1) { + for (let c = 1; c < cols; c += 1) { + verticalBoundaries.push({ + id: `v-${r}-${c}`, + kind: "vertical", + row: r, + col: c, + boardRow: 1 + 2 * r, + boardCol: 2 * c, + }); + } + } + + return { lines, rows, cols, horizontalBoundaries, verticalBoundaries, dots }; +} + +function galaxiesBoundaryStates( + problemAscii: string, + boardAscii: string, +): Record { + const puzzle = parseGalaxies(problemAscii); + const width = puzzle.lines[0]?.length ?? 0; + const boardLines = padLines(splitLines(boardAscii), width); + const states: Record = {}; + for (const boundary of [...puzzle.horizontalBoundaries, ...puzzle.verticalBoundaries]) { + const char = boardLines[boundary.boardRow]?.[boundary.boardCol] ?? " "; + states[boundary.id] = char === "-" || char === "|"; + } + return states; +} + +function galaxiesBoardFromStates(problemAscii: string, states: Record): string { + const puzzle = parseGalaxies(problemAscii); + const width = puzzle.lines[0]?.length ?? 0; + const grid = cloneGrid(padLines(puzzle.lines, width)); + + for (const boundary of puzzle.horizontalBoundaries) { + grid[boundary.boardRow][boundary.boardCol] = states[boundary.id] ? "-" : " "; + } + for (const boundary of puzzle.verticalBoundaries) { + grid[boundary.boardRow][boundary.boardCol] = states[boundary.id] ? "|" : " "; + } + + return joinGrid(grid); +} + +function parsePattern(boardAscii: string) { + const lines = splitLines(boardAscii); + const firstContentIndex = lines.findIndex((line) => line.includes("|")); + const topLines = lines.slice(0, firstContentIndex); + const rows: PatternRow[] = []; + for (let idx = firstContentIndex; idx < lines.length; idx += 2) { + const content = lines[idx]; + const border = lines[idx + 1]; + if (!content || !border) { + break; + } + const firstBar = content.indexOf("|"); + const prefix = content.slice(0, firstBar); + const parts = content.slice(firstBar).split("|").slice(1, -1); + rows.push({ prefix, cells: parts, border }); + } + return { topLines, rows }; +} + +function patternToAscii(template: ReturnType): string { + const lines = [...template.topLines]; + for (const row of template.rows) { + lines.push(`${row.prefix}|${row.cells.join("|")}|`); + lines.push(row.border); + } + return lines.join("\n"); +} + +function parseUndead(boardAscii: string) { + const lines = splitLines(boardAscii); + const header = lines[0] ?? ""; + const topLine = lines[2] ?? ""; + const bottomLine = lines.at(-1) ?? ""; + const rows: UndeadRow[] = lines.slice(3, -1).map((line) => { + const tokens = line.trim().split(/\s+/); + return { + left: tokens[0] ?? "", + cells: tokens.slice(1, -1), + right: tokens.at(-1) ?? "", + }; + }); + return { header, topLine, bottomLine, rows }; +} + +function undeadToAscii(template: ReturnType): string { + const lines = [template.header, "", template.topLine]; + for (const row of template.rows) { + lines.push(` ${row.left} ${row.cells.join(" ")} ${row.right}`); + } + lines.push(template.bottomLine); + return lines.join("\n"); +} + +function legendColor(letter: string) { + return FLOW_FREE_COLORS[(letter.charCodeAt(0) - 65) % FLOW_FREE_COLORS.length]; +} + +function BridgesEditor({ problemAscii, boardAscii, onChange }: Omit) { + const parsed = parseBridges(problemAscii); + const states = bridgesStatesFromBoard(problemAscii, boardAscii); + + function cycle(opportunity: BridgesOpportunity) { + const nextStates = { ...states }; + const current = nextStates[opportunity.id] ?? 0; + nextStates[opportunity.id] = ((current + 1) % 3) as 0 | 1 | 2; + onChange(bridgesBoardFromStates(problemAscii, nextStates)); + } + + return ( +
+
Click a route between islands to cycle no bridge, single bridge, and double bridge.
+
+ {parsed.lines.flatMap((line, r) => + [...line].map((char, c) => { + const opportunity = parsed.cellToOpportunity.get(`${r}:${c}`); + const boardChar = splitLines(boardAscii)[r]?.[c] ?? char; + const className = isClueChar(char) + ? "board-cell fixed island-cell" + : opportunity + ? "board-cell bridge-cell" + : "board-cell water"; + const display = + boardChar === "." ? "" : boardChar === '"' ? "‖" : boardChar === "=" ? "â•" : boardChar; + return ( + + ); + }), + )} +
+
+ ); +} + +function FlowFreeEditor({ problemAscii, boardAscii, onChange }: Omit) { + const problemLines = splitLines(problemAscii); + const boardLines = splitLines(boardAscii); + const letters = [...new Set(problemAscii.replace(/[^A-Z]/g, "").split(""))].sort(); + const [activeColor, setActiveColor] = useState(letters[0] ?? "A"); + + function updateCell(r: number, c: number) { + if (problemLines[r][c] !== ".") { + setActiveColor(problemLines[r][c]); + return; + } + const grid = cloneGrid(boardLines); + grid[r][c] = grid[r][c] === activeColor ? "." : activeColor; + onChange(joinGrid(grid)); + } + + return ( +
+
Pick a color, then fill open cells. Clicking an endpoint picks that color.
+
+ {letters.map((letter) => ( + + ))} + +
+
+ {boardLines.flatMap((line, r) => + [...line].map((char, c) => { + const fixed = problemLines[r][c] !== "."; + const letter = fixed ? problemLines[r][c] : char; + const color = letter === "." ? "transparent" : legendColor(letter); + return ( + + ); + }), + )} +
+
+ ); +} + +function LoopyEditor({ problemAscii, boardAscii, onChange }: Omit) { + const puzzle = parseLoopy(problemAscii); + const states = loopyEdgeStates(problemAscii, boardAscii); + const cell = 52; + const margin = 28; + const width = margin * 2 + puzzle.cols * cell; + const height = margin * 2 + puzzle.rows * cell; + + function cycle(edge: LoopyEdge) { + const current = states[edge.id] ?? "unknown"; + const next = + current === "unknown" ? "line" : current === "line" ? "blocked" : "unknown"; + onChange( + loopyBoardFromStates(problemAscii, { + ...states, + [edge.id]: next, + }), + ); + } + + return ( +
+
Click any segment, including the outer border, to cycle blank, line, and blocked.
+
+ + {Array.from({ length: puzzle.rows + 1 }).map((_, row) => + Array.from({ length: puzzle.cols + 1 }).map((__, col) => ( + + )), + )} + + {Array.from({ length: puzzle.rows }).map((_, row) => + Array.from({ length: puzzle.cols }).map((__, col) => ( + + + {puzzle.clues.has(`${row}:${col}`) ? ( + + {puzzle.clues.get(`${row}:${col}`)} + + ) : null} + + )), + )} + + {puzzle.horizontalEdges.map((edge) => { + const x1 = margin + edge.col * cell; + const y = margin + edge.row * cell; + const x2 = x1 + cell; + const state = states[edge.id] ?? "unknown"; + return ( + cycle(edge)}> + + {state === "line" ? : null} + {state === "unknown" ? : null} + {state === "blocked" ? ( + + Ă— + + ) : null} + + ); + })} + + {puzzle.verticalEdges.map((edge) => { + const x = margin + edge.col * cell; + const y1 = margin + edge.row * cell; + const y2 = y1 + cell; + const state = states[edge.id] ?? "unknown"; + return ( + cycle(edge)}> + + {state === "line" ? : null} + {state === "unknown" ? : null} + {state === "blocked" ? ( + + Ă— + + ) : null} + + ); + })} + +
+
+ ); +} + +function GalaxiesEditor({ problemAscii, boardAscii, onChange }: Omit) { + const puzzle = parseGalaxies(problemAscii); + const states = galaxiesBoundaryStates(problemAscii, boardAscii); + const cell = 56; + const half = cell / 2; + const margin = 28; + const width = margin * 2 + puzzle.cols * cell; + const height = margin * 2 + puzzle.rows * cell; + + function toggle(boundary: GalaxyBoundary) { + onChange( + galaxiesBoardFromStates(problemAscii, { + ...states, + [boundary.id]: !states[boundary.id], + }), + ); + } + + return ( +
+
Click an interior wall segment to add or remove it. Dots mark each galaxy center.
+
+ + {Array.from({ length: puzzle.rows }).map((_, row) => + Array.from({ length: puzzle.cols }).map((__, col) => ( + + )), + )} + + {Array.from({ length: puzzle.rows + 1 }).map((_, row) => + Array.from({ length: puzzle.cols + 1 }).map((__, col) => ( + + )), + )} + + {Array.from({ length: puzzle.rows + 1 }).map((_, row) => + Array.from({ length: puzzle.cols }).map((__, col) => ( + + )), + )} + + {Array.from({ length: puzzle.rows }).map((_, row) => + Array.from({ length: puzzle.cols + 1 }).map((__, col) => ( + + )), + )} + + {puzzle.horizontalBoundaries.map((boundary) => { + const x1 = margin + boundary.col * cell; + const y = margin + boundary.row * cell; + const x2 = x1 + cell; + return ( + toggle(boundary)}> + + + + ); + })} + + {puzzle.verticalBoundaries.map((boundary) => { + const x = margin + boundary.col * cell; + const y1 = margin + boundary.row * cell; + const y2 = y1 + cell; + return ( + toggle(boundary)}> + + + + ); + })} + + {puzzle.dots.map((dot) => ( + + ))} + +
+
+ ); +} + +function PatternEditor({ boardAscii, onChange }: Omit) { + const template = parsePattern(boardAscii); + const columnClues = template.topLines.map((line) => line.trimEnd()).join("\n"); + + function cycle(rowIndex: number, cellIndex: number) { + const next = parsePattern(boardAscii); + const current = next.rows[rowIndex].cells[cellIndex]; + next.rows[rowIndex].cells[cellIndex] = + current === " " ? "##" : current === "##" ? ".." : " "; + onChange(patternToAscii(next)); + } + + return ( +
+
Click a square to cycle unknown, filled, and empty.
+
+ 
{columnClues}
+
+ {template.rows.map((row, rowIndex) => ( +
+
{row.prefix.trim()}
+
+ {row.cells.map((cell, cellIndex) => ( + + ))} +
+
+ ))} +
+
+
+ ); +} + +function UndeadEditor({ boardAscii, onChange }: Omit) { + const template = parseUndead(boardAscii); + const topClues = template.topLine.trim().split(/\s+/); + const bottomClues = template.bottomLine.trim().split(/\s+/); + const boardWidth = template.rows[0]?.cells.length ?? 0; + const rowTemplate = `40px repeat(${boardWidth}, 38px) 40px`; + + function cycle(rowIndex: number, cellIndex: number) { + const current = template.rows[rowIndex].cells[cellIndex]; + if (current === "/" || current === "\\") { + return; + } + const next = parseUndead(boardAscii); + next.rows[rowIndex].cells[cellIndex] = + current === "." ? "G" : current === "G" ? "V" : current === "V" ? "Z" : "."; + onChange(undeadToAscii(next)); + } + + return ( +
+
Click a cell to cycle ghost, vampire, zombie, and blank. Mirror cells are fixed.
+
{template.header}
+
+
+
+ {topClues.map((clue, index) => ( +
+ {clue} +
+ ))} +
+
+ + {template.rows.map((row, rowIndex) => ( +
+
{row.left}
+ {row.cells.map((cell, cellIndex) => { + const fixedMirror = cell === "/" || cell === "\\"; + return ( + + ); + })} +
{row.right}
+
+ ))} + +
+
+ {bottomClues.map((clue, index) => ( +
+ {clue} +
+ ))} +
+
+
+
+ ); +} + +export function PuzzleEditor(props: Props) { + if (props.puzzleType === "bridges") { + return ; + } + if (props.puzzleType === "flow_free") { + return ; + } + if (props.puzzleType === "galaxies") { + return ; + } + if (props.puzzleType === "loopy") { + return ; + } + if (props.puzzleType === "pattern") { + return ; + } + if (props.puzzleType === "undead") { + return ; + } + return null; +} diff --git a/frontend/src/index.css b/frontend/src/index.css new file mode 100644 index 0000000000000000000000000000000000000000..1e348533a096ae5ef8c6144b042adb414a159482 --- /dev/null +++ b/frontend/src/index.css @@ -0,0 +1,652 @@ +:root { + color: #13231d; + background: + radial-gradient(circle at top left, rgba(235, 242, 168, 0.45), transparent 34%), + radial-gradient(circle at bottom right, rgba(117, 205, 161, 0.28), transparent 28%), + linear-gradient(180deg, #f7f7f0 0%, #ecf2ea 100%); + font-family: + "IBM Plex Sans", + "Avenir Next", + "Segoe UI", + sans-serif; + line-height: 1.4; + font-weight: 400; + font-synthesis: none; + text-rendering: optimizeLegibility; + -webkit-font-smoothing: antialiased; + -moz-osx-font-smoothing: grayscale; +} + +* { + box-sizing: border-box; +} + +body { + margin: 0; + min-width: 320px; + min-height: 100vh; +} + +button, +input, +select, +textarea { + font: inherit; +} + +button { + cursor: pointer; +} + +a { + color: inherit; +} + +.shell { + min-height: 100vh; + padding: 24px; +} + +.panel { + border: 1px solid rgba(18, 49, 41, 0.14); + border-radius: 24px; + background: rgba(255, 255, 255, 0.82); + box-shadow: + 0 20px 50px rgba(31, 51, 42, 0.08), + inset 0 1px 0 rgba(255, 255, 255, 0.7); + backdrop-filter: blur(18px); +} + +.home-layout { + display: grid; + gap: 24px; + max-width: 1100px; + margin: 0 auto; +} + +.hero { + padding: 40px; + display: grid; + gap: 16px; +} + +.eyebrow { + font-size: 0.78rem; + letter-spacing: 0.14em; + text-transform: uppercase; + color: #42685a; +} + +.hero h1 { + margin: 0; + font-family: + "Iowan Old Style", + "Palatino Linotype", + serif; + font-size: clamp(2.4rem, 6vw, 4.8rem); + line-height: 0.95; + max-width: 9ch; +} + +.hero p { + margin: 0; + max-width: 65ch; + color: #365145; + font-size: 1.02rem; +} + +.hero-grid { + display: grid; + gap: 24px; +} + +.card { + padding: 28px; +} + +.form-grid { + display: grid; + gap: 18px; +} + +.field { + display: grid; + gap: 8px; +} + +.field label { + font-size: 0.92rem; + font-weight: 600; + color: #29463b; +} + +.field input, +.field select, +.ascii-preview { + width: 100%; + border: 1px solid rgba(28, 55, 45, 0.16); + border-radius: 16px; + background: rgba(255, 255, 255, 0.94); + padding: 14px 16px; + color: #13231d; +} + +.primary-button, +.secondary-button, +.ghost-button { + border: none; + border-radius: 999px; + padding: 14px 22px; + font-weight: 700; + transition: + transform 140ms ease, + box-shadow 140ms ease, + opacity 140ms ease; +} + +.primary-button { + color: #fcfff8; + background: linear-gradient(135deg, #154f3a, #2f7f63); + box-shadow: 0 12px 28px rgba(28, 77, 59, 0.25); +} + +.secondary-button { + color: #12362c; + background: #dcefe5; +} + +.ghost-button { + color: #285144; + background: transparent; + border: 1px solid rgba(40, 81, 68, 0.18); +} + +.primary-button:hover, +.secondary-button:hover, +.ghost-button:hover { + transform: translateY(-1px); +} + +.button-row { + display: flex; + gap: 12px; + flex-wrap: wrap; +} + +.hint-grid { + display: grid; + grid-template-columns: repeat(auto-fit, minmax(180px, 1fr)); + gap: 14px; +} + +.hint-box { + padding: 18px; + border-radius: 18px; + background: rgba(18, 54, 44, 0.05); +} + +.hint-box strong { + display: block; + margin-bottom: 6px; +} + +.play-layout { + max-width: 1400px; + margin: 0 auto; + display: grid; + gap: 18px; +} + +.topbar { + padding: 20px 24px; + display: flex; + gap: 16px; + justify-content: space-between; + align-items: center; + flex-wrap: wrap; +} + +.topbar h1 { + margin: 0; + font-size: 1.4rem; +} + +.meta-line { + display: flex; + gap: 10px; + flex-wrap: wrap; + color: #46695d; + font-size: 0.92rem; +} + +.meta-pill { + padding: 8px 12px; + border-radius: 999px; + background: rgba(19, 35, 29, 0.06); +} + +.play-grid { + display: grid; + grid-template-columns: minmax(0, 1fr) 320px; + gap: 18px; +} + +.puzzle-panel { + padding: 24px; + overflow: auto; +} + +.sidebar { + padding: 20px; + display: grid; + gap: 18px; + align-content: start; +} + +.image-frame { + border-radius: 18px; + overflow: hidden; + border: 1px solid rgba(18, 35, 29, 0.08); + background: #f4f7f1; +} + +.image-frame img { + display: block; + width: 100%; + height: auto; +} + +.timer { + font-size: clamp(2rem, 5vw, 3.2rem); + font-weight: 800; + letter-spacing: -0.04em; +} + +.status-box { + padding: 14px 16px; + border-radius: 18px; + background: rgba(18, 54, 44, 0.06); + color: #23463a; +} + +.status-box.error { + background: rgba(170, 44, 44, 0.1); + color: #7f1e1e; +} + +.ascii-preview { + min-height: 180px; + font-family: + "SFMono-Regular", + "Menlo", + "Consolas", + monospace; + font-size: 0.8rem; + white-space: pre; + overflow: auto; +} + +.compact-preview { + min-height: 0; +} + +.editor-stack { + display: grid; + gap: 16px; +} + +.puzzle-note { + padding: 12px 14px; + border-radius: 16px; + background: rgba(18, 54, 44, 0.06); + color: #2b5446; + font-size: 0.95rem; +} + +.board-grid { + display: inline-grid; + gap: 2px; + padding: 14px; + border-radius: 18px; + background: rgba(17, 35, 29, 0.06); +} + +.board-cell, +.board-square, +.board-char { + display: flex; + align-items: center; + justify-content: center; + user-select: none; +} + +.board-cell { + width: 38px; + height: 38px; + border-radius: 12px; + border: none; + background: rgba(255, 255, 255, 0.92); + color: #143228; + font-weight: 700; +} + +.board-cell.water { + background: rgba(255, 255, 255, 0.58); + color: #4c7567; +} + +.board-cell.fixed { + background: linear-gradient(180deg, #fff3ce, #f2df9b); +} + +.board-cell.island-cell { + border-radius: 50%; + box-shadow: inset 0 -2px 0 rgba(20, 40, 31, 0.12); +} + +.board-cell.bridge-cell { + font-size: 1.1rem; +} + +.board-cell.mirror { + background: linear-gradient(180deg, #dbe9ff, #b8d1ff); +} + +.board-cell.endpoint-cell { + box-shadow: + inset 0 -2px 0 rgba(20, 40, 31, 0.12), + 0 0 0 3px rgba(255, 255, 255, 0.4); +} + +.board-square { + width: 44px; + height: 44px; + border-radius: 14px; + border: 1px solid rgba(20, 50, 40, 0.08); + background: rgba(255, 255, 255, 0.92); + font-weight: 700; +} + +.board-square.fill { + background: #17352b; + color: #f7fff6; +} + +.board-square.empty { + background: #eef2ea; + color: #406257; +} + +.board-square.unknown { + background: rgba(255, 255, 255, 0.92); + color: #a9b7b0; +} + +.char-board { + display: inline-grid; + gap: 1px; + padding: 14px; + border-radius: 18px; + background: rgba(17, 35, 29, 0.08); + font-family: + "SFMono-Regular", + "Menlo", + "Consolas", + monospace; +} + +.board-char { + width: 24px; + height: 24px; + border: none; + border-radius: 6px; + background: transparent; + color: #17362c; +} + +.board-char.clickable { + background: rgba(255, 255, 255, 0.85); +} + +.pattern-layout { + display: grid; + gap: 16px; +} + +.pattern-board { + padding: 10px; +} + +.pattern-grid { + display: grid; + gap: 8px; +} + +.pattern-row { + display: grid; + grid-template-columns: 92px auto; + gap: 12px; + align-items: center; +} + +.pattern-clue { + font-family: + "SFMono-Regular", + "Menlo", + "Consolas", + monospace; + color: #406257; + text-align: right; +} + +.palette { + display: flex; + gap: 8px; + flex-wrap: wrap; +} + +.palette button { + width: 38px; + height: 38px; + border-radius: 999px; + border: 2px solid transparent; + color: #112219; + font-weight: 800; +} + +.palette button.active { + border-color: #13231d; + transform: scale(1.05); +} + +.erase-swatch { + width: auto; + padding: 0 16px; + background: #eef2ea; +} + +.svg-board-shell { + overflow: auto; + padding: 10px; + border-radius: 20px; + background: rgba(17, 35, 29, 0.05); +} + +.svg-board { + display: block; + width: min(100%, 760px); + height: auto; +} + +.svg-cell-bg, +.galaxy-cell-bg { + fill: rgba(255, 255, 255, 0.84); +} + +.galaxy-cell-bg { + stroke: rgba(35, 70, 58, 0.08); + stroke-width: 1.5; +} + +.svg-clue-text { + fill: #18392e; + font-size: 22px; + font-weight: 700; +} + +.svg-vertex { + fill: #1f4d3c; +} + +.svg-hit-target { + cursor: pointer; +} + +.svg-hit-line { + stroke: transparent; + stroke-width: 22; + stroke-linecap: round; +} + +.svg-line, +.svg-wall { + stroke-linecap: round; + transition: + stroke 120ms ease, + opacity 120ms ease, + stroke-width 120ms ease; +} + +.svg-line.active { + stroke: #1f6a4f; + stroke-width: 7; +} + +.svg-line.ghost { + stroke: rgba(39, 83, 68, 0.16); + stroke-width: 4; +} + +.svg-wall.fixed { + stroke: #28493d; + stroke-width: 5; +} + +.svg-wall.active { + stroke: #215b46; + stroke-width: 6; +} + +.svg-wall.ghost { + stroke: rgba(39, 83, 68, 0.16); + stroke-width: 4; +} + +.svg-xmark { + fill: #7c8e87; + font-size: 21px; + font-weight: 700; +} + +.galaxy-dot { + fill: #17352b; + stroke: #f7f7f0; + stroke-width: 3; +} + +.undead-legend { + display: inline-flex; + width: fit-content; + padding: 10px 14px; + border-radius: 999px; + background: rgba(18, 54, 44, 0.08); + color: #224639; + font-weight: 600; +} + +.undead-grid-wrap { + display: grid; + gap: 10px; +} + +.undead-clue-row { + display: grid; + grid-template-columns: 40px repeat(4, 38px) 40px; + gap: 8px; + align-items: center; +} + +.undead-clue-box, +.undead-clue-spacer { + display: flex; + align-items: center; + justify-content: center; + min-height: 32px; + color: #46695d; + font-family: + "SFMono-Regular", + "Menlo", + "Consolas", + monospace; +} + +.undead-clue-box.side { + font-weight: 700; +} + +.undead-cell.monster-cell { + background: rgba(255, 255, 255, 0.96); +} + +.done-layout { + max-width: 820px; + margin: 0 auto; + padding-top: 64px; +} + +.done-card { + padding: 36px; + display: grid; + gap: 16px; +} + +@media (max-width: 980px) { + .play-grid { + grid-template-columns: 1fr; + } +} + +@media (max-width: 640px) { + .shell { + padding: 14px; + } + + .hero, + .card, + .puzzle-panel, + .sidebar, + .done-card { + padding: 18px; + } + + .board-cell { + width: 32px; + height: 32px; + } + + .board-square { + width: 38px; + height: 38px; + } + + .undead-clue-row { + grid-template-columns: 32px repeat(4, 32px) 32px; + gap: 6px; + } + + .board-char { + width: 20px; + height: 20px; + font-size: 0.75rem; + } +} diff --git a/frontend/src/lib/api.ts b/frontend/src/lib/api.ts new file mode 100644 index 0000000000000000000000000000000000000000..269c8e21740271cdb74b3021c08999106f9b5ddc --- /dev/null +++ b/frontend/src/lib/api.ts @@ -0,0 +1,84 @@ +export type Difficulty = "easy" | "medium" | "hard"; +export type PuzzleType = + | "bridges" + | "flow_free" + | "galaxies" + | "loopy" + | "pattern" + | "undead"; + +export type SessionResponse = { + session_id: string; + engine: string; + puzzle_type: PuzzleType; + difficulty: Difficulty; + puzzle_id: string; + args: string; + status: string; + started_at: string | null; + payload: { + problem_ascii: string; + current_board_ascii: string; + image_base64: string | null; + }; +}; + +export type SubmitResponse = { + solved: boolean; + elapsed_ms: number | null; + status: string; + verification: Record; +}; + +async function handle(response: Response): Promise { + if (!response.ok) { + let message = response.statusText; + try { + const payload = (await response.json()) as { detail?: string }; + message = payload.detail ?? message; + } catch { + // Fall back to the HTTP status text. + } + throw new Error(message); + } + return (await response.json()) as T; +} + +export async function createSession(input: { + player_name: string; + puzzle_type: PuzzleType; + difficulty: Difficulty; +}): Promise { + return handle( + await fetch("/api/sessions", { + method: "POST", + headers: { "Content-Type": "application/json" }, + body: JSON.stringify(input), + }), + ); +} + +export async function fetchSession(sessionId: string): Promise { + return handle(await fetch(`/api/sessions/${sessionId}`)); +} + +export async function readySession( + sessionId: string, +): Promise<{ status: string; started_at: string | null }> { + return handle<{ status: string; started_at: string | null }>( + await fetch(`/api/sessions/${sessionId}/ready`, { method: "POST" }), + ); +} + +export async function submitSession( + sessionId: string, + boardAscii: string, +): Promise { + return handle( + await fetch(`/api/sessions/${sessionId}/submit`, { + method: "POST", + headers: { "Content-Type": "application/json" }, + body: JSON.stringify({ board_ascii: boardAscii }), + }), + ); +} diff --git a/frontend/src/main.tsx b/frontend/src/main.tsx new file mode 100644 index 0000000000000000000000000000000000000000..0c5505fbb91f547de8d6a1bd18ba7f1c3cd6d111 --- /dev/null +++ b/frontend/src/main.tsx @@ -0,0 +1,11 @@ +import { StrictMode } from "react"; +import { createRoot } from "react-dom/client"; + +import App from "./App"; +import "./index.css"; + +createRoot(document.getElementById("root")!).render( + + + , +); diff --git a/frontend/src/routes/DonePage.tsx b/frontend/src/routes/DonePage.tsx new file mode 100644 index 0000000000000000000000000000000000000000..570b466082342a823440fd2744d02e752d226e2a --- /dev/null +++ b/frontend/src/routes/DonePage.tsx @@ -0,0 +1,64 @@ +import { useNavigate, useParams, useLocation } from "react-router-dom"; + +import type { SessionResponse, SubmitResponse } from "../lib/api"; + +type DoneState = { + result?: SubmitResponse; + session?: SessionResponse; + playerName?: string; +}; + +function formatElapsed(ms: number | null) { + if (ms === null) { + return "--:--.--"; + } + const totalSeconds = Math.floor(ms / 1000); + const minutes = Math.floor(totalSeconds / 60) + .toString() + .padStart(2, "0"); + const seconds = (totalSeconds % 60).toString().padStart(2, "0"); + const centiseconds = Math.floor((ms % 1000) / 10) + .toString() + .padStart(2, "0"); + return `${minutes}:${seconds}.${centiseconds}`; +} + +export function DonePage() { + const { sessionId = "" } = useParams(); + const location = useLocation(); + const navigate = useNavigate(); + const state = (location.state as DoneState | null) ?? null; + + function playAgain() { + navigate("/", { + state: { + playerName: state?.playerName ?? "", + puzzleType: state?.session?.puzzle_type, + difficulty: state?.session?.difficulty, + }, + }); + } + + return ( +
+
+
+
Solved
+

Puzzle complete.

+

+ Session {sessionId} finished in{" "} + {formatElapsed(state?.result?.elapsed_ms ?? null)}. +

+
+ + +
+
+
+
+ ); +} diff --git a/frontend/src/routes/HomePage.tsx b/frontend/src/routes/HomePage.tsx new file mode 100644 index 0000000000000000000000000000000000000000..16978e50f147b7fc8632e0d4e816fa42dae8529b --- /dev/null +++ b/frontend/src/routes/HomePage.tsx @@ -0,0 +1,124 @@ +import { useState } from "react"; +import type { FormEvent } from "react"; +import { useLocation, useNavigate } from "react-router-dom"; + +import { createSession, type Difficulty, type PuzzleType } from "../lib/api"; + +const PUZZLE_OPTIONS: Array<{ value: PuzzleType; label: string; blurb: string }> = [ + { value: "bridges", label: "Bridges", blurb: "Connect islands with single or double links." }, + { value: "flow_free", label: "Flow Free", blurb: "Fill the board with non-crossing color paths." }, + { value: "galaxies", label: "Galaxies", blurb: "Draw region boundaries around rotationally symmetric clusters." }, + { value: "loopy", label: "Loopy", blurb: "Toggle loop edges around numeric clues." }, + { value: "pattern", label: "Pattern", blurb: "Fill cells to satisfy run clues while keeping one connected shape." }, + { value: "undead", label: "Undead", blurb: "Place monsters around mirrors and sightline clues." }, +]; + +export function HomePage() { + const navigate = useNavigate(); + const location = useLocation(); + const defaults = (location.state as + | { playerName?: string; puzzleType?: PuzzleType; difficulty?: Difficulty } + | null) ?? { playerName: "", puzzleType: "bridges", difficulty: "easy" }; + const [playerName, setPlayerName] = useState(defaults.playerName ?? ""); + const [puzzleType, setPuzzleType] = useState(defaults.puzzleType ?? "bridges"); + const [difficulty, setDifficulty] = useState(defaults.difficulty ?? "easy"); + const [error, setError] = useState(null); + const [submitting, setSubmitting] = useState(false); + + async function onSubmit(event: FormEvent) { + event.preventDefault(); + setSubmitting(true); + setError(null); + try { + const session = await createSession({ + player_name: playerName, + puzzle_type: puzzleType, + difficulty, + }); + navigate(`/play/${session.session_id}`, { state: { session, playerName } }); + } catch (caught) { + setError(caught instanceof Error ? caught.message : "Could not create a session."); + } finally { + setSubmitting(false); + } + } + + return ( +
+
+
+
TopoBench Space
+

Play the benchmark, not just the report.

+

+ This Space pulls real TopoBench puzzles from Hugging Face, times each solve + on the server, and verifies your submission against the same native logic + used by the benchmark repo. +

+
+ +
+
+
+
+ + setPlayerName(event.target.value)} + placeholder="Ada Lovelace" + maxLength={80} + required + /> +
+ +
+ + +
+ +
+ + +
+ + {error ?
{error}
: null} + +
+ +
+
+
+ +
+ {PUZZLE_OPTIONS.map((option) => ( +
+ {option.label} +
{option.blurb}
+
+ ))} +
+
+
+
+ ); +} diff --git a/frontend/src/routes/PlayPage.tsx b/frontend/src/routes/PlayPage.tsx new file mode 100644 index 0000000000000000000000000000000000000000..bf9d844828ff76ba74d309029cb87f84ce919229 --- /dev/null +++ b/frontend/src/routes/PlayPage.tsx @@ -0,0 +1,210 @@ +import { useEffect, useState } from "react"; +import { useLocation, useNavigate, useParams } from "react-router-dom"; + +import { PuzzleEditor } from "../components/PuzzleEditor"; +import { fetchSession, readySession, submitSession, type SessionResponse } from "../lib/api"; + +const PUZZLE_HELP: Record = { + bridges: "Connect every numbered island into a single network. Each route cycles empty, single bridge, then double bridge.", + flow_free: "Choose a color from the palette, then paint a continuous path between matching endpoints without changing the endpoints themselves.", + galaxies: "Partition the board with interior walls so each region has exactly one dot-symmetry center.", + loopy: "Build one single loop. Every segment cycles blank, line, then blocked, including the outer perimeter.", + pattern: "Each square cycles unknown, filled, then empty so the row and column clues match the finished pattern.", + undead: "Place ghosts, vampires, and zombies so the side clues and the global monster counts all line up.", +}; + +function formatElapsed(ms: number) { + const totalSeconds = Math.floor(ms / 1000); + const minutes = Math.floor(totalSeconds / 60) + .toString() + .padStart(2, "0"); + const seconds = (totalSeconds % 60).toString().padStart(2, "0"); + const centiseconds = Math.floor((ms % 1000) / 10) + .toString() + .padStart(2, "0"); + return `${minutes}:${seconds}.${centiseconds}`; +} + +type LocationState = { + session?: SessionResponse; + playerName?: string; +}; + +export function PlayPage() { + const { sessionId = "" } = useParams(); + const location = useLocation(); + const navigate = useNavigate(); + const state = (location.state as LocationState | null) ?? null; + const [session, setSession] = useState(state?.session ?? null); + const [boardAscii, setBoardAscii] = useState(state?.session?.payload.current_board_ascii ?? ""); + const [startedAt, setStartedAt] = useState(state?.session?.started_at ?? null); + const [elapsedMs, setElapsedMs] = useState(0); + const [error, setError] = useState(null); + const [statusMessage, setStatusMessage] = useState(null); + const [submitting, setSubmitting] = useState(false); + + useEffect(() => { + let cancelled = false; + async function load() { + try { + const payload = await fetchSession(sessionId); + if (cancelled) { + return; + } + setSession(payload); + setBoardAscii(payload.payload.current_board_ascii); + setStatusMessage(null); + if (!payload.started_at) { + const ready = await readySession(sessionId); + if (!cancelled) { + setStartedAt(ready.started_at); + } + } else { + setStartedAt(payload.started_at); + } + } catch (caught) { + if (!cancelled) { + setError(caught instanceof Error ? caught.message : "Could not load the session."); + } + } + } + void load(); + return () => { + cancelled = true; + }; + }, [sessionId]); + + useEffect(() => { + if (!startedAt) { + return; + } + const tick = window.setInterval(() => { + const delta = Date.now() - Date.parse(startedAt); + setElapsedMs(Math.max(0, delta)); + }, 80); + return () => window.clearInterval(tick); + }, [startedAt]); + + async function onSubmit() { + if (!session) { + return; + } + setSubmitting(true); + setError(null); + setStatusMessage(null); + try { + const result = await submitSession(session.session_id, boardAscii); + if (result.solved) { + navigate(`/done/${session.session_id}`, { + state: { + result, + session, + playerName: state?.playerName ?? "", + boardAscii, + }, + }); + } else { + if (!result.verification.board_valid) { + setError("That board is not structurally valid yet. Double-check fixed clues, endpoints, and wall or bridge placement."); + } else { + setStatusMessage("Close, but not solved yet. Keep going and submit again when you are ready."); + } + } + } catch (caught) { + setError(caught instanceof Error ? caught.message : "Could not submit the puzzle."); + } finally { + setSubmitting(false); + } + } + + function newRandom() { + navigate("/", { + state: { + playerName: state?.playerName ?? "", + puzzleType: session?.puzzle_type, + difficulty: session?.difficulty, + }, + }); + } + + function resetBoard() { + if (!session) { + return; + } + setBoardAscii(session.payload.problem_ascii); + setError(null); + setStatusMessage("Board reset to the original puzzle."); + } + + if (!session) { + return ( +
+
{error ?? "Loading puzzle..."}
+
+ ); + } + + return ( +
+
+
+
+

{session.puzzle_type.replace("_", " ")}

+
+ {session.difficulty} + {session.puzzle_id} +
+
+
{formatElapsed(elapsedMs)}
+
+ +
+
+ +
+ + +
+
+
+ ); +} diff --git a/frontend/tsconfig.app.json b/frontend/tsconfig.app.json new file mode 100644 index 0000000000000000000000000000000000000000..7f42e5f7cd2e79c7b5a25b753e56b1bcf94e1381 --- /dev/null +++ b/frontend/tsconfig.app.json @@ -0,0 +1,25 @@ +{ + "compilerOptions": { + "tsBuildInfoFile": "./node_modules/.tmp/tsconfig.app.tsbuildinfo", + "target": "es2023", + "lib": ["ES2023", "DOM"], + "module": "esnext", + "types": ["vite/client"], + "skipLibCheck": true, + + /* Bundler mode */ + "moduleResolution": "bundler", + "allowImportingTsExtensions": true, + "verbatimModuleSyntax": true, + "moduleDetection": "force", + "noEmit": true, + "jsx": "react-jsx", + + /* Linting */ + "noUnusedLocals": true, + "noUnusedParameters": true, + "erasableSyntaxOnly": true, + "noFallthroughCasesInSwitch": true + }, + "include": ["src"] +} diff --git a/frontend/tsconfig.json b/frontend/tsconfig.json new file mode 100644 index 0000000000000000000000000000000000000000..1ffef600d959ec9e396d5a260bd3f5b927b2cef8 --- /dev/null +++ b/frontend/tsconfig.json @@ -0,0 +1,7 @@ +{ + "files": [], + "references": [ + { "path": "./tsconfig.app.json" }, + { "path": "./tsconfig.node.json" } + ] +} diff --git a/frontend/tsconfig.node.json b/frontend/tsconfig.node.json new file mode 100644 index 0000000000000000000000000000000000000000..d3c52ea64c6cd6bad118474410f5322f48e257a6 --- /dev/null +++ b/frontend/tsconfig.node.json @@ -0,0 +1,24 @@ +{ + "compilerOptions": { + "tsBuildInfoFile": "./node_modules/.tmp/tsconfig.node.tsbuildinfo", + "target": "es2023", + "lib": ["ES2023"], + "module": "esnext", + "types": ["node"], + "skipLibCheck": true, + + /* Bundler mode */ + "moduleResolution": "bundler", + "allowImportingTsExtensions": true, + "verbatimModuleSyntax": true, + "moduleDetection": "force", + "noEmit": true, + + /* Linting */ + "noUnusedLocals": true, + "noUnusedParameters": true, + "erasableSyntaxOnly": true, + "noFallthroughCasesInSwitch": true + }, + "include": ["vite.config.ts"] +} diff --git a/frontend/vite.config.ts b/frontend/vite.config.ts new file mode 100644 index 0000000000000000000000000000000000000000..8b0f57b91aeb45c54467e29f983a0893dc83c4d9 --- /dev/null +++ b/frontend/vite.config.ts @@ -0,0 +1,7 @@ +import { defineConfig } from 'vite' +import react from '@vitejs/plugin-react' + +// https://vite.dev/config/ +export default defineConfig({ + plugins: [react()], +}) diff --git a/mappings/topobench_mappings/bridges.json b/mappings/topobench_mappings/bridges.json new file mode 100644 index 0000000000000000000000000000000000000000..27da4a2062de3be7d52dad6f88801b83f3a95cc0 --- /dev/null +++ b/mappings/topobench_mappings/bridges.json @@ -0,0 +1,22 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "bridges", + "char_map": { + " ": "0", + "\n": "1", + "\"": "2", + "-": "3", + ".": "4", + "1": "5", + "2": "6", + "3": "7", + "4": "8", + "5": "9", + "6": "A", + "7": "B", + "8": "C", + "=": "D", + "|": "E" + }, + "num_characters": 15 +} \ No newline at end of file diff --git a/mappings/topobench_mappings/flow_free.json b/mappings/topobench_mappings/flow_free.json new file mode 100644 index 0000000000000000000000000000000000000000..7dab2de7829cd503ba426431d690745d67cffff8 --- /dev/null +++ b/mappings/topobench_mappings/flow_free.json @@ -0,0 +1,20 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "flow_free", + "char_map": { + " ": "0", + "\n": "1", + ".": "2", + "A": "3", + "B": "4", + "C": "5", + "D": "6", + "E": "7", + "F": "8", + "G": "9", + "H": "A", + "I": "B", + "J": "C" + }, + "num_characters": 13 +} \ No newline at end of file diff --git a/mappings/topobench_mappings/galaxies.json b/mappings/topobench_mappings/galaxies.json new file mode 100644 index 0000000000000000000000000000000000000000..11f1ebf997b7248811f302103ebcd69c4e64a70e --- /dev/null +++ b/mappings/topobench_mappings/galaxies.json @@ -0,0 +1,13 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "galaxies", + "char_map": { + " ": "0", + "\n": "1", + "+": "2", + "-": "3", + "o": "4", + "|": "5" + }, + "num_characters": 6 +} \ No newline at end of file diff --git a/mappings/topobench_mappings/loopy.json b/mappings/topobench_mappings/loopy.json new file mode 100644 index 0000000000000000000000000000000000000000..02cbc1fcaf59a1ae1937aff5139f55177e911804 --- /dev/null +++ b/mappings/topobench_mappings/loopy.json @@ -0,0 +1,16 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "loopy", + "char_map": { + " ": "0", + "\n": "1", + "-": "2", + "0": "3", + "1": "4", + "2": "5", + "3": "6", + "x": "7", + "|": "8" + }, + "num_characters": 9 +} \ No newline at end of file diff --git a/mappings/topobench_mappings/pattern.json b/mappings/topobench_mappings/pattern.json new file mode 100644 index 0000000000000000000000000000000000000000..7f5dbc670525fe5052bb33136b42c1b9d5143892 --- /dev/null +++ b/mappings/topobench_mappings/pattern.json @@ -0,0 +1,23 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "pattern", + "char_map": { + " ": "0", + ".": "A", + "#": "B", + "+": "X", + "-": "Y", + "|": "Z", + "1": "1", + "2": "2", + "3": "3", + "4": "4", + "5": "5", + "6": "6", + "7": "7", + "8": "8", + "9": "9", + "\n": "N" + }, + "num_characters": 16 +} \ No newline at end of file diff --git a/mappings/topobench_mappings/undead.json b/mappings/topobench_mappings/undead.json new file mode 100644 index 0000000000000000000000000000000000000000..9420795d9cc86a3bf26fcaad0ccf05badd43ee23 --- /dev/null +++ b/mappings/topobench_mappings/undead.json @@ -0,0 +1,26 @@ +{ + "dataset": "topobench/mmcot_test_set", + "puzzle_type": "undead", + "char_map": { + " ": "0", + "\n": "1", + ".": "2", + "/": "3", + "0": "4", + "1": "5", + "2": "6", + "3": "7", + "4": "8", + "5": "9", + "6": "A", + "7": "B", + "8": "C", + "9": "D", + ":": "E", + "G": "F", + "V": "G", + "Z": "H", + "\\": "I" + }, + "num_characters": 19 +} \ No newline at end of file diff --git a/pyproject.toml b/pyproject.toml new file mode 100644 index 0000000000000000000000000000000000000000..5980167c1ea76a828b92df6a308a5ff73bb1ec51 --- /dev/null +++ b/pyproject.toml @@ -0,0 +1,32 @@ +[project] +name = "topobench" +version = "0.1.0" +description = "Standalone benchmark runner, verifier, and Hugging Face Space app for topology puzzle families." +readme = "README.md" +requires-python = ">=3.12" +dependencies = [ + "anthropic>=0.40.0", + "datasets>=3.1.0", + "fastapi>=0.116.0", + "google-genai>=1.30.0", + "httpx>=0.28.0", + "json-repair>=0.39.0", + "numpy>=2.0.0", + "openai>=1.55.0", + "pandas>=2.2.0", + "pydantic>=2.11.0", + "pygame>=2.1.0", + "python-dotenv>=1.0.1", + "tqdm>=4.67.0", + "uvicorn>=0.35.0", +] + +[build-system] +requires = ["setuptools>=68", "wheel"] +build-backend = "setuptools.build_meta" + +[tool.setuptools] +include-package-data = true + +[tool.setuptools.packages.find] +include = ["space_app*"] diff --git a/scripts/install.sh b/scripts/install.sh new file mode 100644 index 0000000000000000000000000000000000000000..23eeebfbfb6489866db98ed7c7b5c27cc6eefe28 --- /dev/null +++ b/scripts/install.sh @@ -0,0 +1,67 @@ +#!/usr/bin/env bash +set -euo pipefail + +ROOT_DIR="$(cd "$(dirname "${BASH_SOURCE[0]}")/.." && pwd)" +PYTHON_BIN="${PYTHON_BIN:-$(command -v python3 || command -v python)}" + +if [[ -z "${PYTHON_BIN}" ]]; then + echo "Python interpreter not found." >&2 + exit 1 +fi + +DEBIAN_MIRROR="${DEBIAN_MIRROR:-https://ftp.us.debian.org/debian}" +DEBIAN_SECURITY_MIRROR="${DEBIAN_SECURITY_MIRROR:-https://security.debian.org/debian-security}" +CPU_COUNT="$(getconf _NPROCESSORS_ONLN 2>/dev/null || sysctl -n hw.logicalcpu 2>/dev/null || echo 4)" + +if command -v apt-get >/dev/null 2>&1; then + sed -i "s|http://deb.debian.org|${DEBIAN_MIRROR}|g" /etc/apt/sources.list || true + sed -i "s|https://deb.debian.org|${DEBIAN_MIRROR}|g" /etc/apt/sources.list || true + sed -i "s|http://security.debian.org|${DEBIAN_SECURITY_MIRROR}|g" /etc/apt/sources.list || true + sed -i "s|https://security.debian.org|${DEBIAN_SECURITY_MIRROR}|g" /etc/apt/sources.list || true + if ls /etc/apt/sources.list.d/*.list >/dev/null 2>&1; then + sed -i "s|http://deb.debian.org|${DEBIAN_MIRROR}|g" /etc/apt/sources.list.d/*.list + sed -i "s|https://deb.debian.org|${DEBIAN_MIRROR}|g" /etc/apt/sources.list.d/*.list + sed -i "s|http://security.debian.org|${DEBIAN_SECURITY_MIRROR}|g" /etc/apt/sources.list.d/*.list + sed -i "s|https://security.debian.org|${DEBIAN_SECURITY_MIRROR}|g" /etc/apt/sources.list.d/*.list + fi + + APT_ARGS=( + -o Acquire::Retries=5 + -o Acquire::http::Timeout=30 + -o Acquire::https::Timeout=30 + ) + + apt-get update "${APT_ARGS[@]}" + apt-get install -y --no-install-recommends "${APT_ARGS[@]}" \ + ca-certificates \ + build-essential \ + cmake \ + gcc \ + git \ + imagemagick \ + libgtk-3-dev \ + pkg-config + rm -rf /var/lib/apt/lists/* +else + echo "apt-get not found; skipping OS package installation and assuming build tools are already available." +fi + +"${PYTHON_BIN}" -m pip install --upgrade pip setuptools wheel +"${PYTHON_BIN}" -m pip install -e "${ROOT_DIR}" +"${PYTHON_BIN}" -m pip install "pygame>=2.1.0" + +pushd "${ROOT_DIR}/submodules/rlp" >/dev/null +"${PYTHON_BIN}" setup.py build_ext --inplace +popd >/dev/null + +mkdir -p "${ROOT_DIR}/submodules/rlp/rlp/lib" +pushd "${ROOT_DIR}/submodules/rlp/rlp/lib" >/dev/null +cmake ../../puzzles +make -j"${CPU_COUNT}" libbridges libgalaxies libloopy libpattern libundead +popd >/dev/null + +pushd "${ROOT_DIR}/submodules/flowfree" >/dev/null +gcc -std=c11 -O2 -Wall -Wextra -o flowfree_all_solutions flowfree_all_solutions.c +popd >/dev/null + +echo "TopoBench install complete." diff --git a/space_app/__init__.py b/space_app/__init__.py new file mode 100644 index 0000000000000000000000000000000000000000..a1779656f97455ddf8c5343b0e83166959c203eb --- /dev/null +++ b/space_app/__init__.py @@ -0,0 +1,2 @@ +"""TopoBench Hugging Face Space application package.""" + diff --git a/space_app/config.py b/space_app/config.py new file mode 100644 index 0000000000000000000000000000000000000000..0a954c90ef833b1d3fe191af24166b876b3662f9 --- /dev/null +++ b/space_app/config.py @@ -0,0 +1,45 @@ +from __future__ import annotations + +import os +from dataclasses import dataclass +from pathlib import Path + + +@dataclass(frozen=True) +class Settings: + data_dir: Path + database_path: Path + hf_cache_dir: Path + admin_api_token: str + frontend_dist_dir: Path + host: str + port: int + + @classmethod + def from_env(cls) -> "Settings": + root_dir = Path(__file__).resolve().parents[1] + data_dir = Path(os.getenv("TOPOBENCH_DATA_DIR", "/data")).resolve() + frontend_dist_dir = Path( + os.getenv("TOPOBENCH_FRONTEND_DIST", root_dir / "frontend" / "dist") + ).resolve() + database_path = Path( + os.getenv("TOPOBENCH_DATABASE_PATH", data_dir / "topobench.sqlite") + ).resolve() + hf_cache_dir = Path( + os.getenv("HF_HOME", data_dir / "hf-cache") + ).resolve() + return cls( + data_dir=data_dir, + database_path=database_path, + hf_cache_dir=hf_cache_dir, + admin_api_token=os.getenv("ADMIN_API_TOKEN", "dev-admin-token"), + frontend_dist_dir=frontend_dist_dir, + host=os.getenv("TOPOBENCH_HOST", "0.0.0.0"), + port=int(os.getenv("PORT", os.getenv("TOPOBENCH_PORT", "7860"))), + ) + + def prepare(self) -> None: + self.data_dir.mkdir(parents=True, exist_ok=True) + self.hf_cache_dir.mkdir(parents=True, exist_ok=True) + os.environ.setdefault("HF_HOME", str(self.hf_cache_dir)) + diff --git a/space_app/dataset.py b/space_app/dataset.py new file mode 100644 index 0000000000000000000000000000000000000000..cc2496eaf20016034398c1e804097dbab327678a --- /dev/null +++ b/space_app/dataset.py @@ -0,0 +1,51 @@ +from __future__ import annotations + +import random +from collections import defaultdict +from typing import Iterable + +from datasets import load_dataset + +from .models import ALLOWED_DIFFICULTIES, ALLOWED_PUZZLES, DatasetRow + + +class DatasetStore: + def __init__(self, rows: Iterable[DatasetRow], *, seed: int = 0) -> None: + self._rng = random.Random(seed) + self._index: dict[tuple[str, str], list[DatasetRow]] = defaultdict(list) + self._rows_by_filename: dict[str, DatasetRow] = {} + for row in rows: + if row.puzzlename not in ALLOWED_PUZZLES: + continue + if row.difficulty not in ALLOWED_DIFFICULTIES: + continue + self._index[(row.puzzlename, row.difficulty)].append(row) + self._rows_by_filename[row.filename] = row + + @classmethod + def load_huggingface(cls, repo_id: str = "topobench/topobench") -> "DatasetStore": + dataset = load_dataset(repo_id, split="test") + rows: list[DatasetRow] = [] + for row in dataset: + if "include" in row and not row["include"]: + continue + rows.append(DatasetRow.from_payload(row)) + return cls(rows) + + def choose_row( + self, + *, + puzzle_type: str, + difficulty: str, + solved_filenames: set[str], + ) -> DatasetRow: + candidates = list(self._index[(puzzle_type, difficulty)]) + if not candidates: + raise ValueError(f"No puzzles available for {puzzle_type}:{difficulty}") + unsolved = [row for row in candidates if row.filename not in solved_filenames] + pool = unsolved or candidates + return self._rng.choice(pool) + + def get_row(self, filename: str) -> DatasetRow: + return self._rows_by_filename[filename] + diff --git a/space_app/db.py b/space_app/db.py new file mode 100644 index 0000000000000000000000000000000000000000..cd4c1d2edeb525fd54d6a535f2d848c5f7d519de --- /dev/null +++ b/space_app/db.py @@ -0,0 +1,263 @@ +from __future__ import annotations + +import json +import sqlite3 +import uuid +from collections import defaultdict +from datetime import UTC, datetime +from pathlib import Path +from typing import Any + +from .models import SolveAggregate + + +def utcnow() -> datetime: + return datetime.now(UTC) + + +def to_iso(dt: datetime | None) -> str | None: + if dt is None: + return None + return dt.isoformat() + + +class SessionStore: + def __init__(self, database_path: Path) -> None: + self.database_path = database_path + self.database_path.parent.mkdir(parents=True, exist_ok=True) + self._init_db() + + def _connect(self) -> sqlite3.Connection: + conn = sqlite3.connect(self.database_path) + conn.row_factory = sqlite3.Row + return conn + + def _init_db(self) -> None: + with self._connect() as conn: + conn.execute( + """ + CREATE TABLE IF NOT EXISTS sessions ( + id TEXT PRIMARY KEY, + player_name_raw TEXT NOT NULL, + player_name_norm TEXT NOT NULL, + puzzle_type TEXT NOT NULL, + difficulty TEXT NOT NULL, + dataset_variant TEXT NOT NULL, + puzzle_filename TEXT NOT NULL, + args TEXT NOT NULL, + status TEXT NOT NULL, + assigned_at TEXT NOT NULL, + started_at TEXT, + submitted_at TEXT, + elapsed_ms INTEGER, + submission_count INTEGER NOT NULL DEFAULT 0, + solved INTEGER NOT NULL DEFAULT 0, + engine TEXT NOT NULL, + submitted_artifact TEXT, + verification_payload TEXT + ) + """ + ) + conn.execute( + """ + CREATE INDEX IF NOT EXISTS idx_sessions_lookup + ON sessions (player_name_norm, puzzle_type, difficulty, solved) + """ + ) + + def create_session( + self, + *, + player_name_raw: str, + player_name_norm: str, + puzzle_type: str, + difficulty: str, + dataset_variant: str, + puzzle_filename: str, + args: str, + engine: str, + ) -> dict[str, Any]: + session_id = str(uuid.uuid4()) + assigned_at = utcnow() + record = { + "id": session_id, + "player_name_raw": player_name_raw, + "player_name_norm": player_name_norm, + "puzzle_type": puzzle_type, + "difficulty": difficulty, + "dataset_variant": dataset_variant, + "puzzle_filename": puzzle_filename, + "args": args, + "status": "assigned", + "assigned_at": to_iso(assigned_at), + "started_at": None, + "submitted_at": None, + "elapsed_ms": None, + "submission_count": 0, + "solved": 0, + "engine": engine, + "submitted_artifact": None, + "verification_payload": None, + } + with self._connect() as conn: + conn.execute( + """ + INSERT INTO sessions ( + id, player_name_raw, player_name_norm, puzzle_type, difficulty, + dataset_variant, puzzle_filename, args, status, assigned_at, + started_at, submitted_at, elapsed_ms, submission_count, solved, + engine, submitted_artifact, verification_payload + ) VALUES ( + :id, :player_name_raw, :player_name_norm, :puzzle_type, :difficulty, + :dataset_variant, :puzzle_filename, :args, :status, :assigned_at, + :started_at, :submitted_at, :elapsed_ms, :submission_count, :solved, + :engine, :submitted_artifact, :verification_payload + ) + """, + record, + ) + return record + + def get_session(self, session_id: str) -> dict[str, Any] | None: + with self._connect() as conn: + row = conn.execute("SELECT * FROM sessions WHERE id = ?", (session_id,)).fetchone() + return dict(row) if row else None + + def get_solved_filenames( + self, + *, + player_name_norm: str, + puzzle_type: str, + difficulty: str, + ) -> set[str]: + with self._connect() as conn: + rows = conn.execute( + """ + SELECT puzzle_filename + FROM sessions + WHERE player_name_norm = ? + AND puzzle_type = ? + AND difficulty = ? + AND solved = 1 + """, + (player_name_norm, puzzle_type, difficulty), + ).fetchall() + return {str(row["puzzle_filename"]) for row in rows} + + def mark_ready(self, session_id: str) -> dict[str, Any]: + session = self.get_session(session_id) + if session is None: + raise KeyError(session_id) + started_at = session["started_at"] or to_iso(utcnow()) + with self._connect() as conn: + conn.execute( + "UPDATE sessions SET started_at = ?, status = 'ready' WHERE id = ?", + (started_at, session_id), + ) + updated = self.get_session(session_id) + assert updated is not None + return updated + + def record_submission( + self, + *, + session_id: str, + solved: bool, + submitted_artifact: str, + verification_payload: dict[str, Any], + ) -> dict[str, Any]: + session = self.get_session(session_id) + if session is None: + raise KeyError(session_id) + if not session["started_at"]: + raise ValueError("Session has not been marked ready.") + started_at = datetime.fromisoformat(str(session["started_at"])) + submitted_at = utcnow() + elapsed_ms = max(0, int((submitted_at - started_at).total_seconds() * 1000)) + submission_count = int(session["submission_count"]) + 1 + status = "solved" if solved else "attempted" + with self._connect() as conn: + conn.execute( + """ + UPDATE sessions + SET submitted_at = ?, elapsed_ms = ?, submission_count = ?, solved = ?, + status = ?, submitted_artifact = ?, verification_payload = ? + WHERE id = ? + """, + ( + to_iso(submitted_at), + elapsed_ms, + submission_count, + int(solved), + status, + submitted_artifact, + json.dumps(verification_payload), + session_id, + ), + ) + updated = self.get_session(session_id) + assert updated is not None + return updated + + def list_solves(self, filters: dict[str, str | None]) -> list[dict[str, Any]]: + clauses = ["submitted_at IS NOT NULL"] + params: list[str] = [] + mappings = { + "player_name_norm": "player_name_norm = ?", + "puzzle_type": "puzzle_type = ?", + "difficulty": "difficulty = ?", + "status": "status = ?", + } + for key, clause in mappings.items(): + value = filters.get(key) + if value: + clauses.append(clause) + params.append(value) + if filters.get("date_from"): + clauses.append("submitted_at >= ?") + params.append(str(filters["date_from"])) + if filters.get("date_to"): + clauses.append("submitted_at <= ?") + params.append(str(filters["date_to"])) + query = f"SELECT * FROM sessions WHERE {' AND '.join(clauses)} ORDER BY submitted_at DESC" + with self._connect() as conn: + rows = conn.execute(query, params).fetchall() + results: list[dict[str, Any]] = [] + for row in rows: + item = dict(row) + if item.get("verification_payload"): + item["verification_payload"] = json.loads(str(item["verification_payload"])) + results.append(item) + return results + + def aggregate_solves(self, filters: dict[str, str | None]) -> list[SolveAggregate]: + solved_filters = dict(filters) + if not solved_filters.get("status"): + solved_filters["status"] = "solved" + rows = self.list_solves(solved_filters) + grouped: dict[tuple[str, str, str], list[int]] = defaultdict(list) + for row in rows: + elapsed_ms = row.get("elapsed_ms") + if elapsed_ms is None: + continue + key = ( + str(row["player_name_norm"]), + str(row["puzzle_type"]), + str(row["difficulty"]), + ) + grouped[key].append(int(elapsed_ms)) + aggregates: list[SolveAggregate] = [] + for (player_name_norm, puzzle_type, difficulty), elapsed_values in grouped.items(): + aggregates.append( + SolveAggregate.from_rows( + player_name_norm=player_name_norm, + puzzle_type=puzzle_type, + difficulty=difficulty, + elapsed_values=elapsed_values, + ) + ) + aggregates.sort( + key=lambda item: (item.player_name_norm, item.puzzle_type, item.difficulty) + ) + return aggregates + diff --git a/space_app/main.py b/space_app/main.py new file mode 100644 index 0000000000000000000000000000000000000000..3958963a386206c4b543b391ab7f32ab9f0ee7f2 --- /dev/null +++ b/space_app/main.py @@ -0,0 +1,244 @@ +from __future__ import annotations + +import os +from pathlib import Path +from typing import Any + +from fastapi import Depends, FastAPI, Header, HTTPException, Query +from fastapi.responses import FileResponse +from fastapi.staticfiles import StaticFiles + +from .config import Settings +from .dataset import DatasetStore +from .db import SessionStore +from .models import engine_for_puzzle, normalize_player_name +from .schemas import ( + CreateSessionRequest, + SessionPayload, + SessionResponse, + SubmitResponse, + SubmitSessionRequest, +) +from .verification import VerificationService + + +def _session_to_response( + session: dict[str, Any], + *, + problem_ascii: str, + image_base64: str | None, +) -> SessionResponse: + return SessionResponse( + session_id=str(session["id"]), + engine=str(session["engine"]), + puzzle_type=str(session["puzzle_type"]), + difficulty=str(session["difficulty"]), + puzzle_id=str(session["puzzle_filename"]), + args=str(session["args"]), + status=str(session["status"]), + started_at=session["started_at"], + payload=SessionPayload( + problem_ascii=problem_ascii, + current_board_ascii=str(session["submitted_artifact"] or problem_ascii), + image_base64=image_base64, + ), + ) + + +def create_app( + *, + settings: Settings | None = None, + dataset_store: DatasetStore | None = None, + session_store: SessionStore | None = None, + verifier: VerificationService | None = None, +) -> FastAPI: + resolved_settings = settings or Settings.from_env() + resolved_settings.prepare() + app = FastAPI(title="TopoBench Space") + app.state.settings = resolved_settings + app.state.dataset_store = dataset_store or DatasetStore.load_huggingface() + app.state.session_store = session_store or SessionStore(resolved_settings.database_path) + app.state.verifier = verifier or VerificationService() + + def get_settings() -> Settings: + return app.state.settings + + def get_dataset_store() -> DatasetStore: + return app.state.dataset_store + + def get_session_store() -> SessionStore: + return app.state.session_store + + def get_verifier() -> VerificationService: + return app.state.verifier + + def require_admin( + authorization: str | None = Header(default=None), + current_settings: Settings = Depends(get_settings), + ) -> None: + token = f"Bearer {current_settings.admin_api_token}" + if authorization != token: + raise HTTPException(status_code=401, detail="Unauthorized") + + @app.get("/api/health") + def health() -> dict[str, str]: + return {"status": "ok"} + + @app.post("/api/sessions", response_model=SessionResponse) + def create_session( + request: CreateSessionRequest, + current_dataset_store: DatasetStore = Depends(get_dataset_store), + current_session_store: SessionStore = Depends(get_session_store), + ) -> SessionResponse: + player_name_raw = request.player_name.strip() + player_name_norm = normalize_player_name(player_name_raw) + if not player_name_norm: + raise HTTPException(status_code=400, detail="Player name is required.") + solved = current_session_store.get_solved_filenames( + player_name_norm=player_name_norm, + puzzle_type=request.puzzle_type, + difficulty=request.difficulty, + ) + row = current_dataset_store.choose_row( + puzzle_type=request.puzzle_type, + difficulty=request.difficulty, + solved_filenames=solved, + ) + session = current_session_store.create_session( + player_name_raw=player_name_raw, + player_name_norm=player_name_norm, + puzzle_type=request.puzzle_type, + difficulty=request.difficulty, + dataset_variant="plain", + puzzle_filename=row.filename, + args=row.args, + engine=engine_for_puzzle(request.puzzle_type), + ) + return _session_to_response( + session, + problem_ascii=row.problem, + image_base64=row.image_base64, + ) + + @app.get("/api/sessions/{session_id}", response_model=SessionResponse) + def get_session( + session_id: str, + current_dataset_store: DatasetStore = Depends(get_dataset_store), + current_session_store: SessionStore = Depends(get_session_store), + ) -> SessionResponse: + session = current_session_store.get_session(session_id) + if session is None: + raise HTTPException(status_code=404, detail="Session not found.") + row = current_dataset_store.get_row(str(session["puzzle_filename"])) + return _session_to_response( + session, + problem_ascii=row.problem, + image_base64=row.image_base64, + ) + + @app.post("/api/sessions/{session_id}/ready") + def ready_session( + session_id: str, + current_session_store: SessionStore = Depends(get_session_store), + ) -> dict[str, str | None]: + try: + session = current_session_store.mark_ready(session_id) + except KeyError: + raise HTTPException(status_code=404, detail="Session not found.") from None + return {"status": str(session["status"]), "started_at": session["started_at"]} + + @app.post("/api/sessions/{session_id}/submit", response_model=SubmitResponse) + def submit_session( + session_id: str, + request: SubmitSessionRequest, + current_dataset_store: DatasetStore = Depends(get_dataset_store), + current_session_store: SessionStore = Depends(get_session_store), + current_verifier: VerificationService = Depends(get_verifier), + ) -> SubmitResponse: + session = current_session_store.get_session(session_id) + if session is None: + raise HTTPException(status_code=404, detail="Session not found.") + if not session["started_at"]: + raise HTTPException(status_code=409, detail="Session is not ready yet.") + row = current_dataset_store.get_row(str(session["puzzle_filename"])) + verification = current_verifier.verify( + puzzle_type=str(session["puzzle_type"]), + problem_ascii=row.problem, + board_ascii=request.board_ascii, + args=str(session["args"]), + ) + updated = current_session_store.record_submission( + session_id=session_id, + solved=bool(verification.get("correct")), + submitted_artifact=request.board_ascii, + verification_payload=verification, + ) + return SubmitResponse( + solved=bool(updated["solved"]), + elapsed_ms=updated["elapsed_ms"], + status=str(updated["status"]), + verification=verification, + ) + + @app.get("/api/admin/solves", dependencies=[Depends(require_admin)]) + def admin_solves( + player_name_norm: str | None = Query(default=None), + puzzle_type: str | None = Query(default=None), + difficulty: str | None = Query(default=None), + status: str | None = Query(default=None), + date_from: str | None = Query(default=None), + date_to: str | None = Query(default=None), + current_session_store: SessionStore = Depends(get_session_store), + ) -> list[dict[str, Any]]: + return current_session_store.list_solves( + { + "player_name_norm": player_name_norm, + "puzzle_type": puzzle_type, + "difficulty": difficulty, + "status": status, + "date_from": date_from, + "date_to": date_to, + } + ) + + @app.get("/api/admin/aggregates", dependencies=[Depends(require_admin)]) + def admin_aggregates( + player_name_norm: str | None = Query(default=None), + puzzle_type: str | None = Query(default=None), + difficulty: str | None = Query(default=None), + date_from: str | None = Query(default=None), + date_to: str | None = Query(default=None), + current_session_store: SessionStore = Depends(get_session_store), + ) -> list[dict[str, Any]]: + aggregates = current_session_store.aggregate_solves( + { + "player_name_norm": player_name_norm, + "puzzle_type": puzzle_type, + "difficulty": difficulty, + "date_from": date_from, + "date_to": date_to, + } + ) + return [item.__dict__ for item in aggregates] + + frontend_dist_dir = resolved_settings.frontend_dist_dir + assets_dir = frontend_dist_dir / "assets" + if assets_dir.exists(): + app.mount("/assets", StaticFiles(directory=assets_dir), name="assets") + + @app.get("/{path:path}") + def spa(path: str) -> FileResponse: + if path.startswith("api/"): + raise HTTPException(status_code=404, detail="Not found.") + index_path = frontend_dist_dir / "index.html" + if index_path.exists(): + return FileResponse(index_path) + raise HTTPException( + status_code=503, + detail="Frontend has not been built yet. Run `npm run build` in frontend/.", + ) + + return app + + +app = create_app() if os.getenv("TOPOBENCH_SKIP_AUTOAPP") != "1" else FastAPI() diff --git a/space_app/models.py b/space_app/models.py new file mode 100644 index 0000000000000000000000000000000000000000..642e078285920f32abcb6330eaa6a703a6faa94b --- /dev/null +++ b/space_app/models.py @@ -0,0 +1,82 @@ +from __future__ import annotations + +from dataclasses import dataclass +from statistics import mean, median +from typing import Any + + +ALLOWED_PUZZLES = [ + "bridges", + "flow_free", + "galaxies", + "loopy", + "pattern", + "undead", +] +ALLOWED_DIFFICULTIES = ["easy", "medium", "hard"] +SESSION_STATUSES = ["assigned", "ready", "attempted", "solved"] + + +def normalize_player_name(value: str) -> str: + parts = value.strip().split() + return " ".join(parts).lower() + + +def engine_for_puzzle(puzzle_type: str) -> str: + return f"{puzzle_type}_ascii" + + +@dataclass(frozen=True) +class DatasetRow: + filename: str + puzzlename: str + args: str + problem: str + solution: str + difficulty: str + image_base64: str | None = None + + @classmethod + def from_payload(cls, payload: dict[str, Any]) -> "DatasetRow": + return cls( + filename=str(payload["filename"]), + puzzlename=str(payload["puzzlename"]), + args=str(payload.get("args") or ""), + problem=str(payload["problem"]), + solution=str(payload["solution"]), + difficulty=str(payload["difficulty"]), + image_base64=payload.get("image_base64"), + ) + + +@dataclass(frozen=True) +class SolveAggregate: + player_name_norm: str + puzzle_type: str + difficulty: str + solve_count: int + avg_ms: float + median_ms: float + min_ms: int + max_ms: int + + @classmethod + def from_rows( + cls, + *, + player_name_norm: str, + puzzle_type: str, + difficulty: str, + elapsed_values: list[int], + ) -> "SolveAggregate": + return cls( + player_name_norm=player_name_norm, + puzzle_type=puzzle_type, + difficulty=difficulty, + solve_count=len(elapsed_values), + avg_ms=float(mean(elapsed_values)), + median_ms=float(median(elapsed_values)), + min_ms=min(elapsed_values), + max_ms=max(elapsed_values), + ) + diff --git a/space_app/schemas.py b/space_app/schemas.py new file mode 100644 index 0000000000000000000000000000000000000000..7e82f1f8f74825bbfe0860be7bc37274aeaa2c67 --- /dev/null +++ b/space_app/schemas.py @@ -0,0 +1,56 @@ +from __future__ import annotations + +from typing import Any + +from pydantic import BaseModel, Field, field_validator + +from .models import ALLOWED_DIFFICULTIES, ALLOWED_PUZZLES + + +class CreateSessionRequest(BaseModel): + player_name: str = Field(min_length=1, max_length=80) + puzzle_type: str + difficulty: str + + @field_validator("puzzle_type") + @classmethod + def validate_puzzle_type(cls, value: str) -> str: + if value not in ALLOWED_PUZZLES: + raise ValueError(f"Unsupported puzzle type: {value}") + return value + + @field_validator("difficulty") + @classmethod + def validate_difficulty(cls, value: str) -> str: + if value not in ALLOWED_DIFFICULTIES: + raise ValueError(f"Unsupported difficulty: {value}") + return value + + +class SubmitSessionRequest(BaseModel): + board_ascii: str = Field(min_length=1) + + +class SessionPayload(BaseModel): + problem_ascii: str + current_board_ascii: str + image_base64: str | None = None + + +class SessionResponse(BaseModel): + session_id: str + engine: str + puzzle_type: str + difficulty: str + puzzle_id: str + args: str + status: str + started_at: str | None = None + payload: SessionPayload + + +class SubmitResponse(BaseModel): + solved: bool + elapsed_ms: int | None + status: str + verification: dict[str, Any] diff --git a/space_app/verification.py b/space_app/verification.py new file mode 100644 index 0000000000000000000000000000000000000000..568f41376da1792e95a381b7d44f2100db614ef5 --- /dev/null +++ b/space_app/verification.py @@ -0,0 +1,35 @@ +from __future__ import annotations + +import sys +from pathlib import Path +from typing import Any + + +ROOT_DIR = Path(__file__).resolve().parents[1] +EVALS_SRC_DIR = ROOT_DIR / "evals" / "src" +if str(EVALS_SRC_DIR) not in sys.path: + sys.path.insert(0, str(EVALS_SRC_DIR)) + +from evals_verifier import verify_flow_free, verify_with_rlp # type: ignore +from puzzles import PUZZLES # type: ignore + + +class VerificationService: + def verify( + self, + *, + puzzle_type: str, + problem_ascii: str, + board_ascii: str, + args: str, + ) -> dict[str, Any]: + spec = PUZZLES[puzzle_type] + if spec.verifier_type == "flow_free": + return verify_flow_free(problem_ascii, board_ascii) + return verify_with_rlp( + puzzle_type=spec.verifier_type, + problem_ascii=problem_ascii, + extracted_board=board_ascii, + args=args, + ) + diff --git a/submodules/BUILD_RLP.md b/submodules/BUILD_RLP.md new file mode 100644 index 0000000000000000000000000000000000000000..e7ec9b2b5985f6b3fb09e07ab0901e56ec81e035 --- /dev/null +++ b/submodules/BUILD_RLP.md @@ -0,0 +1,117 @@ +# Building the RLP (Reinforcement Learning Puzzles) Library + +This document provides instructions for building the rlp puzzle library, which is required for the verifier API. + +## Prerequisites + +Install the required system packages: + +```bash +# On Debian/Ubuntu +apt-get update +apt-get install -y cmake build-essential pkg-config libgtk-3-dev imagemagick +``` + +## Building the Library + +1. Navigate to the rlp submodule directory: +```bash +cd submodules/rlp +``` + +2. Create the library output directory: +```bash +mkdir -p rlp/lib +``` + +3. Run cmake to configure the build: +```bash +cd rlp/lib +cmake ../../puzzles +``` + +4. Build the libraries (this will also generate icons if ImageMagick is installed): +```bash +make -j4 +``` + +5. Verify the build was successful by checking for .so files: +```bash +ls *.so +# Should show: libbridges.so, libgalaxies.so, libloopy.so, libpattern.so, libundead.so, etc. +``` + +6. Verify icons were generated: +```bash +ls icons/*.png | head -5 +# Should show PNG files like bridges-96d24.png, etc. +``` + +## Quick One-Liner + +For a fresh build from the repository root: + +```bash +cd submodules/rlp && mkdir -p rlp/lib && cd rlp/lib && cmake ../../puzzles && make -j4 +``` + +## Troubleshooting + +### Missing pkg-config +``` +Could NOT find PkgConfig (missing: PKG_CONFIG_EXECUTABLE) +``` +Solution: `apt-get install -y pkg-config` + +### Missing GTK +``` +Could not find gtk+-3.0 +``` +Solution: `apt-get install -y libgtk-3-dev` + +### Icons not generated +``` +Puzzle icons cannot be rebuilt (did not find ImageMagick) +``` +Solution: `apt-get install -y imagemagick` + +Then rebuild: +```bash +cd rlp/lib && rm -rf * && cmake ../../puzzles && make -j4 +``` + +### Segfaults when running verifier +This usually happens when: +1. Icons are missing - rebuild with ImageMagick installed +2. Too many puzzle instances created - the verifier code caches instances to avoid this + +## Supported Puzzle Types + +The verifier supports these puzzle types from the rlp library: +- **bridges** - Connect islands with bridges +- **undead** - Place ghosts, vampires, and zombies +- **galaxies** - Divide grid into rotationally symmetric regions +- **pattern** - Fill grid based on row/column clues (nonogram) +- **loopy** - Draw a single loop through the grid + +## Using the Verifier + +After building, you can use the verifier from Python: + +```python +import sys +sys.path.insert(0, 'submodules/rlp') + +from rlp.puzzle import Puzzle +from verifier import verify_ascii_state + +# Create puzzle instance +puzzle = Puzzle('bridges', arg='5x5deL', headless=True) +puzzle.new_game() + +# Verify an ASCII solution +result = verify_ascii_state(puzzle, ascii_solution, problem_ascii=original_problem) +print(result) # "SOLVED" or "NOT SOLVED" +``` + +See `submodules/rlp/VERIFIER_README.md` for detailed API documentation. diff --git a/submodules/flowfree/.gitattributes b/submodules/flowfree/.gitattributes new file mode 100644 index 0000000000000000000000000000000000000000..bdb0cabc87cf50106df6e15097dff816c8c3eb34 --- /dev/null +++ b/submodules/flowfree/.gitattributes @@ -0,0 +1,17 @@ +# Auto detect text files and perform LF normalization +* text=auto + +# Custom for Visual Studio +*.cs diff=csharp + +# Standard to msysgit +*.doc diff=astextplain +*.DOC diff=astextplain +*.docx diff=astextplain +*.DOCX diff=astextplain +*.dot diff=astextplain +*.DOT diff=astextplain +*.pdf diff=astextplain +*.PDF diff=astextplain +*.rtf diff=astextplain +*.RTF diff=astextplain diff --git a/submodules/flowfree/.gitignore b/submodules/flowfree/.gitignore new file mode 100644 index 0000000000000000000000000000000000000000..7b431249e830a4020d9703a7d458a87222fb00d8 --- /dev/null +++ b/submodules/flowfree/.gitignore @@ -0,0 +1,83 @@ +# Object files +*.o +*.ko +*.obj +*.elf + +# Precompiled Headers +*.gch +*.pch + +# Libraries +*.lib +*.a +*.la +*.lo + +# Shared objects (inc. Windows DLLs) +*.dll +*.so +*.so.* +*.dylib + +# Executables +*.exe +*.out +*.app +*.i*86 +*.x86_64 +*.hex + +# Debug files +*.dSYM/ + +# ========================= +# Operating System Files +# ========================= + +# OSX +# ========================= + +.DS_Store +.AppleDouble +.LSOverride + +# Thumbnails +._* + +# Files that might appear in the root of a volume +.DocumentRevisions-V100 +.fseventsd +.Spotlight-V100 +.TemporaryItems +.Trashes +.VolumeIcon.icns + +# Directories potentially created on remote AFP share +.AppleDB +.AppleDesktop +Network Trash Folder +Temporary Items +.apdisk + +# Windows +# ========================= + +# Windows image file caches +Thumbs.db +ehthumbs.db + +# Folder config file +Desktop.ini + +# Recycle Bin used on file shares +$RECYCLE.BIN/ + +# Windows Installer files +*.cab +*.msi +*.msm +*.msp + +# Windows shortcuts +*.lnk diff --git a/submodules/flowfree/LICENSE.txt b/submodules/flowfree/LICENSE.txt new file mode 100644 index 0000000000000000000000000000000000000000..f288702d2fa16d3cdf0035b15a9fcbc552cd88e7 --- /dev/null +++ b/submodules/flowfree/LICENSE.txt @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/submodules/flowfree/README.md b/submodules/flowfree/README.md new file mode 100644 index 0000000000000000000000000000000000000000..0af1f56472e1bb55cde1d7151443001cd0e2bff2 --- /dev/null +++ b/submodules/flowfree/README.md @@ -0,0 +1,119 @@ +# FlowFree +FlowFree puzzles solver and generator written in C, works also for Numberlink/Arukone puzzles. + +Both solver and generator are implemented in the same source code (flowfree.c) and executable. Only input differs depending on which functionality you want to use. + +Two format converters are also available ("Raetsel" and "Thomas Ahle" converters, see below). + +The makefiles provided to generate the executables work only on Linux family operating systems but the sources are not OS specific. + +## The solver + +The solver is a solution to challenge https://www.reddit.com/r/dailyprogrammer/comments/4zog32/20160826_challenge_280_hard_free_flow_solver/, please read this page for more details especially regarding the input format specifications. + +The basic idea is at each step to choose the cell that has the least valid choices to link with its neighbours, then lock this cell and the links chosen, and go to next step until a solution is found (all cells are exhausted) or an inconsistency is encountered (a cell has no valid choices). If a cell with one choice is encountered it is immediately locked without searching for another one. + +The search is iterative and is using explicit stacks, to be able to solve large puzzles without having issue with stack size overflow when the search is done recursively. + +First it tries to solve the puzzle with the additional constraint that no paths between two endpoints are self-touching, it means that one cell cannot have more that 2 neighbours of the same color (1 for an endpoint). + +This additional constraint reduces the search space tremendously and allows to solve a lot of large grids almost instantly. + +If the puzzle cannot be solved this way it tries again without this constraint. It seems that NumberLink/Arukone puzzles forbid self-touching implicitly, while FlowFree puzzles may allow it. + +The solver displays the first solution found and at the end of execution the number of nodes (search space size) and the total number of solutions found. + +## The generator + +The generator was developed to test the solver, it generates random starting positions and calls the solver until one position is solved with the criteria provided in input. + +Sample input data for the generator: + +7 11 9 0 3 1 1000000 + +It means that the generator must create a puzzle with 7 colors in a grid of 11 columns by 9 rows, with self-touching forbidden, and a minimal distance of 3 cells between two endpoints of the same color. The puzzle shall not have more than 1 solution. The number of attempts made is shown every 1000000 grids. + +If a grid is solved successfully but with more solutions than requested in input it is displayed with the message "Too many solutions" below. + +## Test data + +The Puzzles folder contains grids from various sources converted to the solver input format: + +| Files | Source | +| ------------------------------ | ------------------------------------------------------------------------------------------------------------ | +| flowfree_\*\_random\*.txt | Created by the generator | +| flowfree_example_\*.txt | https://www.reddit.com/r/dailyprogrammer/comments/4zog32/20160826_challenge_280_hard_free_flow_solver/ | +| flowfree_huge/killer/large.txt | https://github.com/thomasahle/numberlink/tree/master/puzzles | +| flowfree_mini.txt | The smallest puzzle possible | +| flowfree_nikoli_\*.txt | http://www.nikoli.com/en/event/puzzle_hayatoki.html | +| flowfree_oxford_\*.txt | http://spivey.oriel.ox.ac.uk/wiki/index.php/Programming_competition_results | +| flowfree_raetsel_\*.txt | http://www.janko.at/Raetsel/Arukone/ | +| flowfree_wikipedia.txt | https://en.wikipedia.org/wiki/Numberlink | + +The others are FlowFree official grids. + +## The "Raetsel" converter + +convert_raetsel.c converts grids from the format used by this numberlink solver in Copris: http://bach.istc.kobe-u.ac.jp/copris/puzzles/numberlink/ (which is using grids from http://www.janko.at/Raetsel/Arukone/) to the format used by the FlowFree solver. + +Input example +``` +12 +12 +- - - - - - - - - - - 1 +- 2 7 - - - - - - - - - +- - - - - - - - - - - - +- - - - - - - - - 4 - - +3 - - 6 - - - - - - - - +- - - - - 6 - - - - - - +- - - - - - - 3 - - - - +- - - - 5 - - - - - - - +- - - - - - - - - - - - +- - 4 - - - - - - - 2 - +- - - - - - - - - - 5 - +- - - - - 1 - - - 7 - - +``` +Output +``` +7 12 12 +(11, 0) (5, 11) +(1, 1) (10, 9) +(0, 4) (7, 6) +(9, 3) (2, 9) +(4, 7) (10, 10) +(3, 4) (5, 5) +(2, 1) (9, 11) +``` + +## The "Thomas Ahle" converter + +convert_thomasahle.c converts grids from the format used by this (very fast) numberlink solver: https://github.com/thomasahle/numberlink to the format used by the FlowFree solver. + +Input example +``` +12 12 +.......D.... +.....G...... +......G..... +...I........ +.....C.C.... +............ +.B.......... +......E..... +.H.E.H...... +.I.......F.. +..........B. +.......F.D.. +``` +Output +``` +8 12 12 +(7, 0) (9, 11) +(5, 1) (6, 2) +(3, 3) (1, 9) +(5, 4) (7, 4) +(1, 6) (10, 10) +(6, 7) (3, 8) +(1, 8) (5, 8) +(9, 9) (7, 11) +``` diff --git a/submodules/flowfree/clean.sh b/submodules/flowfree/clean.sh new file mode 100644 index 0000000000000000000000000000000000000000..34152c64ddc38e6f4c2f36c76721cbeb43999aeb --- /dev/null +++ b/submodules/flowfree/clean.sh @@ -0,0 +1,6 @@ +make -f convert_raetsel.make clean +make -f convert_raetsel_debug.make clean +make -f convert_thomasahle.make clean +make -f convert_thomasahle_debug.make clean +make -f flowfree.make clean +make -f flowfree_debug.make clean diff --git a/submodules/flowfree/convert_freeflow.py b/submodules/flowfree/convert_freeflow.py new file mode 100644 index 0000000000000000000000000000000000000000..df234e4cf9f0c058a1fe0c0e5dcd0bf9a9f6b6a8 --- /dev/null +++ b/submodules/flowfree/convert_freeflow.py @@ -0,0 +1,219 @@ +# #!/usr/bin/env python3 +# import re +# import sys +# from itertools import chain + +# """ +# Usage: +# # From a file +# python convert_flowfree.py puzzle.txt + +# # Or pipe the raw generator output +# printf "3 5 5\n(2, 0) (2, 2)\n(3, 3) (1, 3)\n(1, 0) (1, 4)\n" | python convert_flowfree.py + +# Notes: +# - Expects lines like: +# +# (x1, y1) (x2, y2) +# ... +# for exactly lines after the header. +# - Coordinates are zero-based and are (col, row). +# - Colors are labeled A, B, C, ... (wraps to aA... if >52 colors). +# """ + +# HEADER_RE = re.compile(r"^\s*(\d+)\s+(\d+)\s+(\d+)\s*$") +# PAIR_RE = re.compile( +# r"\(\s*(\d+)\s*,\s*(\d+)\s*\)\s*\(\s*(\d+)\s*,\s*(\d+)\s*\)" +# ) + +# def letter_labels(n): +# base = [chr(i) for i in range(ord('A'), ord('Z')+1)] +# extra = [chr(i) for i in range(ord('a'), ord('z')+1)] +# # If still more needed, go to double letters: AA, AB, ... +# if n <= len(base) + len(extra): +# return list(chain(base, extra))[:n] +# labels = list(chain(base, extra)) +# i = 0 +# while len(labels) < n: +# for ch in base: +# labels.append(base[i % len(base)] + ch) +# if len(labels) == n: +# break +# i += 1 +# return labels + +# def parse_blocks(lines): +# """ +# Yields (num_colors, cols, rows, pairs_list) for each detected puzzle block. +# pairs_list is a list of ((x1,y1),(x2,y2)) of length num_colors. +# """ +# i = 0 +# while i < len(lines): +# m = HEADER_RE.match(lines[i]) +# if not m: +# i += 1 +# continue + +# num_colors, cols, rows = map(int, m.groups()) +# i += 1 + +# pairs = [] +# while i < len(lines) and len(pairs) < num_colors: +# pm = PAIR_RE.search(lines[i]) +# if pm: +# x1, y1, x2, y2 = map(int, pm.groups()) +# pairs.append(((x1, y1), (x2, y2))) +# i += 1 +# else: +# # skip noise lines between pairs +# i += 1 + +# if len(pairs) == num_colors: +# yield num_colors, cols, rows, pairs +# # else: header without enough pairs; skip and keep scanning + +# def grid_from_puzzle(cols, rows, pairs, labels): +# grid = [['.' for _ in range(cols)] for _ in range(rows)] +# for label, ((x1, y1), (x2, y2)) in zip(labels, pairs): +# for (x, y) in [(x1, y1), (x2, y2)]: +# if not (0 <= x < cols and 0 <= y < rows): +# raise ValueError(f"Coordinate {(x,y)} out of bounds for {cols}x{rows}") +# if grid[y][x] != '.': +# raise ValueError(f"Cell {(x,y)} already occupied (overlap).") +# grid[y][x] = label +# return grid + +# def print_grid(grid): +# for row in grid: +# print(''.join(row)) + +# def main(): +# data = sys.stdin.read() if sys.stdin and not sys.stdin.isatty() else None +# if data is None: +# if len(sys.argv) < 2: +# print("Provide a file or pipe the generator output to stdin.", file=sys.stderr) +# sys.exit(1) +# with open(sys.argv[1], 'r', encoding='utf-8') as f: +# data = f.read() + +# lines = data.splitlines() +# any_printed = False +# for num_colors, cols, rows, pairs in parse_blocks(lines): +# labels = letter_labels(num_colors) +# grid = grid_from_puzzle(cols, rows, pairs, labels) +# print('"""') +# print_grid(grid) +# print('"""') +# any_printed = True + +# if not any_printed: +# print("No valid puzzle blocks found.", file=sys.stderr) +# sys.exit(2) + +# if __name__ == "__main__": +# main() + + + + +#!/usr/bin/env python3 +import re +import sys +from itertools import chain + +HEADER_RE = re.compile(r"^\s*(\d+)\s+(\d+)\s+(\d+)\s*$") +COORD_RE = re.compile(r"\(\s*(\d+)\s*,\s*(\d+)\s*\)") + +def letter_labels(n): + base = [chr(i) for i in range(ord('A'), ord('Z')+1)] + extra = [chr(i) for i in range(ord('a'), ord('z')+1)] + if n <= len(base) + len(extra): + return list(chain(base, extra))[:n] + labels = list(chain(base, extra)) + i = 0 + while len(labels) < n: + for ch in base: + labels.append(base[i % len(base)] + ch) + if len(labels) == n: + break + i += 1 + return labels + +def parse_blocks(lines): + """ + Yields (num_colors, cols, rows, paths_list) per puzzle block. + paths_list: list of lists of (x,y). For endpoints format, each list has len 2. + For solution format, each list may have len > 2 (full path). + """ + i = 0 + while i < len(lines): + m = HEADER_RE.match(lines[i]) + if not m: + i += 1 + continue + + num_colors, cols, rows = map(int, m.groups()) + i += 1 + + paths = [] + while i < len(lines) and len(paths) < num_colors: + coords = COORD_RE.findall(lines[i]) + if coords: + path = [(int(x), int(y)) for x, y in coords] + paths.append(path) + i += 1 # always advance; skip noise automatically + + if len(paths) == num_colors: + yield num_colors, cols, rows, paths + # else: header without enough lines -> skip and keep scanning + +def build_grid(cols, rows): + return [['.' for _ in range(cols)] for _ in range(rows)] + +def place_paths_on_grid(cols, rows, paths, labels): + """ + Fills the grid with labels along either endpoints (len 2) or full paths (len > 2). + """ + grid = build_grid(cols, rows) + for label, path in zip(labels, paths): + for (x, y) in path: + if not (0 <= x < cols and 0 <= y < rows): + raise ValueError(f"Coordinate {(x,y)} out of bounds for {cols}x{rows}") + if grid[y][x] != '.' and grid[y][x] != label: + raise ValueError(f"Cell {(x,y)} already occupied by '{grid[y][x]}' (overlap).") + grid[y][x] = label + return grid + +def print_grid(grid): + for row in grid: + print(''.join(row)) + +def read_all_input(): + # Prefer stdin if piped; else read from file arg. + if sys.stdin and not sys.stdin.isatty(): + return sys.stdin.read() + if len(sys.argv) < 2: + print("Provide a file or pipe the generator/solution output to stdin.", file=sys.stderr) + sys.exit(1) + with open(sys.argv[1], 'r', encoding='utf-8') as f: + return f.read() + +def main(): + data = read_all_input() + lines = data.splitlines() + + any_printed = False + for num_colors, cols, rows, paths in parse_blocks(lines): + labels = letter_labels(num_colors) + grid = place_paths_on_grid(cols, rows, paths, labels) + print('"""') + print_grid(grid) + print('"""') + any_printed = True + + if not any_printed: + print("No valid puzzle blocks found.", file=sys.stderr) + sys.exit(2) + +if __name__ == "__main__": + main() diff --git a/submodules/flowfree/convert_raetsel.c b/submodules/flowfree/convert_raetsel.c new file mode 100644 index 0000000000000000000000000000000000000000..88c473c2bf22b95b1e91fec50a69ecf88b92115e --- /dev/null +++ b/submodules/flowfree/convert_raetsel.c @@ -0,0 +1,88 @@ +#include +#include + +typedef struct { + unsigned long x; + unsigned long y; +} +coord_t; + +typedef struct { + coord_t start; + coord_t end; +} +color_t; + +void init_colors(unsigned long, unsigned long); + +unsigned long rows_n, columns_n; +color_t *colors; + +int main(void) { + unsigned long colors_lo, colors_hi, i; + if (scanf("%lu%lu", &rows_n, &columns_n) != 2 || rows_n < 1UL || columns_n < 1UL || rows_n*columns_n < 2UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + colors = malloc(sizeof(color_t)); + if (!colors) { + fprintf(stderr, "Could not allocate memory for colors\n"); + fflush(stderr); + return EXIT_FAILURE; + } + colors_lo = 0UL; + colors_hi = 1UL; + init_colors(colors_lo, colors_hi); + for (i = 0UL; i < rows_n; i++) { + unsigned long j; + for (j = 0UL; j < columns_n; j++) { + unsigned long number; + if (scanf("%lu", &number) == 1) { + if (number > colors_hi) { + color_t *colors_tmp = realloc(colors, sizeof(color_t)*number); + if (!colors_tmp) { + fprintf(stderr, "Could not reallocate memory for colors\n"); + fflush(stderr); + free(colors); + return EXIT_FAILURE; + } + colors = colors_tmp; + colors_lo = colors_hi; + colors_hi = number; + init_colors(colors_lo, colors_hi); + } + number--; + if (colors[number].start.x < columns_n) { + colors[number].end.x = j; + colors[number].end.y = i; + } + else { + colors[number].start.x = j; + colors[number].start.y = i; + } + } + else { + getchar(); + } + } + } + printf("%lu %lu %lu\n", colors_hi, columns_n, rows_n); + for (i = 0UL; i < colors_hi; i++) { + printf("(%lu, %lu) ", colors[i].start.x, colors[i].start.y); + printf("(%lu, %lu)\n", colors[i].end.x, colors[i].end.y); + } + fflush(stdout); + free(colors); + return EXIT_SUCCESS; +} + +void init_colors(unsigned long lo, unsigned long hi) { + unsigned long i; + for (i = lo; i < hi; i++) { + colors[i].start.x = columns_n; + colors[i].start.y = rows_n; + colors[i].end.x = columns_n; + colors[i].end.y = rows_n; + } +} diff --git a/submodules/flowfree/convert_raetsel.make b/submodules/flowfree/convert_raetsel.make new file mode 100644 index 0000000000000000000000000000000000000000..2c7fb23eb641ef34474c7df96eec65de76ffb3da --- /dev/null +++ b/submodules/flowfree/convert_raetsel.make @@ -0,0 +1,10 @@ +CONVERT_RAETSEL_C_FLAGS=-c -O2 -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +convert_raetsel: convert_raetsel.o + gcc -o convert_raetsel convert_raetsel.o + +convert_raetsel.o: convert_raetsel.c convert_raetsel.make + gcc ${CONVERT_RAETSEL_C_FLAGS} -o convert_raetsel.o convert_raetsel.c + +clean: + rm -f convert_raetsel convert_raetsel.o diff --git a/submodules/flowfree/convert_raetsel_debug.make b/submodules/flowfree/convert_raetsel_debug.make new file mode 100644 index 0000000000000000000000000000000000000000..2f27552b8f3f8a7fc8b9eb5d37d49e25727d9232 --- /dev/null +++ b/submodules/flowfree/convert_raetsel_debug.make @@ -0,0 +1,10 @@ +CONVERT_RAETSEL_C_FLAGS=-g -c -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +convert_raetsel_debug: convert_raetsel_debug.o + gcc -g -o convert_raetsel_debug convert_raetsel_debug.o + +convert_raetsel_debug.o: convert_raetsel.c convert_raetsel_debug.make + gcc ${CONVERT_RAETSEL_C_FLAGS} -o convert_raetsel_debug.o convert_raetsel.c + +clean: + rm -f convert_raetsel_debug convert_raetsel_debug.o diff --git a/submodules/flowfree/convert_thomasahle.c b/submodules/flowfree/convert_thomasahle.c new file mode 100644 index 0000000000000000000000000000000000000000..b3431d56123d287f4743dce2e303677933bf0422 --- /dev/null +++ b/submodules/flowfree/convert_thomasahle.c @@ -0,0 +1,79 @@ +#include +#include + +typedef struct { + unsigned long x; + unsigned long y; +} +coord_t; + +typedef struct { + int symbol; + coord_t start; + coord_t end; +} +color_t; + +int main(void) { + unsigned long columns_n, rows_n, colors_n, i; + color_t *colors; + if (scanf("%lu%lu", &columns_n, &rows_n) != 2 || rows_n < 1UL || columns_n < 1UL || rows_n*columns_n < 2UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + getchar(); + colors = NULL; + colors_n = 0UL; + for (i = 0UL; i < rows_n; i++) { + unsigned long j; + for (j = 0UL; j < columns_n; j++) { + int c = getchar(); + if (c != '.') { + unsigned long number; + for (number = 0UL; number < colors_n && colors[number].symbol != c; number++); + if (number < colors_n) { + colors[number].end.x = j; + colors[number].end.y = i; + } + else { + if (colors_n > 0UL) { + color_t *colors_tmp = realloc(colors, sizeof(color_t)*(number+1UL)); + if (!colors_tmp) { + fprintf(stderr, "Could not reallocate memory for colors\n"); + fflush(stderr); + free(colors); + return EXIT_FAILURE; + } + colors = colors_tmp; + } + else { + colors = malloc(sizeof(color_t)); + if (!colors) { + fprintf(stderr, "Could not allocate memory for colors\n"); + fflush(stderr); + return EXIT_FAILURE; + } + } + colors_n++; + colors[number].symbol = c; + colors[number].start.x = j; + colors[number].start.y = i; + colors[number].end.x = columns_n; + colors[number].end.y = rows_n; + } + } + } + getchar(); + } + printf("%lu %lu %lu\n", colors_n, columns_n, rows_n); + for (i = 0UL; i < colors_n; i++) { + printf("(%lu, %lu) ", colors[i].start.x, colors[i].start.y); + printf("(%lu, %lu)\n", colors[i].end.x, colors[i].end.y); + } + fflush(stdout); + if (colors_n > 0UL) { + free(colors); + } + return EXIT_SUCCESS; +} diff --git a/submodules/flowfree/convert_thomasahle.make b/submodules/flowfree/convert_thomasahle.make new file mode 100644 index 0000000000000000000000000000000000000000..a4603c0ea968b226495b941a8b6a749890169281 --- /dev/null +++ b/submodules/flowfree/convert_thomasahle.make @@ -0,0 +1,10 @@ +CONVERT_THOMASAHLE_C_FLAGS=-c -O2 -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +convert_thomasahle: convert_thomasahle.o + gcc -o convert_thomasahle convert_thomasahle.o + +convert_thomasahle.o: convert_thomasahle.c convert_thomasahle.make + gcc ${CONVERT_THOMASAHLE_C_FLAGS} -o convert_thomasahle.o convert_thomasahle.c + +clean: + rm -f convert_thomasahle convert_thomasahle.o diff --git a/submodules/flowfree/convert_thomasahle_debug.make b/submodules/flowfree/convert_thomasahle_debug.make new file mode 100644 index 0000000000000000000000000000000000000000..c8190dc38ffac0e61591802d424f35df164f19a5 --- /dev/null +++ b/submodules/flowfree/convert_thomasahle_debug.make @@ -0,0 +1,10 @@ +CONVERT_THOMASAHLE_C_FLAGS=-g -c -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +convert_thomasahle_debug: convert_thomasahle_debug.o + gcc -g -o convert_thomasahle_debug convert_thomasahle_debug.o + +convert_thomasahle_debug.o: convert_thomasahle.c convert_thomasahle_debug.make + gcc ${CONVERT_THOMASAHLE_C_FLAGS} -o convert_thomasahle_debug.o convert_thomasahle.c + +clean: + rm -f convert_thomasahle_debug convert_thomasahle_debug.o diff --git a/submodules/flowfree/create_df.py b/submodules/flowfree/create_df.py new file mode 100644 index 0000000000000000000000000000000000000000..8bf628fbd45a2584c614028267535086ed754a70 --- /dev/null +++ b/submodules/flowfree/create_df.py @@ -0,0 +1,137 @@ +# %% + + +# %% +import re +import sys +from pathlib import Path +import pandas as pd + +# --- Config --- +ROOT = Path("/notebooks/multimodal_cot/FlowFree/generated/") # folder containing your files +OUTPUT_CSV = ROOT / "problems_solutions.csv" + +# Regex for any triple-quoted grid +TRIPLE_BLOCK_RE = re.compile(r'"""\s*([\s\S]*?)\s*"""', re.M) + +# Regex for the specific "Human-readable solution" section +HR_SOLUTION_RE = re.compile( + r'##\s*Human-readable solution:\s*"""\s*([\s\S]*?)\s*"""', + re.M, +) + +def extract_problem_and_solution(text: str): + """ + Returns (problem_grid, solution_grid) as strings (without quotes), + or (None, None) if not found. + - Problem grid: first triple-quoted block in the file. + - Solution grid: triple-quoted block following the 'Human-readable solution' header. + """ + # Find the solution block (authoritative when present) + sol_match = HR_SOLUTION_RE.search(text) + solution = sol_match.group(1) if sol_match else None + + # Problem: take the first triple-quoted block in the file + triples = TRIPLE_BLOCK_RE.findall(text) + problem = triples[0] if triples else None + + # Safety: If we only found one block, try to infer which it is. + # Prefer treating the explicitly labeled "Human-readable solution" as solution. + if problem == solution and problem is not None: + # If they’re the same (rare), keep as-is; otherwise leave as found. + pass + + return problem, solution + +def scan_folder(root: Path): + rows = [] + for p in root.rglob("*"): + if not p.is_file(): + continue + try: + text = p.read_text(encoding="utf-8") + except Exception: + # Skip unreadable files + continue + + problem, solution = extract_problem_and_solution(text) + if problem is None and solution is None: + continue + + rows.append({ + "path": str(p.relative_to(root)), + "problem": problem, + "solution": solution, + }) + return rows + +# %% +rows = scan_folder(ROOT) +df = pd.DataFrame(rows) + +df.head() + +# %% +df.shape + +# %% +df.to_csv('/notebooks/multimodal_cot/FlowFree/flowfree_problems_solutions.csv', index=False) + +# %% +#path like 9x9_8c_5_2af3ded9.txt +# find histogram of grid sizes and number of colors +df['grid_size'] = df['path'].apply(lambda x: x.split('_')[0]) +df['num_colors'] = df['path'].apply(lambda x: int(x.split('_')[1][:-1])) +df['num_colors'].value_counts().sort_index().plot(kind='bar', title='Number of colors distribution') + + +# %% +df['grid_size'].value_counts().sort_index().plot(kind='bar', title='Grid size distribution') + +# %% +df + +# %% +# add a column with 5*5, 6*6 as easy, 7*7, 8*8 as medium, 9*9, 10*10 as hard +df['difficulty'] = df['grid_size'].apply(lambda x: 'easy' if x in ['5x5', '6x6'] else ('medium' if x in ['7x7', '8x8'] else 'hard')) +df['difficulty'].value_counts().sort_index().plot(kind='bar', title='Difficulty distribution') + + + + +# %% +# now sample a test set with 50 easy samples, 50 medium samples and 50 hard samples +# add column as test or train +seed = 42 +df['set'] = 'train' +df_copy = df.copy() +df_copy = df_copy.sample(frac=1, random_state=seed).reset_index(drop=True) # shuffle the dataframe +df_copy.shape + +for difficulty in ['easy', 'medium', 'hard']: + mask = (df_copy['difficulty'] == difficulty) & (df_copy['set'] == 'train') + test_samples = df_copy[mask].head(50).index + print(f"Selected {len(test_samples)} samples for difficulty {difficulty}") + # asd + df_copy.loc[test_samples, 'set'] = 'test' + +# %% +len(test_samples) + +# %% +df_copy.shape + + +# %% +df_copy['set'].value_counts().sort_index().plot(kind='bar', title='Train/Test distribution') + +# %% +df_copy[df_copy['set'] == 'test']['difficulty'].value_counts().sort_index().plot(kind='bar', title='Test set difficulty distribution') + +# %% + + +# %% +df_copy.to_csv('/notebooks/multimodal_cot/csvs/flowfree_problems_solutions.csv', index=False) + + diff --git a/submodules/flowfree/flowfree.c b/submodules/flowfree/flowfree.c new file mode 100644 index 0000000000000000000000000000000000000000..2ef13c25f58425e8e6a4a724e41d414cce4867cc --- /dev/null +++ b/submodules/flowfree/flowfree.c @@ -0,0 +1,1177 @@ +#include +#include +#include +#include + +#define LINKS_MAX 2UL +#define OPTIONS_MAX 4UL +#define CHOICES_MAX 3UL +#define PIPE_W 1UL +#define PIPE_N 2UL +#define PIPE_S 4UL +#define PIPE_E 8UL +#define CALLS_MAX 12UL +#define ROLLS_MAX 4UL + +typedef struct cell_s cell_t; +typedef struct color_s color_t; + +struct cell_s { + unsigned long col; + unsigned long row; + unsigned long pipes; + cell_t *path; + unsigned long rank; + color_t *color; + unsigned long links_todo; + unsigned long links_done; + cell_t *links[LINKS_MAX]; + cell_t *last; + cell_t *next; +}; + +struct color_s { + cell_t *start; + cell_t *end; +}; + +typedef enum { + CALL_SELECTION, + CALL_CHAIN, + CALL_UNROLL, + CALL_ROLL, + CALL_UNCHAIN +} +call_t; + +typedef struct { + unsigned long pipe_used; + cell_t *link; +} +option_t; + +typedef struct { + cell_t *cell; +} +selection_t; + +typedef struct { + cell_t *cell; + unsigned long options_n; + option_t options[OPTIONS_MAX]; +} +chain_t; + +typedef struct { + cell_t *cell; + cell_t *link; + cell_t *cell_path; + color_t *cell_color; + cell_t *link_path; + color_t *link_color; +} +unroll_t; + +typedef struct { + cell_t *cell; + cell_t *link; + unroll_t *unroll; +} +roll_t; + +typedef struct { + cell_t *link; + unroll_t *unroll; +} +choice_t; + +typedef struct { + unsigned long options_n; + option_t options[OPTIONS_MAX]; + unsigned long choices_n; + choice_t choices[CHOICES_MAX][LINKS_MAX]; +} +constraint_t; + +void set_cell(cell_t *, unsigned long, unsigned long, unsigned long); +void link_cell(cell_t *, cell_t *, cell_t *); +int read_color(color_t *); +cell_t *read_cell(int); +int set_color(color_t *); +int search_color(void); +unsigned long random_xy(unsigned long *, unsigned long *); +unsigned long erand(unsigned long); +unsigned long get_distance(unsigned long, unsigned long, unsigned long, unsigned long); +void set_cell_color(cell_t *, color_t *); +void flowfree(void); +void stack_call(call_t *, call_t); +void perform_call(call_t *); +void stack_selection(selection_t *, cell_t *); +void perform_selection(selection_t *); +void set_constraint(cell_t *, unsigned long, constraint_t *); +unsigned long set_options_empty(cell_t *, option_t []); +unsigned long set_options_w(cell_t *, option_t []); +unsigned long set_options_n(cell_t *, option_t []); +unsigned long set_options_wn(cell_t *, option_t []); +unsigned long set_options_s(cell_t *, option_t []); +unsigned long set_options_ws(cell_t *, option_t []); +unsigned long set_options_ns(cell_t *, option_t []); +unsigned long set_options_wns(cell_t *, option_t []); +unsigned long set_options_e(cell_t *, option_t []); +unsigned long set_options_we(cell_t *, option_t []); +unsigned long set_options_ne(cell_t *, option_t []); +unsigned long set_options_wne(cell_t *, option_t []); +unsigned long set_options_se(cell_t *, option_t []); +unsigned long set_options_wse(cell_t *, option_t []); +unsigned long set_options_nse(cell_t *, option_t []); +unsigned long set_options_wnse(cell_t *, option_t []); +void set_option(option_t *, unsigned long, cell_t *); +void add_roll_option(cell_t *, option_t *); +void add_choices(cell_t *, unsigned long, unsigned long, unsigned long, unsigned long, unsigned long *, choice_t [][LINKS_MAX]); +int roll_option(cell_t *, cell_t *); +int no_touching(cell_t *); +int touching_w(cell_t *); +int touching_n(cell_t *); +int touching_wn(cell_t *); +int touching_s(cell_t *); +int touching_ws(cell_t *); +int touching_ns(cell_t *); +int touching_e(cell_t *); +int touching_we(cell_t *); +int touching_ne(cell_t *); +int touching_se(cell_t *); +int same_path(cell_t *, cell_t *); +void stack_chain(chain_t *, cell_t *, unsigned long, option_t []); +void stack_unroll(unroll_t *, cell_t *, choice_t *); +void stack_roll(roll_t *, cell_t *, choice_t *); +void stack_unchain(chain_t *, cell_t *, unsigned long, option_t []); +void print_color(color_t *); +void print_cell(cell_t *, int); +void perform_chain(chain_t *); +void add_pipe(cell_t *, unsigned long, cell_t *); +void chain_cell(cell_t *); +void perform_unroll(unroll_t *); +void unroll_link(cell_t *, cell_t *, cell_t *, color_t *, cell_t *, color_t *); +void perform_roll(roll_t *); +void roll_link(cell_t *, cell_t *, unroll_t *); +void perform_unchain(chain_t *); +void unchain_cell(cell_t *); +void remove_pipe(cell_t *, unsigned long, cell_t *); +void update_path(cell_t *, cell_t *); +cell_t *next_cell(cell_t *, cell_t *); +void reset_color(color_t *); + +int grid_rotated, touching_allowed, (*touching[])(cell_t *) = { no_touching, touching_w, touching_n, touching_wn, touching_s, touching_ws, touching_ns, no_touching, touching_e, touching_we, touching_ne, no_touching, touching_se, no_touching, no_touching, no_touching }; +unsigned long colors_n, cols_n, rows_n, distance_min, solutions_max, nodes_n, solutions_n, stack_calls_n, stack_selections_n, stack_chains_n, stack_unrolls_n, stack_rolls_n, stack_unchains_n, (*set_options[])(cell_t *, option_t []) = { set_options_empty, set_options_w, set_options_n, set_options_wn, set_options_s, set_options_ws, set_options_ns, set_options_wns, set_options_e, set_options_we, set_options_ne, set_options_wne, set_options_se, set_options_wse, set_options_nse, set_options_wnse }, rolls_n, rolls_idx[LINKS_MAX]; +cell_t *cells, *cells_header, *cell_start, *cell_end; +color_t *colors; +call_t *stack_calls; +option_t *rolls[OPTIONS_MAX]; +selection_t *stack_selections; +chain_t *stack_chains, *stack_unchains; +unroll_t *stack_unrolls; +roll_t *stack_rolls; + +int main(void) { + unsigned long cells_n, row, col, attempts_n_mod; + cell_t *cell; + if (scanf("%lu%lu%lu", &colors_n, &cols_n, &rows_n) != 3 || colors_n < 1UL || cols_n < 1UL || rows_n < 1UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + grid_rotated = cols_n < rows_n; + if (grid_rotated) { + unsigned long tmp = cols_n; + cols_n = rows_n; + rows_n = tmp; + } + cells_n = cols_n*rows_n; + if (cells_n < 2UL || cells_n < colors_n*2UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + cells = malloc(sizeof(cell_t)*(cells_n+1UL)); + if (!cells) { + fprintf(stderr, "Could not allocate memory for cells\n"); + fflush(stderr); + return EXIT_FAILURE; + } + if (cols_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_S); + cell = cells+1UL; + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N); + } + else if (rows_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_E); + cell = cells+1UL; + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W); + } + else { + cell = cells; + set_cell(cell++, 0UL, 0UL, PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E); + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N); + } + cells_header = cell; + link_cell(cells, cells_header, cells+1UL); + for (cell = cells+1UL; cell < cells_header; cell++) { + link_cell(cell, cell-1UL, cell+1UL); + } + link_cell(cell, cell-1UL, cells); + colors = malloc(sizeof(color_t)*colors_n); + if (!colors) { + fprintf(stderr, "Could not allocate memory for colors\n"); + fflush(stderr); + free(cells); + return EXIT_FAILURE; + } + if (scanf("%d", &touching_allowed) == 1) { + unsigned long path_len; + if (colors_n <= rows_n) { + path_len = cols_n+rows_n-colors_n; + } + else { + path_len = cells_n/colors_n; + while (path_len > rows_n && path_len > cols_n-path_len+rows_n-colors_n+rows_n) { + path_len--; + } + } + if (scanf("%lu", &distance_min) != 1 || distance_min < 1UL || distance_min >= path_len || scanf("%lu%lu", &solutions_max, &attempts_n_mod) != 2 || solutions_max < 1UL || attempts_n_mod < 1UL) { + fprintf(stderr, "Invalid generator parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + } + else { + unsigned long i; + distance_min = 0UL; + solutions_max = ULONG_MAX; + attempts_n_mod = 1UL; + for (i = 0UL; i < colors_n; i++) { + if (!read_color(colors+i)) { + free(colors); + free(cells); + return EXIT_FAILURE; + } + } + } + stack_calls = malloc(sizeof(call_t)*(cells_n*CALLS_MAX+1UL)); + if (!stack_calls) { + fprintf(stderr, "Could not allocate memory for calls stack\n"); + fflush(stderr); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_selections = malloc(sizeof(selection_t)*(cells_n*(CHOICES_MAX-1UL)+1UL)); + if (!stack_selections) { + fprintf(stderr, "Could not allocate memory for selections stack\n"); + fflush(stderr); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_chains = malloc(sizeof(chain_t)*cells_n); + if (!stack_chains) { + fprintf(stderr, "Could not allocate memory for chains stack\n"); + fflush(stderr); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unrolls = malloc(sizeof(unroll_t)*cells_n*ROLLS_MAX); + if (!stack_unrolls) { + fprintf(stderr, "Could not allocate memory for unrolls stack\n"); + fflush(stderr); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_rolls = malloc(sizeof(roll_t)*cells_n*ROLLS_MAX); + if (!stack_rolls) { + fprintf(stderr, "Could not allocate memory for rolls stack\n"); + fflush(stderr); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unchains = malloc(sizeof(chain_t)*cells_n); + if (!stack_unchains) { + fprintf(stderr, "Could not allocate memory for unchains stack\n"); + fflush(stderr); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + if (distance_min > 0UL) { + unsigned long attempts_n; + srand((unsigned)time(NULL)); + attempts_n = 0UL; + do { + unsigned long i; + cell_start = cells; + cell_end = cell_start->next; + for (i = 0UL; i < colors_n && set_color(colors+i); i++); + if (i == colors_n) { + flowfree(); + } + for (; i > 0UL; i--) { + reset_color(colors+i-1UL); + } + attempts_n++; + if (attempts_n%attempts_n_mod == 0UL) { + printf("Attempts %lu\n", attempts_n); + fflush(stdout); + } + } + while (solutions_n == 0UL || solutions_n > solutions_max); + printf("\nNodes %lu\nSolutions %lu\nAttempts %lu\n", nodes_n, solutions_n, attempts_n); + fflush(stdout); + } + else { + touching_allowed = 0; + flowfree(); + printf("\nTouching forbidden\nNodes %lu\nSolutions %lu\n", nodes_n, solutions_n); + fflush(stdout); + if (solutions_n == 0UL) { + touching_allowed = 1; + flowfree(); + printf("\nTouching allowed\nNodes %lu\nSolutions %lu\n", nodes_n, solutions_n); + fflush(stdout); + } + } + free(stack_unchains); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_SUCCESS; +} + +void set_cell(cell_t *cell, unsigned long col, unsigned long row, unsigned long pipes) { + unsigned long i; + cell->col = col; + cell->row = row; + cell->pipes = pipes; + cell->path = cell; + cell->rank = 1UL; + cell->color = NULL; + cell->links_todo = LINKS_MAX; + cell->links_done = 0UL; + for (i = 0UL; i < LINKS_MAX; i++) { + cell->links[i] = NULL; + } +} + +void link_cell(cell_t *cell, cell_t *last, cell_t *next) { + cell->last = last; + cell->next = next; +} + +int read_color(color_t *color) { + color->start = read_cell(' '); + if (!color->start) { + fprintf(stderr, "Invalid start cell\n"); + fflush(stderr); + return 0; + } + if (color->start->color) { + fprintf(stderr, "Start cell color already set\n"); + fflush(stderr); + return 0; + } + color->end = read_cell('\n'); + if (!color->end) { + fprintf(stderr, "Invalid end cell\n"); + fflush(stderr); + return 0; + } + if (color->end->color) { + fprintf(stderr, "End cell color already set\n"); + fflush(stderr); + return 0; + } + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +cell_t *read_cell(int c) { + unsigned long x, y; + if (grid_rotated) { + if (scanf("(%lu, %lu)", &y, &x) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + else { + if (scanf("(%lu, %lu)", &x, &y) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + return cells+rows_n*x+y; +} + +int set_color(color_t *color) { + if (!search_color()) { + return 0; + } + unsigned long start_x, start_y, end_x, end_y; + do { + color->start = cells+random_xy(&start_x, &start_y); + color->end = cells+random_xy(&end_x, &end_y); + } + while (color->start == color->end || color->start->color || color->end->color || get_distance(start_x, start_y, end_x, end_y) < distance_min); + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +int search_color(void) { + if (!cell_start->color) { + for (; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + for (cell_start = cell_start->next; cell_start != cells_header; cell_start = cell_start->next) { + if (!cell_start->color) { + for (cell_end = cell_start->next; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + } + return 0; +} + +unsigned long random_xy(unsigned long *x, unsigned long *y) { + *x = erand(cols_n); + *y = erand(rows_n); + return *x*rows_n+*y; +} + +unsigned long erand(unsigned long values) { + return (unsigned long)(rand()/(RAND_MAX+1.0)*(double)values); +} + +unsigned long get_distance(unsigned long x1, unsigned long y1, unsigned long x2, unsigned long y2) { + if (x1 < x2) { + if (y1 < y2) { + return x2-x1+y2-y1; + } + return x2-x1+y1-y2; + } + if (y1 < y2) { + return x1-x2+y2-y1; + } + return x1-x2+y1-y2; +} + +void set_cell_color(cell_t *cell, color_t *color) { + cell->color = color; + cell->links_todo--; +} + +void flowfree(void) { + nodes_n = 0UL; + solutions_n = 0UL; + stack_calls_n = 0UL; + stack_selections_n = 0UL; + stack_chains_n = 0UL; + stack_unrolls_n = 0UL; + stack_rolls_n = 0UL; + stack_unchains_n = 0UL; + stack_selection(stack_selections+stack_selections_n, cells_header->next); + stack_call(stack_calls, CALL_SELECTION); + do { + stack_calls_n--; + perform_call(stack_calls+stack_calls_n); + } + while (stack_calls_n > 0UL); +} + +void stack_call(call_t *call, call_t type) { + *call = type; + stack_calls_n++; +} + +void perform_call(call_t *call) { + switch (*call) { + case CALL_SELECTION: + stack_selections_n--; + perform_selection(stack_selections+stack_selections_n); + break; + case CALL_CHAIN: + stack_chains_n--; + perform_chain(stack_chains+stack_chains_n); + break; + case CALL_UNROLL: + stack_unrolls_n--; + perform_unroll(stack_unrolls+stack_unrolls_n); + break; + case CALL_ROLL: + stack_rolls_n--; + perform_roll(stack_rolls+stack_rolls_n); + break; + case CALL_UNCHAIN: + stack_unchains_n--; + perform_unchain(stack_unchains+stack_unchains_n); + break; + } +} + +void stack_selection(selection_t *selection, cell_t *cell) { + selection->cell = cell; + stack_selections_n++; +} + +void perform_selection(selection_t *selection) { + nodes_n++; + if (cells_header->next != cells_header) { + if (solutions_n <= solutions_max) { + cell_t *cell_min = selection->cell, *cell; + constraint_t constraint_min; + set_constraint(cell_min, CHOICES_MAX, &constraint_min); + for (cell = cell_min->next; cell != selection->cell && constraint_min.choices_n > 1UL; cell = cell->next) { + constraint_t constraint; + if (cell == cells_header) { + continue; + } + if (cell->links_todo < cell_min->links_todo || (cell > cell_min && cell->links_todo == cell_min->links_todo)) { + set_constraint(cell, constraint_min.choices_n, &constraint); + if (constraint.choices_n < constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + if (constraint_min.choices_n < CHOICES_MAX) { + set_constraint(cell, constraint_min.choices_n+1, &constraint); + if (constraint.choices_n <= constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + set_constraint(cell, CHOICES_MAX, &constraint); + cell_min = cell; + constraint_min = constraint; + } + } + } + if (constraint_min.choices_n > 0UL) { + unsigned long i; + stack_chain(stack_chains+stack_chains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_CHAIN); + for (i = constraint_min.choices_n; i > 0UL; i--) { + unsigned long j; + for (j = 0UL; j < cell_min->links_todo; j++) { + stack_unroll(stack_unrolls+stack_unrolls_n, cell_min, &constraint_min.choices[i-1UL][j]); + stack_call(stack_calls+stack_calls_n, CALL_UNROLL); + } + if (constraint_min.choices_n == 1UL) { + if (cell_min->next != cells_header) { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + } + else { + if (cell_min != cells_header->next) { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + } + stack_call(stack_calls+stack_calls_n, CALL_SELECTION); + for (; j > 0UL; j--) { + stack_roll(stack_rolls+stack_rolls_n, cell_min, &constraint_min.choices[i-1UL][j-1UL]); + stack_call(stack_calls+stack_calls_n, CALL_ROLL); + } + } + stack_unchain(stack_unchains+stack_unchains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_UNCHAIN); + } + } + } + else { + solutions_n++; + if (solutions_n == 1UL) { + unsigned long i; + puts(""); + if (distance_min > 0UL) { + if (grid_rotated) { + printf("%lu %lu %lu\n", colors_n, rows_n, cols_n); + } + else { + printf("%lu %lu %lu\n", colors_n, cols_n, rows_n); + } + } + for (i = 0UL; i < colors_n; i++) { + print_color(colors+i); + } + } + else if (solutions_n > solutions_max) { + puts("\nToo many solutions"); + } + fflush(stdout); + } +} + +void set_constraint(cell_t *cell, unsigned long choices_max, constraint_t *constraint) { + constraint->options_n = set_options[cell->pipes](cell, constraint->options); + if (cell->links_todo > 0UL) { + unsigned long i; + rolls_n = 0UL; + for (i = 0UL; i < constraint->options_n; i++) { + add_roll_option(cell, constraint->options+i); + } + constraint->choices_n = 0UL; + if (rolls_n >= cell->links_todo) { + add_choices(cell, choices_max, 0UL, 0UL, 0UL, &constraint->choices_n, constraint->choices); + } + } + else { + constraint->choices_n = 1UL; + } +} + +unsigned long set_options_empty(cell_t *cell, option_t options[]) { + set_option(options, 0UL, cell); + return 0UL; +} + +unsigned long set_options_w(cell_t *cell, option_t options[]) { + set_option(options, PIPE_W, cell-rows_n); + return 1UL; +} + +unsigned long set_options_n(cell_t *cell, option_t options[]) { + set_option(options, PIPE_N, cell-1UL); + return 1UL; +} + +unsigned long set_options_wn(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_N, cell-1UL); + return 2UL; +} + +unsigned long set_options_s(cell_t *cell, option_t options[]) { + set_option(options, PIPE_S, cell+1UL); + return 1UL; +} + +unsigned long set_options_ws(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_ns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_wns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 3UL; +} + +unsigned long set_options_e(cell_t *cell, option_t options[]) { + set_option(options, PIPE_E, cell+rows_n); + return 1UL; +} + +unsigned long set_options_we(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_ne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_se(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_nse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_wnse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 4UL; +} + +void set_option(option_t *option, unsigned long pipe_used, cell_t *link) { + option->pipe_used = pipe_used; + option->link = link; +} + +void add_roll_option(cell_t *cell, option_t *option) { + if (option->link->links_todo > 0UL && roll_option(cell, option->link)) { + rolls[rolls_n++] = option; + } +} + +void add_choices(cell_t *cell, unsigned long choices_max, unsigned long step, unsigned long rolls_start, unsigned long pipes, unsigned long *choices_n, choice_t choices[][LINKS_MAX]) { + if (step < cell->links_todo) { + unsigned long i; + for (i = rolls_start; i < rolls_n && *choices_n < choices_max; i++) { + unsigned long j; + for (j = 0UL; j < step && roll_option(rolls[rolls_idx[j]]->link, rolls[i]->link); j++); + if (j == step) { + rolls_idx[step] = i; + add_choices(cell, choices_max, step+1UL, i+1UL, pipes+rolls[i]->pipe_used, choices_n, choices); + } + } + } + else { + if (touching_allowed || !touching[pipes](cell)) { + unsigned long i; + for (i = 0UL; i < cell->links_todo; i++) { + choices[*choices_n][i].link = rolls[rolls_idx[i]]->link; + } + *choices_n = *choices_n+1UL; + } + } +} + +int roll_option(cell_t *cell, cell_t *link) { + if (link->path == cell->path) { + return 0; + } + if (link->path->color && cell->path->color) { + return link->path->color == cell->path->color; + } + return 1; +} + +int no_touching(cell_t *cell) { + return cell == NULL; +} + +int touching_w(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell-rows_n, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell-rows_n, cell-rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_n(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell-1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell-1UL, cell+rows_n-1UL)) { + return 1; + } + } + return 0; +} + +int touching_wn(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell-1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_s(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ws(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + if (cell->row > 0UL && same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell+1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_ns(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell-1UL, cell-rows_n) || same_path(cell-1UL, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n-1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell-1UL, cell+rows_n) || same_path(cell-1UL, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n-1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + } + return 0; +} + +int touching_e(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell+rows_n, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_we(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell-rows_n, cell-1UL) || same_path(cell-rows_n, cell+rows_n-1UL) || same_path(cell+rows_n, cell-rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell-rows_n, cell+1UL) || same_path(cell-rows_n, cell+rows_n+1UL) || same_path(cell+rows_n, cell-rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ne(cell_t *cell) { + if (same_path(cell-1UL, cell+rows_n-1UL) || same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell+rows_n, cell+1UL)) { + return 1; + } + return 0; +} + +int touching_se(cell_t *cell) { + if (same_path(cell+rows_n, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (cell->row > 0UL && same_path(cell+rows_n, cell-1UL)) { + return 1; + } + return 0; +} + +int same_path(cell_t *cell_a, cell_t *cell_b) { + return cell_a->path == cell_b->path; +} + +void stack_chain(chain_t *chain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + chain->cell = cell; + chain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + chain->options[i] = options[i]; + } + stack_chains_n++; +} + +void stack_unroll(unroll_t *unroll, cell_t *cell, choice_t *choice) { + choice->unroll = unroll; + unroll->cell = cell; + unroll->link = choice->link; + stack_unrolls_n++; +} + +void stack_roll(roll_t *roll, cell_t *cell, choice_t *choice) { + roll->cell = cell; + roll->link = choice->link; + roll->unroll = choice->unroll; + stack_rolls_n++; +} + +void stack_unchain(chain_t *unchain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + unchain->cell = cell; + unchain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + unchain->options[i] = options[i]; + } + stack_unchains_n++; +} + +void print_color(color_t *color) { + if (distance_min > 0UL) { + print_cell(color->start, ' '); + print_cell(color->end, '\n'); + } + else { + cell_t *cell = color->start, *next = next_cell(cell, NULL); + print_cell(cell, ' '); + while (next != color->end) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + print_cell(cell, ' '); + } + print_cell(next, '\n'); + } +} + +void print_cell(cell_t *cell, int c) { + if (grid_rotated) { + printf("(%lu, %lu)", cell->row, cell->col); + } + else { + printf("(%lu, %lu)", cell->col, cell->row); + } + putchar(c); +} + +void perform_chain(chain_t *chain) { + unsigned long i; + for (i = 0UL; i < chain->options_n; i++) { + add_pipe(chain->cell, chain->options[i].pipe_used, chain->options[i].link); + } + chain_cell(chain->cell); +} + +void add_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + link->pipes += PIPE_E/pipe_used; + cell->pipes += pipe_used; +} + +void chain_cell(cell_t *cell) { + cell->last->next = cell; + cell->next->last = cell; +} + +void perform_unroll(unroll_t *unroll) { + unroll_link(unroll->cell, unroll->link, unroll->cell_path, unroll->cell_color, unroll->link_path, unroll->link_color); +} + +void unroll_link(cell_t *cell, cell_t *link, cell_t *cell_path, color_t *cell_color, cell_t *link_path, color_t *link_color) { + link->links[--link->links_done] = NULL; + link->links_todo++; + cell->links[--cell->links_done] = NULL; + cell->links_todo++; + if (cell_path->rank < link_path->rank) { + update_path(cell, cell_path); + link_path->rank -= cell_path->rank; + } + else { + update_path(link, link_path); + cell_path->rank -= link_path->rank; + } + if (cell_color) { + if (!link_color) { + link_path->color = NULL; + } + } + else { + if (link_color) { + cell_path->color = NULL; + } + } +} + +void perform_roll(roll_t *roll) { + roll_link(roll->cell, roll->link, roll->unroll); +} + +void roll_link(cell_t *cell, cell_t *link, unroll_t *unroll) { + unroll->cell_path = cell->path; + unroll->cell_color = cell->path->color; + unroll->link_path = link->path; + unroll->link_color = link->path->color; + if (cell->path->color) { + if (!link->path->color) { + link->path->color = cell->path->color; + } + } + else { + if (link->path->color) { + cell->path->color = link->path->color; + } + } + if (cell->path->rank < link->path->rank) { + link->path->rank += cell->path->rank; + update_path(cell, link->path); + } + else { + cell->path->rank += link->path->rank; + update_path(link, cell->path); + } + cell->links_todo--; + cell->links[cell->links_done++] = link; + link->links_todo--; + link->links[link->links_done++] = cell; +} + +void perform_unchain(chain_t *unchain) { + unsigned long i; + unchain_cell(unchain->cell); + for (i = 0UL; i < unchain->options_n; i++) { + remove_pipe(unchain->cell, unchain->options[i].pipe_used, unchain->options[i].link); + } +} + +void unchain_cell(cell_t *cell) { + cell->last->next = cell->next; + cell->next->last = cell->last; +} + +void remove_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + cell->pipes -= pipe_used; + link->pipes -= PIPE_E/pipe_used; +} + +void update_path(cell_t *start, cell_t *path) { + cell_t *cell = start, *next = next_cell(cell, NULL); + cell->path = path; + while (next) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + cell->path = path; + } +} + +cell_t *next_cell(cell_t *cell, cell_t *last) { + unsigned long i; + for (i = 0UL; i < cell->links_done && cell->links[i] == last; i++); + if (i < cell->links_done) { + return cell->links[i]; + } + return NULL; +} + +void reset_color(color_t *color) { + color->start->color = NULL; + color->start->links_todo++; + color->end->color = NULL; + color->end->links_todo++; +} diff --git a/submodules/flowfree/flowfree.make b/submodules/flowfree/flowfree.make new file mode 100644 index 0000000000000000000000000000000000000000..c547fc69746e2aef0231ade1cf39120736d228eb --- /dev/null +++ b/submodules/flowfree/flowfree.make @@ -0,0 +1,10 @@ +FLOWFREE_C_FLAGS=-c -O2 -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +flowfree: flowfree.o + gcc -o flowfree flowfree.o + +flowfree.o: flowfree.c flowfree.make + gcc ${FLOWFREE_C_FLAGS} -o flowfree.o flowfree.c + +clean: + rm -f flowfree flowfree.o diff --git a/submodules/flowfree/flowfree_CoT.c b/submodules/flowfree/flowfree_CoT.c new file mode 100644 index 0000000000000000000000000000000000000000..5e6ef8a09f3e329bc19f2be11acb7520d0b2ffbb --- /dev/null +++ b/submodules/flowfree/flowfree_CoT.c @@ -0,0 +1,1198 @@ +#include +#include +#include +#include + +#define LINKS_MAX 2UL +#define OPTIONS_MAX 4UL +#define CHOICES_MAX 3UL +#define PIPE_W 1UL +#define PIPE_N 2UL +#define PIPE_S 4UL +#define PIPE_E 8UL +#define CALLS_MAX 12UL +#define ROLLS_MAX 4UL + +typedef struct cell_s cell_t; +typedef struct color_s color_t; + +struct cell_s { + unsigned long col; + unsigned long row; + unsigned long pipes; + cell_t *path; + unsigned long rank; + color_t *color; + unsigned long links_todo; + unsigned long links_done; + cell_t *links[LINKS_MAX]; + cell_t *last; + cell_t *next; +}; + +struct color_s { + cell_t *start; + cell_t *end; +}; + +typedef enum { + CALL_SELECTION, + CALL_CHAIN, + CALL_UNROLL, + CALL_ROLL, + CALL_UNCHAIN +} +call_t; + +typedef struct { + unsigned long pipe_used; + cell_t *link; +} +option_t; + +typedef struct { + cell_t *cell; +} +selection_t; + +typedef struct { + cell_t *cell; + unsigned long options_n; + option_t options[OPTIONS_MAX]; +} +chain_t; + +typedef struct { + cell_t *cell; + cell_t *link; + cell_t *cell_path; + color_t *cell_color; + cell_t *link_path; + color_t *link_color; +} +unroll_t; + +typedef struct { + cell_t *cell; + cell_t *link; + unroll_t *unroll; +} +roll_t; + +typedef struct { + cell_t *link; + unroll_t *unroll; +} +choice_t; + +typedef struct { + unsigned long options_n; + option_t options[OPTIONS_MAX]; + unsigned long choices_n; + choice_t choices[CHOICES_MAX][LINKS_MAX]; +} +constraint_t; + +void set_cell(cell_t *, unsigned long, unsigned long, unsigned long); +void link_cell(cell_t *, cell_t *, cell_t *); +int read_color(color_t *); +cell_t *read_cell(int); +int set_color(color_t *); +int search_color(void); +unsigned long random_xy(unsigned long *, unsigned long *); +unsigned long erand(unsigned long); +unsigned long get_distance(unsigned long, unsigned long, unsigned long, unsigned long); +void set_cell_color(cell_t *, color_t *); +void flowfree(void); +void stack_call(call_t *, call_t); +void perform_call(call_t *); +void stack_selection(selection_t *, cell_t *); +void perform_selection(selection_t *); +void set_constraint(cell_t *, unsigned long, constraint_t *); +unsigned long set_options_empty(cell_t *, option_t []); +unsigned long set_options_w(cell_t *, option_t []); +unsigned long set_options_n(cell_t *, option_t []); +unsigned long set_options_wn(cell_t *, option_t []); +unsigned long set_options_s(cell_t *, option_t []); +unsigned long set_options_ws(cell_t *, option_t []); +unsigned long set_options_ns(cell_t *, option_t []); +unsigned long set_options_wns(cell_t *, option_t []); +unsigned long set_options_e(cell_t *, option_t []); +unsigned long set_options_we(cell_t *, option_t []); +unsigned long set_options_ne(cell_t *, option_t []); +unsigned long set_options_wne(cell_t *, option_t []); +unsigned long set_options_se(cell_t *, option_t []); +unsigned long set_options_wse(cell_t *, option_t []); +unsigned long set_options_nse(cell_t *, option_t []); +unsigned long set_options_wnse(cell_t *, option_t []); +void set_option(option_t *, unsigned long, cell_t *); +void add_roll_option(cell_t *, option_t *); +void add_choices(cell_t *, unsigned long, unsigned long, unsigned long, unsigned long, unsigned long *, choice_t [][LINKS_MAX]); +int roll_option(cell_t *, cell_t *); +int no_touching(cell_t *); +int touching_w(cell_t *); +int touching_n(cell_t *); +int touching_wn(cell_t *); +int touching_s(cell_t *); +int touching_ws(cell_t *); +int touching_ns(cell_t *); +int touching_e(cell_t *); +int touching_we(cell_t *); +int touching_ne(cell_t *); +int touching_se(cell_t *); +int same_path(cell_t *, cell_t *); +void stack_chain(chain_t *, cell_t *, unsigned long, option_t []); +void stack_unroll(unroll_t *, cell_t *, choice_t *); +void stack_roll(roll_t *, cell_t *, choice_t *); +void stack_unchain(chain_t *, cell_t *, unsigned long, option_t []); +void print_color(color_t *); +void print_cell(cell_t *, int); +void perform_chain(chain_t *); +void add_pipe(cell_t *, unsigned long, cell_t *); +void chain_cell(cell_t *); +void perform_unroll(unroll_t *); +void unroll_link(cell_t *, cell_t *, cell_t *, color_t *, cell_t *, color_t *); +void perform_roll(roll_t *); +void roll_link(cell_t *, cell_t *, unroll_t *); +void perform_unchain(chain_t *); +void unchain_cell(cell_t *); +void remove_pipe(cell_t *, unsigned long, cell_t *); +void update_path(cell_t *, cell_t *); +cell_t *next_cell(cell_t *, cell_t *); +void reset_color(color_t *); + +int grid_rotated, touching_allowed, (*touching[])(cell_t *) = { no_touching, touching_w, touching_n, touching_wn, touching_s, touching_ws, touching_ns, no_touching, touching_e, touching_we, touching_ne, no_touching, touching_se, no_touching, no_touching, no_touching }; +unsigned long colors_n, cols_n, rows_n, distance_min, solutions_max, nodes_n, solutions_n, stack_calls_n, stack_selections_n, stack_chains_n, stack_unrolls_n, stack_rolls_n, stack_unchains_n, (*set_options[])(cell_t *, option_t []) = { set_options_empty, set_options_w, set_options_n, set_options_wn, set_options_s, set_options_ws, set_options_ns, set_options_wns, set_options_e, set_options_we, set_options_ne, set_options_wne, set_options_se, set_options_wse, set_options_nse, set_options_wnse }, rolls_n, rolls_idx[LINKS_MAX]; +cell_t *cells, *cells_header, *cell_start, *cell_end; +color_t *colors; +call_t *stack_calls; +option_t *rolls[OPTIONS_MAX]; +selection_t *stack_selections; +chain_t *stack_chains, *stack_unchains; +unroll_t *stack_unrolls; +roll_t *stack_rolls; + +int main(void) { + unsigned long cells_n, row, col, attempts_n_mod; + cell_t *cell; + if (scanf("%lu%lu%lu", &colors_n, &cols_n, &rows_n) != 3 || colors_n < 1UL || cols_n < 1UL || rows_n < 1UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + grid_rotated = cols_n < rows_n; + if (grid_rotated) { + unsigned long tmp = cols_n; + cols_n = rows_n; + rows_n = tmp; + } + cells_n = cols_n*rows_n; + if (cells_n < 2UL || cells_n < colors_n*2UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + cells = malloc(sizeof(cell_t)*(cells_n+1UL)); + if (!cells) { + fprintf(stderr, "Could not allocate memory for cells\n"); + fflush(stderr); + return EXIT_FAILURE; + } + if (cols_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_S); + cell = cells+1UL; + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N); + } + else if (rows_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_E); + cell = cells+1UL; + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W); + } + else { + cell = cells; + set_cell(cell++, 0UL, 0UL, PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E); + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N); + } + cells_header = cell; + link_cell(cells, cells_header, cells+1UL); + for (cell = cells+1UL; cell < cells_header; cell++) { + link_cell(cell, cell-1UL, cell+1UL); + } + link_cell(cell, cell-1UL, cells); + colors = malloc(sizeof(color_t)*colors_n); + if (!colors) { + fprintf(stderr, "Could not allocate memory for colors\n"); + fflush(stderr); + free(cells); + return EXIT_FAILURE; + } + if (scanf("%d", &touching_allowed) == 1) { + unsigned long path_len; + if (colors_n <= rows_n) { + path_len = cols_n+rows_n-colors_n; + } + else { + path_len = cells_n/colors_n; + while (path_len > rows_n && path_len > cols_n-path_len+rows_n-colors_n+rows_n) { + path_len--; + } + } + if (scanf("%lu", &distance_min) != 1 || distance_min < 1UL || distance_min >= path_len || scanf("%lu%lu", &solutions_max, &attempts_n_mod) != 2 || solutions_max < 1UL || attempts_n_mod < 1UL) { + fprintf(stderr, "Invalid generator parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + } + else { + unsigned long i; + distance_min = 0UL; + solutions_max = ULONG_MAX; + attempts_n_mod = 1UL; + for (i = 0UL; i < colors_n; i++) { + if (!read_color(colors+i)) { + free(colors); + free(cells); + return EXIT_FAILURE; + } + } + } + stack_calls = malloc(sizeof(call_t)*(cells_n*CALLS_MAX+1UL)); + if (!stack_calls) { + fprintf(stderr, "Could not allocate memory for calls stack\n"); + fflush(stderr); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_selections = malloc(sizeof(selection_t)*(cells_n*(CHOICES_MAX-1UL)+1UL)); + if (!stack_selections) { + fprintf(stderr, "Could not allocate memory for selections stack\n"); + fflush(stderr); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_chains = malloc(sizeof(chain_t)*cells_n); + if (!stack_chains) { + fprintf(stderr, "Could not allocate memory for chains stack\n"); + fflush(stderr); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unrolls = malloc(sizeof(unroll_t)*cells_n*ROLLS_MAX); + if (!stack_unrolls) { + fprintf(stderr, "Could not allocate memory for unrolls stack\n"); + fflush(stderr); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_rolls = malloc(sizeof(roll_t)*cells_n*ROLLS_MAX); + if (!stack_rolls) { + fprintf(stderr, "Could not allocate memory for rolls stack\n"); + fflush(stderr); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unchains = malloc(sizeof(chain_t)*cells_n); + if (!stack_unchains) { + fprintf(stderr, "Could not allocate memory for unchains stack\n"); + fflush(stderr); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + if (distance_min > 0UL) { + unsigned long attempts_n; + srand((unsigned)time(NULL)); + attempts_n = 0UL; + do { + unsigned long i; + cell_start = cells; + cell_end = cell_start->next; + for (i = 0UL; i < colors_n && set_color(colors+i); i++); + if (i == colors_n) { + flowfree(); + } + for (; i > 0UL; i--) { + reset_color(colors+i-1UL); + } + attempts_n++; + if (attempts_n%attempts_n_mod == 0UL) { + printf("Attempts %lu\n", attempts_n); + fflush(stdout); + } + } + while (solutions_n == 0UL || solutions_n > solutions_max); + printf("\nNodes %lu\nSolutions %lu\nAttempts %lu\n", nodes_n, solutions_n, attempts_n); + fflush(stdout); + } + else { + touching_allowed = 0; + flowfree(); + printf("\nTouching forbidden\nNodes %lu\nSolutions %lu\n", nodes_n, solutions_n); + fflush(stdout); + if (solutions_n == 0UL) { + touching_allowed = 1; + flowfree(); + printf("\nTouching allowed\nNodes %lu\nSolutions %lu\n", nodes_n, solutions_n); + fflush(stdout); + } + } + free(stack_unchains); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_SUCCESS; +} + +void set_cell(cell_t *cell, unsigned long col, unsigned long row, unsigned long pipes) { + unsigned long i; + cell->col = col; + cell->row = row; + cell->pipes = pipes; + cell->path = cell; + cell->rank = 1UL; + cell->color = NULL; + cell->links_todo = LINKS_MAX; + cell->links_done = 0UL; + for (i = 0UL; i < LINKS_MAX; i++) { + cell->links[i] = NULL; + } +} + +void link_cell(cell_t *cell, cell_t *last, cell_t *next) { + cell->last = last; + cell->next = next; +} + +int read_color(color_t *color) { + color->start = read_cell(' '); + if (!color->start) { + fprintf(stderr, "Invalid start cell\n"); + fflush(stderr); + return 0; + } + if (color->start->color) { + fprintf(stderr, "Start cell color already set\n"); + fflush(stderr); + return 0; + } + color->end = read_cell('\n'); + if (!color->end) { + fprintf(stderr, "Invalid end cell\n"); + fflush(stderr); + return 0; + } + if (color->end->color) { + fprintf(stderr, "End cell color already set\n"); + fflush(stderr); + return 0; + } + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +cell_t *read_cell(int c) { + unsigned long x, y; + if (grid_rotated) { + if (scanf("(%lu, %lu)", &y, &x) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + else { + if (scanf("(%lu, %lu)", &x, &y) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + return cells+rows_n*x+y; +} + +int set_color(color_t *color) { + if (!search_color()) { + return 0; + } + unsigned long start_x, start_y, end_x, end_y; + do { + color->start = cells+random_xy(&start_x, &start_y); + color->end = cells+random_xy(&end_x, &end_y); + } + while (color->start == color->end || color->start->color || color->end->color || get_distance(start_x, start_y, end_x, end_y) < distance_min); + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +int search_color(void) { + if (!cell_start->color) { + for (; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + for (cell_start = cell_start->next; cell_start != cells_header; cell_start = cell_start->next) { + if (!cell_start->color) { + for (cell_end = cell_start->next; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + } + return 0; +} + +unsigned long random_xy(unsigned long *x, unsigned long *y) { + *x = erand(cols_n); + *y = erand(rows_n); + return *x*rows_n+*y; +} + +unsigned long erand(unsigned long values) { + return (unsigned long)(rand()/(RAND_MAX+1.0)*(double)values); +} + +unsigned long get_distance(unsigned long x1, unsigned long y1, unsigned long x2, unsigned long y2) { + if (x1 < x2) { + if (y1 < y2) { + return x2-x1+y2-y1; + } + return x2-x1+y1-y2; + } + if (y1 < y2) { + return x1-x2+y2-y1; + } + return x1-x2+y1-y2; +} + +void set_cell_color(cell_t *cell, color_t *color) { + cell->color = color; + cell->links_todo--; +} + +void flowfree(void) { + nodes_n = 0UL; + solutions_n = 0UL; + stack_calls_n = 0UL; + stack_selections_n = 0UL; + stack_chains_n = 0UL; + stack_unrolls_n = 0UL; + stack_rolls_n = 0UL; + stack_unchains_n = 0UL; + stack_selection(stack_selections+stack_selections_n, cells_header->next); + stack_call(stack_calls, CALL_SELECTION); + do { + stack_calls_n--; + perform_call(stack_calls+stack_calls_n); + } + while (stack_calls_n > 0UL); +} + +void stack_call(call_t *call, call_t type) { + *call = type; + stack_calls_n++; +} + +void perform_call(call_t *call) { + switch (*call) { + case CALL_SELECTION: + stack_selections_n--; + perform_selection(stack_selections+stack_selections_n); + break; + case CALL_CHAIN: + stack_chains_n--; + perform_chain(stack_chains+stack_chains_n); + break; + case CALL_UNROLL: + stack_unrolls_n--; + perform_unroll(stack_unrolls+stack_unrolls_n); + break; + case CALL_ROLL: + stack_rolls_n--; + perform_roll(stack_rolls+stack_rolls_n); + break; + case CALL_UNCHAIN: + stack_unchains_n--; + perform_unchain(stack_unchains+stack_unchains_n); + break; + } +} + +void stack_selection(selection_t *selection, cell_t *cell) { + selection->cell = cell; + stack_selections_n++; +} + +void perform_selection(selection_t *selection) { + nodes_n++; + if (cells_header->next != cells_header) { + if (solutions_n <= solutions_max) { + cell_t *cell_min = selection->cell, *cell; + constraint_t constraint_min; + set_constraint(cell_min, CHOICES_MAX, &constraint_min); + for (cell = cell_min->next; cell != selection->cell && constraint_min.choices_n > 1UL; cell = cell->next) { + constraint_t constraint; + if (cell == cells_header) { + continue; + } + if (cell->links_todo < cell_min->links_todo || (cell > cell_min && cell->links_todo == cell_min->links_todo)) { + set_constraint(cell, constraint_min.choices_n, &constraint); + if (constraint.choices_n < constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + if (constraint_min.choices_n < CHOICES_MAX) { + set_constraint(cell, constraint_min.choices_n+1, &constraint); + if (constraint.choices_n <= constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + set_constraint(cell, CHOICES_MAX, &constraint); + cell_min = cell; + constraint_min = constraint; + } + } + } + if (constraint_min.choices_n > 0UL) { + unsigned long i; + + // [CoT Extraction]: Log the situation before making a move + // We access cell_min->col and cell_min->row + printf("REASONING: Analyzing cell at (%lu, %lu). ", cell_min->col, cell_min->row); + printf("It requires %lu more connections. ", cell_min->links_todo); + printf("I found %lu valid options.\n", constraint_min.choices_n); + + stack_chain(stack_chains+stack_chains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_CHAIN); + for (i = constraint_min.choices_n; i > 0UL; i--) { + + // [CoT Extraction]: Log the specific hypothesis + // Note: We need to look at what 'constraint_min.choices[i-1UL]' points to + cell_t *target = constraint_min.choices[i-1UL][0].link; // Simplified access to first link + printf("HYPOTHESIS: I will try connecting (%lu, %lu) to neighbor at (%lu, %lu).\n", + cell_min->col, cell_min->row, + target->col, target->row); + + unsigned long j; + for (j = 0UL; j < cell_min->links_todo; j++) { + stack_unroll(stack_unrolls+stack_unrolls_n, cell_min, &constraint_min.choices[i-1UL][j]); + stack_call(stack_calls+stack_calls_n, CALL_UNROLL); + } + if (constraint_min.choices_n == 1UL) { + if (cell_min->next != cells_header) { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + } + else { + if (cell_min != cells_header->next) { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + } + stack_call(stack_calls+stack_calls_n, CALL_SELECTION); + for (; j > 0UL; j--) { + stack_roll(stack_rolls+stack_rolls_n, cell_min, &constraint_min.choices[i-1UL][j-1UL]); + stack_call(stack_calls+stack_calls_n, CALL_ROLL); + } + } + stack_unchain(stack_unchains+stack_unchains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_UNCHAIN); + } + } + } + else { + solutions_n++; + if (solutions_n == 1UL) { + unsigned long i; + puts(""); + if (distance_min > 0UL) { + if (grid_rotated) { + printf("%lu %lu %lu\n", colors_n, rows_n, cols_n); + } + else { + printf("%lu %lu %lu\n", colors_n, cols_n, rows_n); + } + } + for (i = 0UL; i < colors_n; i++) { + print_color(colors+i); + } + } + else if (solutions_n > solutions_max) { + puts("\nToo many solutions"); + } + fflush(stdout); + } +} + +void set_constraint(cell_t *cell, unsigned long choices_max, constraint_t *constraint) { + constraint->options_n = set_options[cell->pipes](cell, constraint->options); + if (cell->links_todo > 0UL) { + unsigned long i; + rolls_n = 0UL; + for (i = 0UL; i < constraint->options_n; i++) { + add_roll_option(cell, constraint->options+i); + } + constraint->choices_n = 0UL; + if (rolls_n >= cell->links_todo) { + add_choices(cell, choices_max, 0UL, 0UL, 0UL, &constraint->choices_n, constraint->choices); + } + } + else { + constraint->choices_n = 1UL; + } +} + +unsigned long set_options_empty(cell_t *cell, option_t options[]) { + set_option(options, 0UL, cell); + return 0UL; +} + +unsigned long set_options_w(cell_t *cell, option_t options[]) { + set_option(options, PIPE_W, cell-rows_n); + return 1UL; +} + +unsigned long set_options_n(cell_t *cell, option_t options[]) { + set_option(options, PIPE_N, cell-1UL); + return 1UL; +} + +unsigned long set_options_wn(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_N, cell-1UL); + return 2UL; +} + +unsigned long set_options_s(cell_t *cell, option_t options[]) { + set_option(options, PIPE_S, cell+1UL); + return 1UL; +} + +unsigned long set_options_ws(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_ns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_wns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 3UL; +} + +unsigned long set_options_e(cell_t *cell, option_t options[]) { + set_option(options, PIPE_E, cell+rows_n); + return 1UL; +} + +unsigned long set_options_we(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_ne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_se(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_nse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_wnse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 4UL; +} + +void set_option(option_t *option, unsigned long pipe_used, cell_t *link) { + option->pipe_used = pipe_used; + option->link = link; +} + +void add_roll_option(cell_t *cell, option_t *option) { + if (option->link->links_todo > 0UL && roll_option(cell, option->link)) { + rolls[rolls_n++] = option; + } +} + +void add_choices(cell_t *cell, unsigned long choices_max, unsigned long step, unsigned long rolls_start, unsigned long pipes, unsigned long *choices_n, choice_t choices[][LINKS_MAX]) { + if (step < cell->links_todo) { + unsigned long i; + for (i = rolls_start; i < rolls_n && *choices_n < choices_max; i++) { + unsigned long j; + for (j = 0UL; j < step && roll_option(rolls[rolls_idx[j]]->link, rolls[i]->link); j++); + if (j == step) { + rolls_idx[step] = i; + add_choices(cell, choices_max, step+1UL, i+1UL, pipes+rolls[i]->pipe_used, choices_n, choices); + } + } + } + else { + if (touching_allowed || !touching[pipes](cell)) { + unsigned long i; + for (i = 0UL; i < cell->links_todo; i++) { + choices[*choices_n][i].link = rolls[rolls_idx[i]]->link; + } + *choices_n = *choices_n+1UL; + } + } +} + +int roll_option(cell_t *cell, cell_t *link) { + if (link->path == cell->path) { + return 0; + } + if (link->path->color && cell->path->color) { + return link->path->color == cell->path->color; + } + return 1; +} + +int no_touching(cell_t *cell) { + return cell == NULL; +} + +int touching_w(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell-rows_n, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell-rows_n, cell-rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_n(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell-1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell-1UL, cell+rows_n-1UL)) { + return 1; + } + } + return 0; +} + +int touching_wn(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell-1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_s(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ws(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + if (cell->row > 0UL && same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell+1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_ns(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell-1UL, cell-rows_n) || same_path(cell-1UL, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n-1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell-1UL, cell+rows_n) || same_path(cell-1UL, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n-1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + } + return 0; +} + +int touching_e(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell+rows_n, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_we(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell-rows_n, cell-1UL) || same_path(cell-rows_n, cell+rows_n-1UL) || same_path(cell+rows_n, cell-rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell-rows_n, cell+1UL) || same_path(cell-rows_n, cell+rows_n+1UL) || same_path(cell+rows_n, cell-rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ne(cell_t *cell) { + if (same_path(cell-1UL, cell+rows_n-1UL) || same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell+rows_n, cell+1UL)) { + return 1; + } + return 0; +} + +int touching_se(cell_t *cell) { + if (same_path(cell+rows_n, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (cell->row > 0UL && same_path(cell+rows_n, cell-1UL)) { + return 1; + } + return 0; +} + +int same_path(cell_t *cell_a, cell_t *cell_b) { + return cell_a->path == cell_b->path; +} + +void stack_chain(chain_t *chain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + chain->cell = cell; + chain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + chain->options[i] = options[i]; + } + stack_chains_n++; +} + +void stack_unroll(unroll_t *unroll, cell_t *cell, choice_t *choice) { + choice->unroll = unroll; + unroll->cell = cell; + unroll->link = choice->link; + stack_unrolls_n++; +} + +void stack_roll(roll_t *roll, cell_t *cell, choice_t *choice) { + roll->cell = cell; + roll->link = choice->link; + roll->unroll = choice->unroll; + stack_rolls_n++; +} + +void stack_unchain(chain_t *unchain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + unchain->cell = cell; + unchain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + unchain->options[i] = options[i]; + } + stack_unchains_n++; +} + +void print_color(color_t *color) { + if (distance_min > 0UL) { + print_cell(color->start, ' '); + print_cell(color->end, '\n'); + } + else { + cell_t *cell = color->start, *next = next_cell(cell, NULL); + print_cell(cell, ' '); + while (next != color->end) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + print_cell(cell, ' '); + } + print_cell(next, '\n'); + } +} + +void print_cell(cell_t *cell, int c) { + if (grid_rotated) { + printf("(%lu, %lu)", cell->row, cell->col); + } + else { + printf("(%lu, %lu)", cell->col, cell->row); + } + putchar(c); +} + +void perform_chain(chain_t *chain) { + unsigned long i; + for (i = 0UL; i < chain->options_n; i++) { + add_pipe(chain->cell, chain->options[i].pipe_used, chain->options[i].link); + } + chain_cell(chain->cell); +} + +void add_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + link->pipes += PIPE_E/pipe_used; + cell->pipes += pipe_used; +} + +void chain_cell(cell_t *cell) { + cell->last->next = cell; + cell->next->last = cell; +} + +void perform_unroll(unroll_t *unroll) { + // [CoT Extraction]: Log the failure + printf("BACKTRACK: The previous path led to a dead end. Disconnecting (%lu, %lu) from (%lu, %lu) and trying the next option.\n", unroll->cell->col, unroll->cell->row, unroll->link->col, unroll->link->row); + unroll_link(unroll->cell, unroll->link, unroll->cell_path, unroll->cell_color, unroll->link_path, unroll->link_color); +} + +void unroll_link(cell_t *cell, cell_t *link, cell_t *cell_path, color_t *cell_color, cell_t *link_path, color_t *link_color) { + link->links[--link->links_done] = NULL; + link->links_todo++; + cell->links[--cell->links_done] = NULL; + cell->links_todo++; + if (cell_path->rank < link_path->rank) { + update_path(cell, cell_path); + link_path->rank -= cell_path->rank; + } + else { + update_path(link, link_path); + cell_path->rank -= link_path->rank; + } + if (cell_color) { + if (!link_color) { + link_path->color = NULL; + } + } + else { + if (link_color) { + cell_path->color = NULL; + } + } +} + +void perform_roll(roll_t *roll) { + roll_link(roll->cell, roll->link, roll->unroll); +} + +void roll_link(cell_t *cell, cell_t *link, unroll_t *unroll) { + unroll->cell_path = cell->path; + unroll->cell_color = cell->path->color; + unroll->link_path = link->path; + unroll->link_color = link->path->color; + + // [CoT Extraction]: Log the successful connection + printf("ACTION: Connected pipe between (%lu, %lu) and (%lu, %lu).\n", cell->col, cell->row, link->col, link->row); + + if (cell->path->color) { + if (!link->path->color) { + link->path->color = cell->path->color; + } + } + else { + if (link->path->color) { + cell->path->color = link->path->color; + } + } + if (cell->path->rank < link->path->rank) { + link->path->rank += cell->path->rank; + update_path(cell, link->path); + } + else { + cell->path->rank += link->path->rank; + update_path(link, cell->path); + } + cell->links_todo--; + cell->links[cell->links_done++] = link; + link->links_todo--; + link->links[link->links_done++] = cell; +} + +void perform_unchain(chain_t *unchain) { + unsigned long i; + unchain_cell(unchain->cell); + for (i = 0UL; i < unchain->options_n; i++) { + remove_pipe(unchain->cell, unchain->options[i].pipe_used, unchain->options[i].link); + } +} + +void unchain_cell(cell_t *cell) { + cell->last->next = cell->next; + cell->next->last = cell->last; +} + +void remove_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + cell->pipes -= pipe_used; + link->pipes -= PIPE_E/pipe_used; +} + +void update_path(cell_t *start, cell_t *path) { + cell_t *cell = start, *next = next_cell(cell, NULL); + cell->path = path; + while (next) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + cell->path = path; + } +} + +cell_t *next_cell(cell_t *cell, cell_t *last) { + unsigned long i; + for (i = 0UL; i < cell->links_done && cell->links[i] == last; i++); + if (i < cell->links_done) { + return cell->links[i]; + } + return NULL; +} + +void reset_color(color_t *color) { + color->start->color = NULL; + color->start->links_todo++; + color->end->color = NULL; + color->end->links_todo++; +} diff --git a/submodules/flowfree/flowfree_all_solutions.c b/submodules/flowfree/flowfree_all_solutions.c new file mode 100644 index 0000000000000000000000000000000000000000..2f10fb856d19856e45bd193cbc9dc50afb037ae3 --- /dev/null +++ b/submodules/flowfree/flowfree_all_solutions.c @@ -0,0 +1,1176 @@ +// In this we print all solutions, not just the first one +// ALSO very important, self-touching is never allowed according to +// original flowfree rules + +#include +#include +#include +#include + +#define LINKS_MAX 2UL +#define OPTIONS_MAX 4UL +#define CHOICES_MAX 3UL +#define PIPE_W 1UL +#define PIPE_N 2UL +#define PIPE_S 4UL +#define PIPE_E 8UL +#define CALLS_MAX 12UL +#define ROLLS_MAX 4UL + +typedef struct cell_s cell_t; +typedef struct color_s color_t; + +struct cell_s { + unsigned long col; + unsigned long row; + unsigned long pipes; + cell_t *path; + unsigned long rank; + color_t *color; + unsigned long links_todo; + unsigned long links_done; + cell_t *links[LINKS_MAX]; + cell_t *last; + cell_t *next; +}; + +struct color_s { + cell_t *start; + cell_t *end; +}; + +typedef enum { + CALL_SELECTION, + CALL_CHAIN, + CALL_UNROLL, + CALL_ROLL, + CALL_UNCHAIN +} +call_t; + +typedef struct { + unsigned long pipe_used; + cell_t *link; +} +option_t; + +typedef struct { + cell_t *cell; +} +selection_t; + +typedef struct { + cell_t *cell; + unsigned long options_n; + option_t options[OPTIONS_MAX]; +} +chain_t; + +typedef struct { + cell_t *cell; + cell_t *link; + cell_t *cell_path; + color_t *cell_color; + cell_t *link_path; + color_t *link_color; +} +unroll_t; + +typedef struct { + cell_t *cell; + cell_t *link; + unroll_t *unroll; +} +roll_t; + +typedef struct { + cell_t *link; + unroll_t *unroll; +} +choice_t; + +typedef struct { + unsigned long options_n; + option_t options[OPTIONS_MAX]; + unsigned long choices_n; + choice_t choices[CHOICES_MAX][LINKS_MAX]; +} +constraint_t; + +void set_cell(cell_t *, unsigned long, unsigned long, unsigned long); +void link_cell(cell_t *, cell_t *, cell_t *); +int read_color(color_t *); +cell_t *read_cell(int); +int set_color(color_t *); +int search_color(void); +unsigned long random_xy(unsigned long *, unsigned long *); +unsigned long erand(unsigned long); +unsigned long get_distance(unsigned long, unsigned long, unsigned long, unsigned long); +void set_cell_color(cell_t *, color_t *); +void flowfree(void); +void stack_call(call_t *, call_t); +void perform_call(call_t *); +void stack_selection(selection_t *, cell_t *); +void perform_selection(selection_t *); +void set_constraint(cell_t *, unsigned long, constraint_t *); +unsigned long set_options_empty(cell_t *, option_t []); +unsigned long set_options_w(cell_t *, option_t []); +unsigned long set_options_n(cell_t *, option_t []); +unsigned long set_options_wn(cell_t *, option_t []); +unsigned long set_options_s(cell_t *, option_t []); +unsigned long set_options_ws(cell_t *, option_t []); +unsigned long set_options_ns(cell_t *, option_t []); +unsigned long set_options_wns(cell_t *, option_t []); +unsigned long set_options_e(cell_t *, option_t []); +unsigned long set_options_we(cell_t *, option_t []); +unsigned long set_options_ne(cell_t *, option_t []); +unsigned long set_options_wne(cell_t *, option_t []); +unsigned long set_options_se(cell_t *, option_t []); +unsigned long set_options_wse(cell_t *, option_t []); +unsigned long set_options_nse(cell_t *, option_t []); +unsigned long set_options_wnse(cell_t *, option_t []); +void set_option(option_t *, unsigned long, cell_t *); +void add_roll_option(cell_t *, option_t *); +void add_choices(cell_t *, unsigned long, unsigned long, unsigned long, unsigned long, unsigned long *, choice_t [][LINKS_MAX]); +int roll_option(cell_t *, cell_t *); +int no_touching(cell_t *); +int touching_w(cell_t *); +int touching_n(cell_t *); +int touching_wn(cell_t *); +int touching_s(cell_t *); +int touching_ws(cell_t *); +int touching_ns(cell_t *); +int touching_e(cell_t *); +int touching_we(cell_t *); +int touching_ne(cell_t *); +int touching_se(cell_t *); +int same_path(cell_t *, cell_t *); +void stack_chain(chain_t *, cell_t *, unsigned long, option_t []); +void stack_unroll(unroll_t *, cell_t *, choice_t *); +void stack_roll(roll_t *, cell_t *, choice_t *); +void stack_unchain(chain_t *, cell_t *, unsigned long, option_t []); +void print_color(color_t *); +void print_cell(cell_t *, int); +void perform_chain(chain_t *); +void add_pipe(cell_t *, unsigned long, cell_t *); +void chain_cell(cell_t *); +void perform_unroll(unroll_t *); +void unroll_link(cell_t *, cell_t *, cell_t *, color_t *, cell_t *, color_t *); +void perform_roll(roll_t *); +void roll_link(cell_t *, cell_t *, unroll_t *); +void perform_unchain(chain_t *); +void unchain_cell(cell_t *); +void remove_pipe(cell_t *, unsigned long, cell_t *); +void update_path(cell_t *, cell_t *); +cell_t *next_cell(cell_t *, cell_t *); +void reset_color(color_t *); + +int grid_rotated, touching_allowed, (*touching[])(cell_t *) = { no_touching, touching_w, touching_n, touching_wn, touching_s, touching_ws, touching_ns, no_touching, touching_e, touching_we, touching_ne, no_touching, touching_se, no_touching, no_touching, no_touching }; +unsigned long colors_n, cols_n, rows_n, distance_min, solutions_max, nodes_n, solutions_n, stack_calls_n, stack_selections_n, stack_chains_n, stack_unrolls_n, stack_rolls_n, stack_unchains_n, (*set_options[])(cell_t *, option_t []) = { set_options_empty, set_options_w, set_options_n, set_options_wn, set_options_s, set_options_ws, set_options_ns, set_options_wns, set_options_e, set_options_we, set_options_ne, set_options_wne, set_options_se, set_options_wse, set_options_nse, set_options_wnse }, rolls_n, rolls_idx[LINKS_MAX]; +cell_t *cells, *cells_header, *cell_start, *cell_end; +color_t *colors; +call_t *stack_calls; +option_t *rolls[OPTIONS_MAX]; +selection_t *stack_selections; +chain_t *stack_chains, *stack_unchains; +unroll_t *stack_unrolls; +roll_t *stack_rolls; + +int main(void) { + unsigned long cells_n, row, col, attempts_n_mod; + cell_t *cell; + if (scanf("%lu%lu%lu", &colors_n, &cols_n, &rows_n) != 3 || colors_n < 1UL || cols_n < 1UL || rows_n < 1UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + grid_rotated = cols_n < rows_n; + if (grid_rotated) { + unsigned long tmp = cols_n; + cols_n = rows_n; + rows_n = tmp; + } + cells_n = cols_n*rows_n; + if (cells_n < 2UL || cells_n < colors_n*2UL) { + fprintf(stderr, "Invalid parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + cells = malloc(sizeof(cell_t)*(cells_n+1UL)); + if (!cells) { + fprintf(stderr, "Could not allocate memory for cells\n"); + fflush(stderr); + return EXIT_FAILURE; + } + if (cols_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_S); + cell = cells+1UL; + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N); + } + else if (rows_n == 1UL) { + set_cell(cells, 0UL, 0UL, PIPE_E); + cell = cells+1UL; + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W); + } + else { + cell = cells; + set_cell(cell++, 0UL, 0UL, PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, 0UL, row, PIPE_N+PIPE_E); + for (col = 1UL; col < cols_n-1UL; col++) { + set_cell(cell++, col, 0UL, PIPE_W+PIPE_E+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_E); + } + set_cell(cell++, col, 0UL, PIPE_W+PIPE_S); + for (row = 1UL; row < rows_n-1UL; row++) { + set_cell(cell++, col, row, PIPE_W+PIPE_N+PIPE_S); + } + set_cell(cell++, col, row, PIPE_W+PIPE_N); + } + cells_header = cell; + link_cell(cells, cells_header, cells+1UL); + for (cell = cells+1UL; cell < cells_header; cell++) { + link_cell(cell, cell-1UL, cell+1UL); + } + link_cell(cell, cell-1UL, cells); + colors = malloc(sizeof(color_t)*colors_n); + if (!colors) { + fprintf(stderr, "Could not allocate memory for colors\n"); + fflush(stderr); + free(cells); + return EXIT_FAILURE; + } + if (scanf("%d", &touching_allowed) == 1) { + unsigned long path_len; + if (colors_n <= rows_n) { + path_len = cols_n+rows_n-colors_n; + } + else { + path_len = cells_n/colors_n; + while (path_len > rows_n && path_len > cols_n-path_len+rows_n-colors_n+rows_n) { + path_len--; + } + } + if (scanf("%lu", &distance_min) != 1 || distance_min < 1UL || distance_min >= path_len || scanf("%lu%lu", &solutions_max, &attempts_n_mod) != 2 || solutions_max < 1UL || attempts_n_mod < 1UL) { + fprintf(stderr, "Invalid generator parameters\n"); + fflush(stderr); + return EXIT_FAILURE; + } + } + else { + unsigned long i; + distance_min = 0UL; + solutions_max = ULONG_MAX; + attempts_n_mod = 1UL; + for (i = 0UL; i < colors_n; i++) { + if (!read_color(colors+i)) { + free(colors); + free(cells); + return EXIT_FAILURE; + } + } + } + stack_calls = malloc(sizeof(call_t)*(cells_n*CALLS_MAX+1UL)); + if (!stack_calls) { + fprintf(stderr, "Could not allocate memory for calls stack\n"); + fflush(stderr); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_selections = malloc(sizeof(selection_t)*(cells_n*(CHOICES_MAX-1UL)+1UL)); + if (!stack_selections) { + fprintf(stderr, "Could not allocate memory for selections stack\n"); + fflush(stderr); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_chains = malloc(sizeof(chain_t)*cells_n); + if (!stack_chains) { + fprintf(stderr, "Could not allocate memory for chains stack\n"); + fflush(stderr); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unrolls = malloc(sizeof(unroll_t)*cells_n*ROLLS_MAX); + if (!stack_unrolls) { + fprintf(stderr, "Could not allocate memory for unrolls stack\n"); + fflush(stderr); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_rolls = malloc(sizeof(roll_t)*cells_n*ROLLS_MAX); + if (!stack_rolls) { + fprintf(stderr, "Could not allocate memory for rolls stack\n"); + fflush(stderr); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + stack_unchains = malloc(sizeof(chain_t)*cells_n); + if (!stack_unchains) { + fprintf(stderr, "Could not allocate memory for unchains stack\n"); + fflush(stderr); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_FAILURE; + } + if (distance_min > 0UL) { + unsigned long attempts_n; + srand((unsigned)time(NULL)); + attempts_n = 0UL; + do { + unsigned long i; + cell_start = cells; + cell_end = cell_start->next; + for (i = 0UL; i < colors_n && set_color(colors+i); i++); + if (i == colors_n) { + flowfree(); + } + for (; i > 0UL; i--) { + reset_color(colors+i-1UL); + } + attempts_n++; + if (attempts_n%attempts_n_mod == 0UL) { + printf("Attempts %lu\n", attempts_n); + fflush(stdout); + } + } + while (solutions_n == 0UL || solutions_n > solutions_max); + printf("\nNodes %lu\nSolutions %lu\nAttempts %lu\n", nodes_n, solutions_n, attempts_n); + fflush(stdout); + } + else { + touching_allowed = 0; + flowfree(); + printf("\nTouching forbidden\nNodes %lu\nSolutions %lu\n", nodes_n, solutions_n); + fflush(stdout); + } + free(stack_unchains); + free(stack_rolls); + free(stack_unrolls); + free(stack_chains); + free(stack_selections); + free(stack_calls); + free(colors); + free(cells); + return EXIT_SUCCESS; +} + +void set_cell(cell_t *cell, unsigned long col, unsigned long row, unsigned long pipes) { + unsigned long i; + cell->col = col; + cell->row = row; + cell->pipes = pipes; + cell->path = cell; + cell->rank = 1UL; + cell->color = NULL; + cell->links_todo = LINKS_MAX; + cell->links_done = 0UL; + for (i = 0UL; i < LINKS_MAX; i++) { + cell->links[i] = NULL; + } +} + +void link_cell(cell_t *cell, cell_t *last, cell_t *next) { + cell->last = last; + cell->next = next; +} + +int read_color(color_t *color) { + color->start = read_cell(' '); + if (!color->start) { + fprintf(stderr, "Invalid start cell\n"); + fflush(stderr); + return 0; + } + if (color->start->color) { + fprintf(stderr, "Start cell color already set\n"); + fflush(stderr); + return 0; + } + color->end = read_cell('\n'); + if (!color->end) { + fprintf(stderr, "Invalid end cell\n"); + fflush(stderr); + return 0; + } + if (color->end->color) { + fprintf(stderr, "End cell color already set\n"); + fflush(stderr); + return 0; + } + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +cell_t *read_cell(int c) { + unsigned long x, y; + if (grid_rotated) { + if (scanf("(%lu, %lu)", &y, &x) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + else { + if (scanf("(%lu, %lu)", &x, &y) != 2 || x > cols_n || y > rows_n || fgetc(stdin) != c) { + return NULL; + } + } + return cells+rows_n*x+y; +} + +int set_color(color_t *color) { + if (!search_color()) { + return 0; + } + unsigned long start_x, start_y, end_x, end_y; + do { + color->start = cells+random_xy(&start_x, &start_y); + color->end = cells+random_xy(&end_x, &end_y); + } + while (color->start == color->end || color->start->color || color->end->color || get_distance(start_x, start_y, end_x, end_y) < distance_min); + set_cell_color(color->start, color); + set_cell_color(color->end, color); + return 1; +} + +int search_color(void) { + if (!cell_start->color) { + for (; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + for (cell_start = cell_start->next; cell_start != cells_header; cell_start = cell_start->next) { + if (!cell_start->color) { + for (cell_end = cell_start->next; cell_end != cells_header; cell_end = cell_end->next) { + if (!cell_end->color && get_distance(cell_start->col, cell_start->row, cell_end->col, cell_end->row) >= distance_min) { + return 1; + } + } + } + } + return 0; +} + +unsigned long random_xy(unsigned long *x, unsigned long *y) { + *x = erand(cols_n); + *y = erand(rows_n); + return *x*rows_n+*y; +} + +unsigned long erand(unsigned long values) { + return (unsigned long)(rand()/(RAND_MAX+1.0)*(double)values); +} + +unsigned long get_distance(unsigned long x1, unsigned long y1, unsigned long x2, unsigned long y2) { + if (x1 < x2) { + if (y1 < y2) { + return x2-x1+y2-y1; + } + return x2-x1+y1-y2; + } + if (y1 < y2) { + return x1-x2+y2-y1; + } + return x1-x2+y1-y2; +} + +void set_cell_color(cell_t *cell, color_t *color) { + cell->color = color; + cell->links_todo--; +} + +void flowfree(void) { + nodes_n = 0UL; + solutions_n = 0UL; + stack_calls_n = 0UL; + stack_selections_n = 0UL; + stack_chains_n = 0UL; + stack_unrolls_n = 0UL; + stack_rolls_n = 0UL; + stack_unchains_n = 0UL; + stack_selection(stack_selections+stack_selections_n, cells_header->next); + stack_call(stack_calls, CALL_SELECTION); + do { + stack_calls_n--; + perform_call(stack_calls+stack_calls_n); + } + while (stack_calls_n > 0UL); +} + +void stack_call(call_t *call, call_t type) { + *call = type; + stack_calls_n++; +} + +void perform_call(call_t *call) { + switch (*call) { + case CALL_SELECTION: + stack_selections_n--; + perform_selection(stack_selections+stack_selections_n); + break; + case CALL_CHAIN: + stack_chains_n--; + perform_chain(stack_chains+stack_chains_n); + break; + case CALL_UNROLL: + stack_unrolls_n--; + perform_unroll(stack_unrolls+stack_unrolls_n); + break; + case CALL_ROLL: + stack_rolls_n--; + perform_roll(stack_rolls+stack_rolls_n); + break; + case CALL_UNCHAIN: + stack_unchains_n--; + perform_unchain(stack_unchains+stack_unchains_n); + break; + } +} + +void stack_selection(selection_t *selection, cell_t *cell) { + selection->cell = cell; + stack_selections_n++; +} + +void perform_selection(selection_t *selection) { + nodes_n++; + if (cells_header->next != cells_header) { + if (solutions_n <= solutions_max) { + cell_t *cell_min = selection->cell, *cell; + constraint_t constraint_min; + set_constraint(cell_min, CHOICES_MAX, &constraint_min); + for (cell = cell_min->next; cell != selection->cell && constraint_min.choices_n > 1UL; cell = cell->next) { + constraint_t constraint; + if (cell == cells_header) { + continue; + } + if (cell->links_todo < cell_min->links_todo || (cell > cell_min && cell->links_todo == cell_min->links_todo)) { + set_constraint(cell, constraint_min.choices_n, &constraint); + if (constraint.choices_n < constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + if (constraint_min.choices_n < CHOICES_MAX) { + set_constraint(cell, constraint_min.choices_n+1, &constraint); + if (constraint.choices_n <= constraint_min.choices_n) { + cell_min = cell; + constraint_min = constraint; + } + } + else { + set_constraint(cell, CHOICES_MAX, &constraint); + cell_min = cell; + constraint_min = constraint; + } + } + } + if (constraint_min.choices_n > 0UL) { + unsigned long i; + stack_chain(stack_chains+stack_chains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_CHAIN); + for (i = constraint_min.choices_n; i > 0UL; i--) { + unsigned long j; + for (j = 0UL; j < cell_min->links_todo; j++) { + stack_unroll(stack_unrolls+stack_unrolls_n, cell_min, &constraint_min.choices[i-1UL][j]); + stack_call(stack_calls+stack_calls_n, CALL_UNROLL); + } + if (constraint_min.choices_n == 1UL) { + if (cell_min->next != cells_header) { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + } + else { + if (cell_min != cells_header->next) { + stack_selection(stack_selections+stack_selections_n, cells_header->next); + } + else { + stack_selection(stack_selections+stack_selections_n, cell_min->next); + } + } + stack_call(stack_calls+stack_calls_n, CALL_SELECTION); + for (; j > 0UL; j--) { + stack_roll(stack_rolls+stack_rolls_n, cell_min, &constraint_min.choices[i-1UL][j-1UL]); + stack_call(stack_calls+stack_calls_n, CALL_ROLL); + } + } + stack_unchain(stack_unchains+stack_unchains_n, cell_min, constraint_min.options_n, constraint_min.options); + stack_call(stack_calls+stack_calls_n, CALL_UNCHAIN); + } + } + } + else { + solutions_n++; + if (solutions_n <= solutions_max) { + unsigned long i; + puts(""); + if (distance_min > 0UL) { + if (grid_rotated) { + printf("%lu %lu %lu\n", colors_n, rows_n, cols_n); + } + else { + printf("%lu %lu %lu\n", colors_n, cols_n, rows_n); + } + } + for (i = 0UL; i < colors_n; i++) { + print_color(colors+i); + } + } + else if (solutions_n > solutions_max) { + puts("\nToo many solutions"); + } + fflush(stdout); + } +} + +void set_constraint(cell_t *cell, unsigned long choices_max, constraint_t *constraint) { + constraint->options_n = set_options[cell->pipes](cell, constraint->options); + if (cell->links_todo > 0UL) { + unsigned long i; + rolls_n = 0UL; + for (i = 0UL; i < constraint->options_n; i++) { + add_roll_option(cell, constraint->options+i); + } + constraint->choices_n = 0UL; + if (rolls_n >= cell->links_todo) { + add_choices(cell, choices_max, 0UL, 0UL, 0UL, &constraint->choices_n, constraint->choices); + } + } + else { + constraint->choices_n = 1UL; + } +} + +unsigned long set_options_empty(cell_t *cell, option_t options[]) { + set_option(options, 0UL, cell); + return 0UL; +} + +unsigned long set_options_w(cell_t *cell, option_t options[]) { + set_option(options, PIPE_W, cell-rows_n); + return 1UL; +} + +unsigned long set_options_n(cell_t *cell, option_t options[]) { + set_option(options, PIPE_N, cell-1UL); + return 1UL; +} + +unsigned long set_options_wn(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_N, cell-1UL); + return 2UL; +} + +unsigned long set_options_s(cell_t *cell, option_t options[]) { + set_option(options, PIPE_S, cell+1UL); + return 1UL; +} + +unsigned long set_options_ws(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_ns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 2UL; +} + +unsigned long set_options_wns(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_S, cell+1UL); + return 3UL; +} + +unsigned long set_options_e(cell_t *cell, option_t options[]) { + set_option(options, PIPE_E, cell+rows_n); + return 1UL; +} + +unsigned long set_options_we(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_ne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wne(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_se(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 2UL; +} + +unsigned long set_options_wse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_nse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 3UL; +} + +unsigned long set_options_wnse(cell_t *cell, option_t options[]) { + set_option(options++, PIPE_W, cell-rows_n); + set_option(options++, PIPE_N, cell-1UL); + set_option(options++, PIPE_S, cell+1UL); + set_option(options, PIPE_E, cell+rows_n); + return 4UL; +} + +void set_option(option_t *option, unsigned long pipe_used, cell_t *link) { + option->pipe_used = pipe_used; + option->link = link; +} + +void add_roll_option(cell_t *cell, option_t *option) { + if (option->link->links_todo > 0UL && roll_option(cell, option->link)) { + rolls[rolls_n++] = option; + } +} + +void add_choices(cell_t *cell, unsigned long choices_max, unsigned long step, unsigned long rolls_start, unsigned long pipes, unsigned long *choices_n, choice_t choices[][LINKS_MAX]) { + if (step < cell->links_todo) { + unsigned long i; + for (i = rolls_start; i < rolls_n && *choices_n < choices_max; i++) { + unsigned long j; + for (j = 0UL; j < step && roll_option(rolls[rolls_idx[j]]->link, rolls[i]->link); j++); + if (j == step) { + rolls_idx[step] = i; + add_choices(cell, choices_max, step+1UL, i+1UL, pipes+rolls[i]->pipe_used, choices_n, choices); + } + } + } + else { + if (touching_allowed || !touching[pipes](cell)) { + unsigned long i; + for (i = 0UL; i < cell->links_todo; i++) { + choices[*choices_n][i].link = rolls[rolls_idx[i]]->link; + } + *choices_n = *choices_n+1UL; + } + } +} + +int roll_option(cell_t *cell, cell_t *link) { + if (link->path == cell->path) { + return 0; + } + if (link->path->color && cell->path->color) { + return link->path->color == cell->path->color; + } + return 1; +} + +int no_touching(cell_t *cell) { + return cell == NULL; +} + +int touching_w(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell-rows_n, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell-rows_n, cell-rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_n(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell-1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell-1UL, cell+rows_n-1UL)) { + return 1; + } + } + return 0; +} + +int touching_wn(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n-1UL) || same_path(cell-1UL, cell-rows_n-1UL)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell-rows_n, cell+1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell-1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_s(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (same_path(cell, cell-rows_n) && same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + if (same_path(cell, cell+rows_n) && same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ws(cell_t *cell) { + if (same_path(cell-rows_n, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n+1UL)) { + return 1; + } + if (cell->row > 0UL && same_path(cell-rows_n, cell-1UL)) { + return 1; + } + if (cell->col < cols_n-1UL && same_path(cell+1UL, cell+rows_n)) { + return 1; + } + return 0; +} + +int touching_ns(cell_t *cell) { + if (cell->col > 0UL) { + if (same_path(cell-1UL, cell-rows_n) || same_path(cell-1UL, cell-rows_n+1UL) || same_path(cell+1UL, cell-rows_n-1UL) || same_path(cell+1UL, cell-rows_n)) { + return 1; + } + } + if (cell->col < cols_n-1UL) { + if (same_path(cell-1UL, cell+rows_n) || same_path(cell-1UL, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n-1UL) || same_path(cell+1UL, cell+rows_n)) { + return 1; + } + } + return 0; +} + +int touching_e(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell, cell+rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + if (same_path(cell, cell-1UL) && same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell, cell+rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + if (same_path(cell, cell+1UL) && same_path(cell+rows_n, cell+rows_n+1UL)) { + return 1; + } + } + return 0; +} + +int touching_we(cell_t *cell) { + if (cell->row > 0UL) { + if (same_path(cell-rows_n, cell-1UL) || same_path(cell-rows_n, cell+rows_n-1UL) || same_path(cell+rows_n, cell-rows_n-1UL) || same_path(cell+rows_n, cell-1UL)) { + return 1; + } + } + if (cell->row < rows_n-1UL) { + if (same_path(cell-rows_n, cell+1UL) || same_path(cell-rows_n, cell+rows_n+1UL) || same_path(cell+rows_n, cell-rows_n+1UL) || same_path(cell+rows_n, cell+1UL)) { + return 1; + } + } + return 0; +} + +int touching_ne(cell_t *cell) { + if (same_path(cell-1UL, cell+rows_n-1UL) || same_path(cell+rows_n, cell+rows_n-1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell-1UL, cell-rows_n)) { + return 1; + } + if (cell->row < rows_n-1UL && same_path(cell+rows_n, cell+1UL)) { + return 1; + } + return 0; +} + +int touching_se(cell_t *cell) { + if (same_path(cell+rows_n, cell+rows_n+1UL) || same_path(cell+1UL, cell+rows_n+1UL)) { + return 1; + } + if (cell->col > 0UL && same_path(cell+1UL, cell-rows_n)) { + return 1; + } + if (cell->row > 0UL && same_path(cell+rows_n, cell-1UL)) { + return 1; + } + return 0; +} + +int same_path(cell_t *cell_a, cell_t *cell_b) { + return cell_a->path == cell_b->path; +} + +void stack_chain(chain_t *chain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + chain->cell = cell; + chain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + chain->options[i] = options[i]; + } + stack_chains_n++; +} + +void stack_unroll(unroll_t *unroll, cell_t *cell, choice_t *choice) { + choice->unroll = unroll; + unroll->cell = cell; + unroll->link = choice->link; + stack_unrolls_n++; +} + +void stack_roll(roll_t *roll, cell_t *cell, choice_t *choice) { + roll->cell = cell; + roll->link = choice->link; + roll->unroll = choice->unroll; + stack_rolls_n++; +} + +void stack_unchain(chain_t *unchain, cell_t *cell, unsigned long options_n, option_t options[]) { + unsigned long i; + unchain->cell = cell; + unchain->options_n = options_n; + for (i = 0UL; i < options_n; i++) { + unchain->options[i] = options[i]; + } + stack_unchains_n++; +} + +void print_color(color_t *color) { + if (distance_min > 0UL) { + print_cell(color->start, ' '); + print_cell(color->end, '\n'); + } + else { + cell_t *cell = color->start, *next = next_cell(cell, NULL); + print_cell(cell, ' '); + while (next != color->end) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + print_cell(cell, ' '); + } + print_cell(next, '\n'); + } +} + +void print_cell(cell_t *cell, int c) { + if (grid_rotated) { + printf("(%lu, %lu)", cell->row, cell->col); + } + else { + printf("(%lu, %lu)", cell->col, cell->row); + } + putchar(c); +} + +void perform_chain(chain_t *chain) { + unsigned long i; + for (i = 0UL; i < chain->options_n; i++) { + add_pipe(chain->cell, chain->options[i].pipe_used, chain->options[i].link); + } + chain_cell(chain->cell); +} + +void add_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + link->pipes += PIPE_E/pipe_used; + cell->pipes += pipe_used; +} + +void chain_cell(cell_t *cell) { + cell->last->next = cell; + cell->next->last = cell; +} + +void perform_unroll(unroll_t *unroll) { + unroll_link(unroll->cell, unroll->link, unroll->cell_path, unroll->cell_color, unroll->link_path, unroll->link_color); +} + +void unroll_link(cell_t *cell, cell_t *link, cell_t *cell_path, color_t *cell_color, cell_t *link_path, color_t *link_color) { + link->links[--link->links_done] = NULL; + link->links_todo++; + cell->links[--cell->links_done] = NULL; + cell->links_todo++; + if (cell_path->rank < link_path->rank) { + update_path(cell, cell_path); + link_path->rank -= cell_path->rank; + } + else { + update_path(link, link_path); + cell_path->rank -= link_path->rank; + } + if (cell_color) { + if (!link_color) { + link_path->color = NULL; + } + } + else { + if (link_color) { + cell_path->color = NULL; + } + } +} + +void perform_roll(roll_t *roll) { + roll_link(roll->cell, roll->link, roll->unroll); +} + +void roll_link(cell_t *cell, cell_t *link, unroll_t *unroll) { + unroll->cell_path = cell->path; + unroll->cell_color = cell->path->color; + unroll->link_path = link->path; + unroll->link_color = link->path->color; + if (cell->path->color) { + if (!link->path->color) { + link->path->color = cell->path->color; + } + } + else { + if (link->path->color) { + cell->path->color = link->path->color; + } + } + if (cell->path->rank < link->path->rank) { + link->path->rank += cell->path->rank; + update_path(cell, link->path); + } + else { + cell->path->rank += link->path->rank; + update_path(link, cell->path); + } + cell->links_todo--; + cell->links[cell->links_done++] = link; + link->links_todo--; + link->links[link->links_done++] = cell; +} + +void perform_unchain(chain_t *unchain) { + unsigned long i; + unchain_cell(unchain->cell); + for (i = 0UL; i < unchain->options_n; i++) { + remove_pipe(unchain->cell, unchain->options[i].pipe_used, unchain->options[i].link); + } +} + +void unchain_cell(cell_t *cell) { + cell->last->next = cell->next; + cell->next->last = cell->last; +} + +void remove_pipe(cell_t *cell, unsigned long pipe_used, cell_t *link) { + cell->pipes -= pipe_used; + link->pipes -= PIPE_E/pipe_used; +} + +void update_path(cell_t *start, cell_t *path) { + cell_t *cell = start, *next = next_cell(cell, NULL); + cell->path = path; + while (next) { + cell_t *last = cell; + cell = next; + next = next_cell(cell, last); + cell->path = path; + } +} + +cell_t *next_cell(cell_t *cell, cell_t *last) { + unsigned long i; + for (i = 0UL; i < cell->links_done && cell->links[i] == last; i++); + if (i < cell->links_done) { + return cell->links[i]; + } + return NULL; +} + +void reset_color(color_t *color) { + color->start->color = NULL; + color->start->links_todo++; + color->end->color = NULL; + color->end->links_todo++; +} + diff --git a/submodules/flowfree/flowfree_debug.make b/submodules/flowfree/flowfree_debug.make new file mode 100644 index 0000000000000000000000000000000000000000..9ff4512651a99867c0c94511f059aa50ca88e2dc --- /dev/null +++ b/submodules/flowfree/flowfree_debug.make @@ -0,0 +1,10 @@ +FLOWFREE_DEBUG_C_FLAGS=-g -c -Wall -Wextra -Waggregate-return -Wcast-align -Wcast-qual -Wconversion -Wformat=2 -Winline -Wlong-long -Wmissing-prototypes -Wmissing-declarations -Wnested-externs -Wno-import -Wpointer-arith -Wredundant-decls -Wshadow -Wstrict-prototypes -Wwrite-strings + +flowfree_debug: flowfree_debug.o + gcc -g -o flowfree_debug flowfree_debug.o + +flowfree_debug.o: flowfree.c flowfree_debug.make + gcc ${FLOWFREE_DEBUG_C_FLAGS} -o flowfree_debug.o flowfree.c + +clean: + rm -f flowfree_debug flowfree_debug.o diff --git a/submodules/flowfree/flowfree_problems_solutions.csv b/submodules/flowfree/flowfree_problems_solutions.csv new file mode 100644 index 0000000000000000000000000000000000000000..336607903459a6260a0e415332aff37bd639a359 --- /dev/null +++ b/submodules/flowfree/flowfree_problems_solutions.csv @@ -0,0 +1,5184 @@ +path,problem,solution,grid_size,num_colors +9x9_8c_5_2af3ded9.txt,"....F.... +.B.F..E.A +.....C... +.....G... +.D.GH..C. +.....B... +..E.H...D +......... +.A.......","AAAFFAAAA +ABAFAAEEA +ABAAACCEE +ABBGGGCCE +ADBGHHHCE +ADBBBBHEE +ADEEHHHED +ADDEEEEED +AADDDDDDD",9x9,8 +9x9_9c_10_f029a480.txt,".....E... +....I..D. +..G...B.. +..F.F.... +......D.. +..CE...A. +.C...HB.. +...I..H.. +A.......G","EEEEEEGGG +EIIIIGGDG +EIGGGGBDG +EIFFFBBDG +EIIIIBDDG +ECCEIBBAG +ECEEIHBAG +EEEIIHHAG +AAAAAAAAG",9x9,9 +8x8_8c_10_83d92d01.txt,"D...H... +..E..DC. +........ +..A....H +.C...... +..GB.... +F..E..GA +....F..B","DDDDHHHH +EEEDDDCH +ECCCCCCH +ECAAAAAH +ECGGGGAA +EEGBBGGA +FEEEBBGA +FFFFFBBB",8x8,8 +6x6_4c_7_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_5c_4_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_4c_2_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_3c_5_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_5c_1_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +7x7_7c_9_d249fa1f.txt,"......G +G....FD +...A... +C...... +..C.... +AE..FE. +B.B...D","GGGGGGG +GCCCCFD +CCAACFD +CAACCFD +AACCFFD +AEEEFED +BBBEEED",7x7,7 +5x5_5c_3_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_6c_7_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +7x7_6c_1_21b01e0e.txt,"...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE","AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE",7x7,6 +6x6_4c_4_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +9x9_8c_1_306fbd00.txt,".....B... +H......G. +..A.....B +....F..GD +E......H. +...E..... +.DF...A.. +....C..C. +.........","HHHHHBBBB +HEEEHHHGB +EEAEEEHGB +EAAFFEHGD +EAFFEEHHD +AAFEEDDDD +ADFDDDAAA +ADDDCCCCA +AAAAAAAAA",9x9,8 +5x5_5c_4_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +9x9_7c_4_207aef04.txt,"E......G. +B........ +.F..A.D.. +...B..... +......... +...C..D.. +......... +...E...C. +.F..AG...","EEEEEEEGG +BBBBBBEEG +FFAAABDEG +FAABBBDEG +FAEEEEDEG +FAECCEDEG +FAEECEEEG +FAAECCCCG +FFAAAGGGG",9x9,7 +7x7_7c_4_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +6x6_4c_9_7e2f1ba3.txt,"D..... +..A.A. +...... +....BC +.D..C. +.....B","DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB",6x6,4 +5x5_4c_1_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +7x7_6c_3_ad1343f0.txt,"AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +.......","ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE",7x7,6 +7x7_5c_9_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +5x5_5c_2_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_7_96ca9115.txt,"F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C","FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC",7x7,7 +7x7_7c_2_782c2792.txt,"....... +....ED. +B.G.... +..AFG.. +E...D.. +A....C. +F..C.B.","BBBBBBB +BEEEEDB +BEGGGDB +EEAFGDB +EAAFDDB +AAFFCCB +FFFCCBB",7x7,7 +7x7_5c_3_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +6x6_4c_3_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_6c_3_d5cc36f7.txt,"B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +.......","BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB",7x7,6 +7x7_5c_5_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +9x9_7c_9_a6b69ac4.txt,"...C..... +.G..D.... +....E.FD. +.......F. +....E.AC. +.......B. +.......G. +......... +..AB.....","AAACCCCCC +AGADDDDDC +AGADEDFDC +AGADEDFFC +AGADEDACC +AGADDDABB +AGAAAAAGB +AGGGGGGGB +AAABBBBBB",9x9,7 +8x8_6c_4_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +5x5_3c_8_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_7c_1_172e1fee.txt,"...GA... +......E. +.B.....A +.E.F.... +......C. +FG...B.. +....C... +D.D.....","GGGGAAAA +GBBBBBEA +GBEEEBEA +GEEFEBEE +GGFFEBCE +FGFEEBCE +FFFECCCE +DDDEEEEE",8x8,7 +7x7_5c_1_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +9x9_9c_6_a4b5019b.txt,"...AB...C +...H..... +..I....EB +....C.... +.......G. +......... +..GF.FI.. +.H......E +.AD.....D","AAAABCCCC +AHHHBCBBB +AHIBBCBEB +AHIBCCBEE +AHIBBBBGE +AHIIIIIGE +AHGFFFIGE +AHGGGGGGE +AADDDDDDD",9x9,9 +6x6_4c_10_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_5c_2_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +8x8_6c_9_fc59c90b.txt,"D....... +.E...... +.FA..C.. +........ +...B.... +......F. +..CBA.E. +D.......","DEEEEEEE +DEAAAAAE +DFACCCAE +DFCCAAAE +DFCBAEEE +DFCBAEFF +DFCBAEEF +DFFFFFFF",8x8,6 +5x5_5c_2_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +9x9_7c_6_d4cb8ca8.txt,"...G....A +.B......C +..DE..... +......... +......G.. +....E...C +F.B...ADF +......... +.........","DDDGGGGAA +DBDDDDGAC +DBDEEDGAC +DBDDEDGAC +DBBDEDGAC +DDBDEDAAC +FDBDDDADF +FDDDDDDDF +FFFFFFFFF",9x9,7 +6x6_4c_6_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_4c_8_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_5c_2_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +8x8_6c_3_cade0083.txt,"A.BC.... +..E...E. +........ +...C.... +...F..D. +........ +.BA....F +.......D","ABBCCCCC +ABEEEEEC +ABDDDDDC +ABDCCCDC +ABDFFCDC +ABDDFCCC +ABADFFFF +AAADDDDD",8x8,6 +7x7_6c_9_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +7x7_5c_5_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_4c_7_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_3c_7_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +6x6_5c_6_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +6x6_5c_7_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_7c_5_297ba08d.txt,"......... +......... +......B.. +C.......C +..B.A.... +..E.F.... +..A...D.. +.....D... +...G.EF.G","CCCCCCCCC +CGGGGGGGC +CGBBBBBGC +CGBFFFFGC +GGBFAAFGG +GEEFFAFFG +GEAAAADFG +GEEEEDDFG +GGGGEEFFG",9x9,7 +5x5_4c_2_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_6c_2_9769657e.txt,"........ +.B..D.F. +....CD.. +..A..... +A.C.E... +........ +BF...... +E.......","AAAEEEEE +ABAEDDFE +ABAECDFE +ABAECCFE +ABCEECFE +BBCCCCFE +BFFFFFFE +EEEEEEEE",8x8,6 +8x8_8c_3_c81e3705.txt,"HFD..D.E +.......A +.F....C. +.....G.. +.......B +..CE.AH. +....G... +......B.","HFDDDDEE +HFEEEEEA +HFECCCCA +HEECGGAA +HECCGAAB +HECEGAHB +HEEEGHHB +HHHHHHBB",8x8,8 +9x9_7c_1_e28dfc75.txt,"......GDB +.F..FA... +......... +..C...... +....D.B.. +..C...... +...G..... +.E.....EA +.........","AAAAAAGDB +AFFFFAGDB +AGGGGGGDB +AGCBBBBDB +AGCBDDBDB +AGCBBDDDB +AGGGBBBBB +AEEEEEEEA +AAAAAAAAA",9x9,7 +7x7_7c_8_63dec1fa.txt,"F....AE +....... +.A.GF.. +.C..... +.....C. +.B...B. +GD...DE","FFFFFAE +GGGGFAE +GAAGFAE +GCAAAAE +GCCCCCE +GBBBBBE +GDDDDDE",7x7,7 +6x6_6c_6_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +7x7_6c_4_ad1343f0.txt,"AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +.......","ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE",7x7,6 +5x5_5c_8_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_5c_5_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_6c_10_7f24b2e8.txt,".E...... +.A.BFC.. +.B...E.. +....F... +........ +.D.AC... +......D. +........","EEAAAAAA +EAABFCCA +EBBBFECA +EEEEFECA +AAAEEECA +ADAACCCA +ADDDDDDA +AAAAAAAA",8x8,6 +7x7_5c_6_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +7x7_5c_4_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_2_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_9_7e442b1b.txt,"...FA.. +.DC.B.. +..G.EB. +....... +..GFE.C +....DA. +.......","CCCFAAA +CDCFBBA +CDGFEBA +CDGFEAA +CDGFEAC +CDDDDAC +CCCCCCC",7x7,7 +7x7_5c_6_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_3_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_2_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +5x5_5c_7_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +7x7_5c_3_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_7c_4_f29c58ac.txt,"D.BE..E +..FAG.. +....C.. +....G.. +.B..... +.DF..C. +A......","DBBEEEE +DBFAGGG +DBFACCG +DBFAGCG +DBFAGCG +DDFAGCG +AAAAGGG",7x7,7 +5x5_3c_8_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +9x9_9c_9_e082bc41.txt,"......HGA +.BC..D... +.....F... +......... +.B.....G. +.......IA +..E.H.D.C +...F..I.. +.E.......","EEEEHHHGA +EBCEHDDGA +EBCEHFDGA +EBCEHFDGA +EBCEHFDGA +ECCEHFDIA +ECEEHFDIC +ECCFFFIIC +EECCCCCCC",9x9,9 +7x7_5c_2_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +8x8_6c_5_edf4c497.txt,"CE...... +........ +.C.BD... +.B.AF... +........ +.A...... +.F.D.... +.......E","CEEEEEEE +CCCCCCCE +CCBBDDCE +CBBAFDCE +CAAAFDCE +CAFFFDCE +CFFDDDCE +CCCCCCCE",8x8,6 +9x9_7c_4_b67fe4d3.txt,"...A....E +A....G... +......... +.B.E...D. +...F..... +.......G. +.B....D.. +....F...C +C........","AAAADDDDE +ADDDDGGDE +DDDDDDGDE +DBDEEDGDE +DBDFEDGGE +DBDFEDDGE +DBDFEEDEE +DDDFFEEEC +CCCCCCCCC",9x9,7 +6x6_6c_10_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_1_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +9x9_8c_1_55c4888b.txt,"C........ +.......G. +.....H.C. +..F..D.E. +.......H. +.FB...... +.......A. +.B...D..A +......G.E","CCCCCCCCC +GGGGGGGGC +GBBBBHHCC +GBFFBDHEE +GBBFBDHHE +GFBFBDEEE +GFFFBDEAA +GBBBBDEEA +GGGGGGGEE",9x9,8 +8x8_7c_5_0118fd6b.txt,"........ +B....... +........ +....A.F. +F.A..... +E.G..D.C +...GD... +....EB.C","BBBBBBBB +BFFFFFFB +FFGGGGFB +FGGAAGFB +FGAAGGBB +EGGGGDBC +EGGGDDBC +EEEEEBBC",8x8,7 +6x6_6c_9_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +10x10_9c_3_30461201.txt,"E........E +..H...A... +....G...F. +.......... +...IG..... +.A........ +.....C.DB. +.......... +.FIH....C. +........BD","EEEEEEEEEE +HHHAAAAGGG +HAAAGGGGFG +HAFFFFFFFG +HAFIGGGGGG +HAFIBBBDDD +HFFIBCBDBD +HFIIBCBBBD +HFIHBCCCCD +HHHHBBBBBD",10x10,9 +7x7_6c_7_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +6x6_5c_2_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +5x5_3c_2_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_7c_5_8c30c948.txt,".E....B +.A.FA.G +....F.. +.D..... +.....C. +..B.CE. +D.....G","EEAAABB +EAAFABG +EEEFFBG +DDEBBBG +DEEBCCG +DEBBCEG +DEEEEEG",7x7,7 +5x5_3c_7_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +10x10_9c_7_d35070f8.txt,"CB.......D +......I..B +..F.....D. +.E.A...... +.H.F...... +........G. +...EI..... +....AH.... +.......... +.......GC.","CBBBBBBBDD +CEEEEEIBDB +CEFFFEIBDB +CEAAFEIBBB +CHAFFEICCC +CHAEEEICGC +CHAEIIICGC +CHAAAHCCGC +CHHHHHCGGC +CCCCCCCGCC",10x10,9 +5x5_4c_6_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_4c_3_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +9x9_8c_2_f539b23a.txt,"G.BH..... +..C...... +..B...EA. +......AD. +F........ +......... +..C.E.... +......... +.F..GD.H.","GBBHHHHHH +GBCCAAAAH +GBBCAEEAH +GGCCAEADH +FGCAAEADH +FGCAEEADH +FGCAEAADH +FGGAAADDH +FFGGGDDHH",9x9,8 +5x5_5c_10_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_8c_10_f24df32a.txt,".AH..... +......B. +.BF..F.. +.CG....D +....C... +..G..... +E..A.... +..EH.D..","AAHHHHHH +ABBBBBBH +ABFFFFHH +ACGGGGHD +ACCCCGHD +AAGGGGHD +EAAAHHHD +EEEHHDDD",8x8,8 +6x6_6c_5_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_8c_6_3e7403c4.txt,"...E...ED +FG....... +.......BF +...D.B... +G.A...... +......... +.CHC..A.. +....H.... +.........","FFFEEEEED +FGFDDDDDD +GGFDAAABF +GFFDABABF +GFAAABABF +FFHHHBABF +FCHCHBABF +FCCCHBBBF +FFFFFFFFF",9x9,8 +5x5_3c_5_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_7c_1_a599e0e6.txt,"....EA..A +......... +..B.C..D. +......... +E.B.F.... +G.....G.. +..F...... +D........ +.....C...","EEEEEAAAA +EFFFFFCCC +EFBCCFCDC +EFBCFFCDC +EFBCFCCDC +GFFCCCGDC +GGFGGGGDC +DGGGDDDDC +DDDDDCCCC",9x9,7 +8x8_7c_8_12000403.txt,"..CA.... +.A....D. +.EF..... +..G.E..B +....CD.. +..G..... +......B. +.......F","CCCAFFFF +CAAAFDDF +CEFFFDFF +CEGEEDFB +CEGECDFB +CEGECFFB +CEEECFBB +CCCCCFFF",8x8,7 +8x8_6c_7_1786c3a8.txt,"........ +..F..E.D +C....D.. +A....... +....E... +........ +..CF..B. +A...B...","CCCCDDDD +CFFCDEED +CFCCDDEE +AFCBBBBE +AFCBEEBE +AFCBBEBE +AFCFBEBE +AFFFBEEE",8x8,6 +10x10_9c_2_e3905cd9.txt,"E..E..G... +........A. +.CB...I... +..C..H..D. +..G......F +.......... +.......... +.......I.. +..HFDA.... +B.........","EEEEGGGFFF +GGGGGFFFAF +GCBBFFIAAF +GCCBFHIADF +GGGBFHIADF +BBBBFHIADD +BFFFFHIAAD +BFHHHHIIAD +BFHFDAAAAD +BFFFDDDDDD",10x10,9 +5x5_3c_9_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +8x8_6c_10_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +5x5_3c_3_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_6c_9_4b7bece2.txt,"........ +.E....E. +CA....B. +...B.... +.F.D.... +..C..A.. +..FD.... +........","CCCCCCCC +CEEEEEEC +CAAAAABC +CCCBBABC +CFCDBABC +CFCDBABC +CFFDBBBC +CCCCCCCC",8x8,6 +7x7_7c_6_ec4e7a56.txt,"..F.EA. +.....F. +.....B. +.E.C... +....BD. +GC..D.A +......G","FFFEEAA +FEEEFFA +FEFFFBA +FEFCBBA +FFFCBDA +GCCCDDA +GGGGGGG",7x7,7 +6x6_5c_9_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_5c_7_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_4c_5_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_8_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +10x10_9c_6_0f9bfafe.txt,"....G..... +.C......D. +........A. +I.D.A...B. +.......... +..B..F.F.. +IC........ +...H...H.. +.E..E..... +......G...","DDDDGGGGGG +DCCDDDDDDG +DDCCAAAAAG +IDDCABBBBG +ICCCBBFFFG +ICBBBFFFFG +ICFFFFFFFG +FFFHHHHHFG +FEEEEFFFFG +FFFFFFGGGG",10x10,9 +10x10_9c_6_86268115.txt,"...A...... +FI........ +D......C.. +..I...E... +H....C.G.. +.D.G...A.F +.B.E...... +.......... +........H. +.........B","FFFAAAAAAA +FIFFGGGGGA +DIIFGCCCGA +DDIFGCEGGA +HDFFGCEGAA +HDFGGEEAAF +HBFEEEFFFF +HBFFFFFBBB +HBBBBBBBHB +HHHHHHHHHB",10x10,9 +5x5_3c_4_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +5x5_4c_4_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_3c_10_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_6c_1_6ec3c337.txt,"...E... +.B..... +..D.... +..A..F. +..B..C. +.A..D.. +FC....E","FFFEEEE +FBFFFFE +FBDDDFE +FBAADFE +FBBADCE +FAAADCE +FCCCCCE",7x7,6 +7x7_7c_10_077103b2.txt,"..CD... +.E..... +CD...E. +G...... +..F...B +.A...A. +...G.FB","CCCDDDD +CEEEEED +CDDDDED +GAAADDD +GAFAAAB +GAFFFAB +GGGGFFB",7x7,7 +8x8_7c_4_a3784e4f.txt,"FA...... +.G...... +.....B.. +.....D.. +...F.... +.B..C..A +.C..EDGE +........","FAAAAAAA +FGGGGGGA +FBBBBBGA +FBCCCDGA +FBCFCDGA +FBCFCDGA +FCCFEDGE +FFFFEEEE",8x8,7 +7x7_7c_10_0d9589a3.txt,"..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G","EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG",7x7,7 +5x5_5c_7_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_3_9baf1145.txt,"..C...D +..G.F.. +..A...D +......C +..GFA.. +E...... +.EB...B","CCCAAAD +CGGAFAD +CGAAFAD +CGGFFAC +CCGFAAC +ECCCCCC +EEBBBBB",7x7,7 +5x5_4c_5_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_8c_2_b69f748c.txt,"...H..... +H........ +F.A..BD.. +..B..D..E +..E...G.. +.....G.C. +..A..C... +........F +.........","HHHHEEEEE +HEEEEBBBE +FEAAABDBE +FEBBADDBE +FEEBAGGBB +FBBBAGCCB +FBAAACCBB +FBBBBBBBF +FFFFFFFFF",9x9,8 +7x7_7c_1_9dd2760b.txt,"....... +DBEA... +C.....D +.....AC +..GB.E. +.G..... +...F..F","DDDDDDD +DBEAAAD +CBEEEAD +CBBBEAC +CGGBEEC +CGCCCCC +CCCFFFF",7x7,7 +8x8_8c_2_5eb06022.txt,"H....... +..F...FE +..D....D +H.E....C +....C... +.G.GA.A. +........ +B......B","HEEEEEEE +HEFFFFFE +HEDDDDDD +HEEAAAAC +AAAACCAC +AGGGACAC +AAAAACCC +BBBBBBBB",8x8,8 +8x8_8c_7_ea280416.txt,"F....... +......HG +C.E..... +D....... +..CF.B.. +.......H +.EB....A +DG..A...","FFFFFGGG +CCCCFGHG +CEECFGHH +DECCFGGH +DECFFBGH +DEBBBBGH +DEBGGGGA +DGGGAAAA",8x8,8 +6x6_4c_10_7e2f1ba3.txt,"D..... +..A.A. +...... +....BC +.D..C. +.....B","DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB",6x6,4 +9x9_8c_7_a0a086d4.txt,"...A..... +A......E. +......F.. +.E.C..B.. +......... +...F.C... +.HD..B... +...H..... +.....G.GD","AAAADDDDD +ADDDDEEED +DDEEEEFFD +DEECCCBFD +DDDDDCBFD +FFFFDCBFD +FHDDDBBFD +FHHHFFFFD +FFFFFGGGD",9x9,8 +8x8_7c_6_3ff2d94a.txt,".....C.B +....BF.. +..D..... +.F..DC.. +........ +...E..EG +.A...... +G......A","BBBBBCCB +BFFFBFCB +BFDFFFCB +BFDDDCCB +BBBBBBBB +GGGEEEEG +GAGGGGGG +GAAAAAAA",8x8,7 +9x9_7c_3_999b887c.txt,"......... +.A..D..D. +..E...... +F........ +....C.... +.F..E.BA. +GB.....G. +......... +........C","AAAAAAAAA +AAAADDDDA +AAEAAAAAA +FAEECCCCC +FAAECAAAC +FFAEEABAC +GBAAAABGC +GBBBBBBGC +GGGGGGGGC",9x9,7 +6x6_6c_3_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +6x6_6c_6_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_8_4aae6c86.txt,"E.EFG.D +....F.. +.C..G.. +..ADB.. +....A.. +...CB.. +.......","EEEFGGD +DDDFFGD +DCDDGGD +DCADBBD +DCAAABD +DCCCBBD +DDDDDDD",7x7,7 +10x10_9c_8_c7fe0b9d.txt,"......I... +.CHG....E. +.......E.. +.....A.... +....A.BH.. +.......... +.......B.. +........F. +...DG..... +ICF......D","IIIIIIIGGG +ICHGGGGGEG +ICHBBBBEEG +ICHBAABBBG +ICHBABBHBG +ICHBBBHHBG +ICHHHHHBBG +ICFFFFFFFG +ICFDGGGGGG +ICFDDDDDDD",10x10,9 +5x5_4c_10_707b086f.txt,"D.... +C.... +B.... +.ABC. +AD...","DDDDD +CCCCD +BBBCD +AABCD +ADDDD",5x5,4 +6x6_6c_4_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +10x10_9c_5_28224532.txt,"......C... +.HD.....E. +..I..FA..D +.......... +.....B.... +..I....G.. +..GF...... +.....HC..E +.......... +........BA","CCCCCCCDDD +CHDDDDDDED +CHIFFFAAED +CHIFGGGAEE +CHIFGBGAAE +CHIFGBGGAE +CHGFGBBBAE +CHGGGHCBAE +CHHHHHCBAA +CCCCCCCBBA",10x10,9 +8x8_7c_10_a2d578a8.txt,"C......G +.......D +.G..EA.. +.ED..... +....BF.. +........ +........ +CFBA....","CGGGGGGG +CGDDDDDD +CGDEEAAA +CEDEBBBA +CEEEBFBA +CFFFFFBA +CFBBBBBA +CFBAAAAA",8x8,7 +9x9_7c_10_b9baf331.txt,"......... +.A....... +..GEFE... +.......F. +.C..D.... +......... +B.....DC. +GB....... +...A.....","GGGEEEEEE +GAGEFFFFE +GAGEFEEFE +GAAAAAEFE +GCCCDAEEE +GGGCDAAAA +BBGCDDDCA +GBGCCCCCA +GGGAAAAAA",9x9,7 +9x9_9c_2_cb24bd37.txt,"......... +.G....D.. +.B..F.... +.....I.D. +A...IG.A. +.FB...... +.H.HE.... +.C.C..... +.....E...","FFFFFEEEE +FGGGFEDDE +FBBGFEEDE +FFBGIIEDE +AFBGIGEAE +AFBGGGEAE +AHHHEEEAE +ACCCAAAAE +AAAAAEEEE",9x9,9 +8x8_6c_8_8b279246.txt,"......BC +.D.B.... +...A.... +..F...E. +.....A.. +...C.E.. +.D...... +.......F","FFFBBBBC +FDFBCCCC +FDFACAAA +FDFACAEA +FDAACAEA +FDACCEEA +FDAAAAAA +FFFFFFFF",8x8,6 +7x7_7c_3_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +6x6_4c_4_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +8x8_6c_6_fbde3bc8.txt,"DC...... +........ +.....B.. +AF.B.... +F..A.... +C.....D. +E....... +.......E","DCCCCCCC +DDDDDDDC +AAAAABDC +AFBBABDC +FFBAABDC +CCBBBBDC +ECCCCCCC +EEEEEEEE",8x8,6 +9x9_9c_5_a571c118.txt,".....D... +....B..E. +.....GF.. +.B.C..... +.......EG +.FH..H..I +.....I..A +..C...... +D.......A","DDDDDDGGG +DBBBBGGEG +DBFFFGFEG +DBFCFFFEG +DFFCCCCEG +DFHHHHCII +DIIIIICIA +DICCCCCIA +DIIIIIIIA",9x9,9 +6x6_6c_2_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +8x8_7c_1_826ba2c7.txt,"D...B... +..GD..F. +.....E.. +.....CE. +...CB... +........ +.F.A..A. +.G......","DDDDBBBB +GGGDFFFB +GFFFFEEB +GFCCCCEB +GFCCBBBB +GFCCCCCC +GFCAAAAC +GGCCCCCC",8x8,7 +6x6_4c_3_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_4c_1_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +8x8_7c_10_db102e74.txt,"....BE.E +.FC..... +........ +......F. +........ +.D.A.G.. +...B.... +GD.AC...","BBBBBEEE +BFCCCCCC +BFFFFFFC +BBBBBBFC +GGGGGBBC +GDAAGGBC +GDABBBBC +GDAACCCC",8x8,7 +5x5_3c_4_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +5x5_5c_10_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_5c_9_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_4c_7_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_6c_5_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +9x9_9c_10_b1d5c5be.txt,"..BH..... +......... +..F...... +B......A. +GID..A... +...C....H +.DI..C.FE +.......E. +........G","BBBHHHHHH +BAAAAAAAH +BAFFFFFAH +BAAAAAFAH +GIDDDAFFH +GIICDDDFH +GDICCCDFE +GDDDDDDEE +GGGGGGGGG",9x9,9 +8x8_8c_5_eba37cd0.txt,"D....... +........ +GB....G. +B.E.F.E. +........ +.CA..H.. +....C..D +...FH..A","DDDDDDDD +GGGGGGGD +GBEEEEGD +BBEFFEED +FFFFAAAD +FCAAAHAD +FCCCCHAD +FFFFHHAA",8x8,8 +5x5_4c_6_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_6c_6_13c2982c.txt,"........ +.D...A.. +..DC.... +B.F..FA. +..E..... +..C..... +......B. +E.......","CCCCFFFF +CDDCFAAF +CCDCFFAF +BCFFFFAF +BCEEFFFF +BCCEEEEE +BBBBBBBE +EEEEEEEE",8x8,6 +9x9_8c_3_21bd5b1f.txt,"..HCE..FE +.G....... +.H......D +.....F..A +.B....... +...D..... +.....B... +......C.. +..G.....A","HHHCEFFFE +HGGCEFEEE +HHGCEFEDD +GGGCEFEDA +GBCCEEEDA +GBCDDDDDA +GBCCCBBBA +GBBBCCCBA +GGGBBBBBA",9x9,8 +6x6_6c_6_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_9c_1_1956903b.txt,"......... +.C..B..E. +..BF..H.. +FC....... +...H..... +E.G...... +..D...AI. +.A....... +GI....D..","FFFFFFHHH +FCBBBFHEH +FCBFFFHEH +FCEEEEEEH +EEEHHHHHH +EGGDDDDDD +GGDDAAAID +GAAAAIIID +GIIIIIDDD",9x9,9 +6x6_6c_8_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +5x5_3c_4_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_8c_2_a7f0c08f.txt,"......BH +.E..H... +A.....B. +C..EG.F. +..A..... +........ +..CD..F. +D...G...","AAABBBBH +AEABHHHH +AEABBBBB +CEAEGBFB +CEAEGBFB +CEEEGBFB +CCCDGBFB +DDDDGBBB",8x8,8 +6x6_6c_7_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_6c_4_5f121b29.txt,"........ +......B. +.....C.. +.....A.E +F...D... +E.C.A.F. +....B.D. +........","FFFFFFFF +FBBBBBBF +FBCCCCFF +FBCAAAFE +FBCADDFE +EBCAADFE +EBBBBDDE +EEEEEEEE",8x8,6 +5x5_5c_6_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +7x7_5c_4_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_7c_2_d3be7e23.txt,".C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF..","CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF",7x7,7 +6x6_4c_4_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_4_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +6x6_5c_8_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_9c_5_7e0506bb.txt,"FI....... +.E....... +...GA.... +.....G... +...D...B. +.....DA.. +..C....IB +..E..C... +....FH..H","FIIIIIIII +FEBBBBBBI +FEBGAAABI +FEBGGGABI +FEBDDDABI +FEBBBDAII +FECCBBBIB +FEECCCBBB +FFFFFHHHH",9x9,9 +8x8_7c_7_d86e8aab.txt,".D..FE.. +......A. +..A..... +...F.GCB +.E...... +......C. +.GB..... +.......D","DDFFFEEE +DFFAAAAE +DFAAEEEE +DFFFEGCB +DEEEEGCB +DGGGGGCB +DGBBBBBB +DDDDDDDD",8x8,7 +8x8_6c_6_176705c4.txt,"........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C","CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC",8x8,6 +7x7_7c_1_d3be7e23.txt,".C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF..","CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF",7x7,7 +6x6_4c_3_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +5x5_3c_10_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +10x10_10c_1_f58fcbac.txt,"H......... +..J..F.H.. +.......C.. +.DJDG.F... +.......... +.......G.. +BE.......C +......B... +.A..AI..E. +.........I","HDDDCCCCCC +HDJDCFFHHC +HDJDCCFCHC +HDJDGCFCHC +HHHHGCCCHC +BBBHGGGGHC +BEBHHHHHHC +EEBBBBBIII +EAAAAIIIEI +EEEEEEEEEI",10x10,10 +5x5_5c_6_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +9x9_9c_6_dd9b1f9e.txt,"......... +....H.... +..D...H.. +......... +EI....I.. +BF.C...DE +..FG....A +C...B.G.. +........A","EEEEEEEEE +EHHHHDDDE +EHDDDDHDE +EHHHHHHDE +EIIIIIIDE +BFFCCCCDE +BBFGGGCCA +CBBBBGGCA +CCCCCCCCA",9x9,9 +5x5_5c_5_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +6x6_5c_8_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +5x5_3c_9_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +5x5_5c_5_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_4_331bf87b.txt,"......E +.GAEF.F +....... +.CBG.D. +....... +.CB.D.. +....A..","AAAEEEE +AGAEFFF +AGGGAAA +ACBGADA +ACBAADA +ACBADDA +AAAAAAA",7x7,7 +7x7_6c_10_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +10x10_10c_1_a63c6afb.txt,"..B......E +.......... +........C. +.E.GC..... +.......BG. +F.......J. +......D..H +.D.J..I.A. +.......... +F......IHA","BBBEEEEEEE +BEEEJJJJJJ +BEJJJCCCCJ +BEJGCCGGGJ +BBJGGGGBGJ +FBJJBBBBJJ +FBBJBDDHHH +FDBJBDIHAA +FDBBBDIHHA +FDDDDDIIHA",10x10,10 +9x9_9c_9_503c7f99.txt,"...B..... +EH..A...A +....F.G.. +H......G. +......... +...D...CI +..D...... +....CBF.. +..E.....I","EEEBAAAAA +EHEBAFFFA +HHEBFFGFF +HEEBBBGGF +EECCCBFFF +ECCDCBFCI +ECDDCBFCI +ECCCCBFCI +EEECCCCCI",9x9,9 +5x5_5c_9_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_5c_4_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +9x9_8c_6_08c857eb.txt,"B........ +H.....F.. +......GF. +H..D..... +G.A.E.... +........B +.C....E.D +...C..A.. +.........","BBBBBBBBB +HGGGGGFFB +HGAAAGGFB +HGADAAAAB +GGADEEEAB +GGGDDDEAB +GCGGGDEAD +GCCCGDAAD +GGGGGDDDD",9x9,8 +8x8_7c_9_aad8ae11.txt,"...A.... +...DFE.. +..B..... +....G... +...C...F +A..G.... +EDC...B. +........","AAAAFFFF +ADDDFEEF +ADBBBBEF +ADGGGBEF +ADGCCBEF +ADGGCBEE +EDCCCBBE +EEEEEEEE",8x8,7 +5x5_3c_7_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_7c_5_d4345423.txt,"........ +.C...... +..AF.D.. +....DG.. +........ +F.E..... +G.BEB.C. +......A.","AAAAAAAA +ACCCCCCA +AAAFDDCA +FFFFDGCA +FBBBBGCA +FBEEBGCA +GBBEBGCA +GGGGGGAA",8x8,7 +5x5_3c_8_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +8x8_8c_1_67d5ba9e.txt,".....HGD +..FB.... +..H..G.. +B.D....F +A....... +.EC..... +....E.A. +......C.","BBBBHHGD +BFFBHGGD +BFHHHGDD +BFDDDDDF +AFFFFFFF +AECCCCCC +AEEEEAAC +AAAAAACC",8x8,8 +6x6_5c_10_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +8x8_7c_2_50f367b4.txt,".C....AG +.A.E.... +..F.DB.. +D......G +...BE... +......F. +.C...... +........","CCAAAAAG +CAAEDDDG +CCFEDBDG +DCFEEBDG +DCFBEBDD +DCFBBBFD +DCFFFFFD +DDDDDDDD",8x8,7 +6x6_4c_10_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +6x6_6c_3_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +5x5_3c_6_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_7c_2_a92aa206.txt,"FG..... +...FDEG +D...... +B.....E +A...A.C +....... +BC.....","FGGGGGG +FFFFDEG +DDDDDEE +BBBBBBE +AAAAABC +BBBBBBC +BCCCCCC",7x7,7 +8x8_6c_1_14765f5e.txt,"........ +.F.....C +.B.F.E.. +........ +D...A.E. +..B..... +...C..DA +........","CCCCCCCC +CFFFDDDC +CBBFDEDD +CCBDDEED +DCBDAAED +DCBDDADD +DCCCDADA +DDDDDAAA",8x8,6 +6x6_4c_6_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_5c_3_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_5c_10_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_8c_6_86c5e3a0.txt,".EF...AH +.G.CF... +...A...B +.....C.. +........ +E...DG.. +..H..... +DB......","EEFFFAAH +EGCCFAHH +EGCAAAHB +EGCCCCHB +EGGGGGHB +EDDDDGHB +DDHHHHHB +DBBBBBBB",8x8,8 +10x10_9c_9_61ffb2de.txt,".F...B.... +.A.H.H.I.. +.......... +F.......I. +...DAD...C +.G.....E.. +...B....G. +.......... +.......... +.....EC...","FFBBBBCCCC +FABHHHCIIC +FABBBBCCIC +FAAAABBCIC +EEEDADBCCC +EGEDDDBECC +EGEBBBBEGC +EGEEEEEEGC +EGGGGGGGGC +EEEEEECCCC",10x10,9 +6x6_6c_10_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +5x5_4c_8_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_9c_3_bb39e0a5.txt,"C.GD..... +H......A. +..G.D.... +H........ +B..I....I +...F.BE.. +...A...E. +....C..F. +.........","CCGDDDDDD +HCGAAAAAD +HCGADDDDD +HCAAIIIII +BCAIIBBBI +BCAFFBEBB +BCAAFFEEB +BCCCCFFFB +BBBBBBBBB",9x9,9 +9x9_8c_5_e51c3380.txt,"C......F. +.E...H... +...G.AHE. +..G....B. +......... +.C.A...D. +B........ +F.....D.. +.........","CEEEEEEFF +CEHHHHEEF +CHHGAAHEF +CHGGAHHBF +CHHAAHBBF +CCHAHHBDF +BBHHHBBDF +FBBBBBDDF +FFFFFFFFF",9x9,8 +9x9_7c_3_b3558dd5.txt,"........G +....A.... +G.C...... +B...F.B.. +......... +.C.F..... +.D....E.E +..D..A... +.........","GGGGGGGGG +GBBBAAAAA +GBCBFFFFA +BBCBFBBFA +CCCBBBFFA +CCCFFFFAA +CDCCEEEAE +CDDCEAAAE +CCCCEEEEE",9x9,7 +7x7_7c_5_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +10x10_9c_3_bf7c15fb.txt,".......F.. +.....C..A. +..H.HG.... +.......... +......D.G. +..AE...... +.......... +.D..I.FE.. +.I......C. +....B.B...","AAAAAAAFFF +ACCCCCAAAF +ACHHHGGGGF +ACCCCCCCGF +ADDDDDDCGF +ADAEEEECCF +ADAAAAEECF +ADIIIAFECF +AIIAAAFFCF +AAAABBBFFF",10x10,9 +8x8_6c_3_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +8x8_6c_7_1f3b452b.txt,"........ +.B..CF.. +......F. +..D.A... +..C....A +......BD +.E....E. +........","DDDCCCCC +DBDCCFFC +DBDCCCFC +DBDCACCC +DBCCAAAA +DBBBBBBD +DEEEEEED +DDDDDDDD",8x8,6 +7x7_6c_8_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +8x8_7c_8_d3386298.txt,"EA..B..B +........ +.D...... +.....EG. +........ +..G..ACF +........ +DC...F..","EAAABBBB +EEEAAAAA +DDEGGGGA +DEEGEEGA +DEGGEAAA +DEGEEACF +DEEECCCF +DCCCCFFF",8x8,7 +10x10_9c_5_ce9aa220.txt,".H........ +.D........ +....BI.IH. +.....E.... +........DE +.....G.... +B..A...... +F....G..A. +.....C.... +...F....C.","HHDDDDDDDD +HDDHHHHHHD +HHHHBIIIHD +BBBBBEEEDD +BAAAAAAEDE +BAGGGGAEEE +BAGAAAACCC +FAGGGGCCAC +FAAAACCAAC +FFFFAAAACC",10x10,9 +5x5_3c_6_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_9c_7_d151790b.txt,"...H....A +HI...B..E +......I.. +......... +..C..GC.. +...F..... +......AD. +..F...D.. +BG..E....","HHHHIIIAA +HIIIIBIAE +BBBBBBIAE +BFFFCCCAE +BFCFCGCAE +BFCFCGAAE +BFCCCGADE +BFFGGGDDE +BGGGEEEEE",9x9,9 +6x6_6c_1_35b6178f.txt,"F.A.ED +....D. +..E..A +....C. +....FC +B....B","FAAEED +FAEEDD +FAEAAA +FAAACC +FFFFFC +BBBBBB",6x6,6 +8x8_8c_9_3b537bc3.txt,".F.....H +.E....A. +....D.GA +.......C +.E...G.. +.BH..B.. +........ +FD...C..","FFHHHHHH +FEHGGGAA +FEHGDGGA +FEHGDDDC +FEHGGGDC +FBHBBBDC +FBBBDDDC +FDDDDCCC",8x8,8 +5x5_3c_1_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_7c_9_d3ff1418.txt,"...EA..B. +.C....... +...CD.... +.....G... +..F...... +....D.... +...AG.... +.F..E.... +........B","CCCEAAABB +CCCEEEAAB +CCCCDEEAB +CCCCDGEAB +CFFCDGEAB +CFCCDGEAB +CFCAGGEAB +CFCAEEEAB +CCCAAAAAB",9x9,7 +9x9_9c_4_28d534c2.txt,"..D.HB... +......... +..CF.B... +.H..AG.F. +..E...... +......I.I +D..G..... +.......A. +EC.......","DDDHHBBBB +DHHHFFFFB +DHCFFBBFB +DHCCAGBFB +DEECAGBBB +DECCAGIII +DECGAGGGG +EECGAAAAG +ECCGGGGGG",9x9,9 +8x8_7c_9_9d87e141.txt,"B...G..G +....ED.D +.EF..... +..B...A. +........ +........ +.C..FA.. +...C....","BBBBGGGG +FFFBEDDD +FEFBECCC +FEBBECAC +FEEEECAC +FCCCCCAC +FCFFFAAC +FFFCCCCC",8x8,7 +5x5_5c_8_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +5x5_4c_3_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_8c_9_fe00bcd5.txt,"D.....FC. +......B.. +....F.C.. +......... +..H.HA... +D...E.... +.......B. +......... +EAG.....G","DFFFFFFCC +DFHHHHBBC +DFHFFHCBC +DFHFHHCBC +DFHFHACBC +DFFFEACBC +EEEEEACBC +EAAAAACCC +EAGGGGGGG",9x9,8 +7x7_5c_1_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +8x8_7c_6_d2bfa7eb.txt,"........ +.E...... +..FA.... +....B... +.F.A..E. +...G.... +BC...DG. +...DC...","CCCCCCCC +CEEEEEEC +CFFAAAEC +CFBBBAEC +CFBAAAEC +CCBGGGGC +BCBDDDGC +BBBDCCCC",8x8,7 +6x6_6c_8_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_8c_3_671c264d.txt,".H...... +.CB...C. +....F... +.G...BA. +..H...D. +EG...DF. +.A...... +..E.....","HHBBBBBB +HCBCCCCB +HCCCFBBB +HGGGFBAA +HHHGFDDA +EGGGFDFA +EAAAFFFA +EEEAAAAA",8x8,8 +6x6_5c_6_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +9x9_7c_7_126ff9b4.txt,"...FG.... +..E....A. +.EF.B.... +.D....... +.....C.B. +......... +......... +.D......C +......A.G","FFFFGGGGG +FEEAAAAAG +FEFABBBBG +FDFAGGGBG +FDFAGCGBG +FDFAGCGGG +FDFAGCCCC +FDFAGGGGC +FFFAAAAGG",9x9,7 +7x7_7c_7_ef6fad8a.txt,"E..E... +..C..F. +.A.GF.. +...D..G +B...A.. +......D +....B.C","EEEEGGG +CCCGGFG +CAAGFFG +CCADDDG +BCAAADD +BCCCCCD +BBBBBCC",7x7,7 +9x9_9c_8_d1aea511.txt,".......A. +......... +.CH...... +...F..... +...EGH..A +.I...C..E +...IGF... +.B....... +BD......D","FFFFFFFAA +FCCCCCFFA +FCHHHCCFA +FFFFHHCFA +EEEEGHCFA +EIIIGCCFE +EEEIGFFFE +BBEEEEEEE +BDDDDDDDD",9x9,9 +8x8_8c_1_25624d86.txt,".......H +.....F.. +..G..B.. +...BH... +A..C.... +........ +F.EGC.A. +E.D.D...","AAAAAAAH +AFFFFFAH +AFGBBBAH +AFGBHHAH +AFGCCHAH +FFGGCHAH +FEEGCHAH +EEDDDHHH",8x8,8 +6x6_6c_9_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_9c_7_71aa2cff.txt,"....BA... +B......C. +..E..E... +I........ +..G...... +......... +.C....G.A +.FDF....H +I.....DH.","BBBBBAAAA +BIIIIIICA +IIEEEEICA +IIIIIIICA +IIGGGGGCA +ICCCCCGCA +ICDDDCGCA +IFDFDCCCH +IFFFDDDHH",9x9,9 +7x7_6c_4_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +6x6_6c_9_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +7x7_6c_9_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +7x7_7c_3_f76c93f4.txt,"E...D.B +AE.B..F +.G.CF.. +..D...C +..A.... +.....G. +.......","EEDDDBB +AEDBBBF +AGDCFFF +AGDCCCC +AGAAAAA +AGGGGGA +AAAAAAA",7x7,7 +8x8_8c_6_410da633.txt,"D....DE. +........ +.B.C.... +.G..H... +A..HB..E +C......F +....A.G. +......F.","DDDDDDEE +GGGGGGGE +GBBCCCGE +GGBHHCGE +AABHBCGE +CABBBCGF +CAAAACGF +CCCCCCFF",8x8,8 +10x10_9c_4_ee625044.txt,".....I..C. +......D..C +..H....... +.F......A. +.......... +.EG.B..... +.H....GD.. +.B.....F.. +....E..... +A.....I...","GGGGGIIICC +GFFFGGDIIC +GFHFFGDDII +GFHHFGGDAI +GGGHFFGDAI +EEGHBFGDAI +EHHHBFGDAI +EBBBBFFFAI +EEEEEAAAAI +AAAAAAIIII",10x10,9 +5x5_3c_5_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +6x6_4c_2_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +6x6_4c_8_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_7c_8_a7b3eb1c.txt,"......F +..B...G +.BD...A +.E.G.CF +...DA.. +....EC. +.......","FFFFFFF +FBBGGGG +FBDGAAA +FEDGACF +FEDDACF +FEEEECF +FFFFFFF",7x7,7 +6x6_6c_5_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +8x8_6c_3_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +8x8_8c_8_6ac110ec.txt,"........ +.F..C... +..D..BCF +D....... +.G.AB.G. +.HA..... +.......H +.....E.E","DDDFFFFF +DFDFCCCF +DFDFBBCF +DFFFBHHH +GGAABHGH +GHAHHHGH +GHHHGGGH +GGGGGEEE",8x8,8 +10x10_9c_7_6588d764.txt,"I.HA...... +....EB.... +.......... +..A....... +.....GF... +..D....... +..I.E..... +........B. +.D.CF.G.H. +....C.....","IHHAEEEEEE +IHAAEBBBBE +IHAHHHHHBE +IHAHFFFHBE +IHHHFGFHBE +IDDFFGGHBE +IDIFEEGHBE +IDIFFEGHBE +IDICFEGHHE +IIICCEEEEE",10x10,9 +5x5_5c_8_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_4c_5_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_6c_6_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +6x6_5c_1_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_8c_5_76af8782.txt,"C....... +..BHEDFE +....B... +....HDA. +.C...... +........ +.G...A.. +.....G.F","CHHHEEEE +CHBHEDFE +CHBBBDFF +CHHHHDAF +CCAAAAAF +AAAGGGGF +AGGGAAGF +AAAAAGGF",8x8,8 +7x7_5c_9_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +9x9_7c_8_72f89e8a.txt,"....F.... +..E..AFB. +..A...... +...E..... +.GD...... +......B.. +.DG..C... +.......C. +.........","AAAAFAAAA +AEEAFAFBA +AEAAFFFBA +AEEEBBBBA +AGDDBCCCA +AGGDBCBCA +ADGDBCBCA +ADDDBBBCA +AAAAAAAAA",9x9,7 +7x7_5c_4_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +5x5_5c_5_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +10x10_9c_1_eb7c4808.txt,".......... +.G...C.F.. +...A.G.... +.A.......E +.D........ +..H.B..... +..C....... +.......H.. +.D........ +....I.BIEF","CCCCCCEEEE +CGGGGCEFFE +CAAAGGEEFE +CAHHHHHEFE +CDHIIIHEFF +CDHIBIHEEF +CDCIBIHHEF +CDCIBIIHEF +CDCIBBIIEF +CCCIIBBIEF",10x10,9 +7x7_6c_8_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +7x7_5c_7_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +6x6_6c_4_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_1_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_5c_8_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +7x7_7c_5_c7b7fb36.txt,".....D. +...C.F. +.C..... +.D.BF.G +..B...A +E....G. +....EA.","FFFFFDD +FCCCFFD +FCDDDDD +FDDBFGG +FFBBFGA +EFFFFGA +EEEEEAA",7x7,7 +5x5_5c_4_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_6c_2_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +9x9_7c_5_64e8fc42.txt,".....A... +.GD...... +..G.....A +.B....... +....CB.E. +........C +.E......D +......... +F.......F","CCCCCAAAA +CGDDCCCCA +CGGDDDDCA +CBBBBBDCC +CCCCCBDEC +DDDDDDDEC +DEEEEEEED +DDDDDDDDD +FFFFFFFFF",9x9,7 +9x9_7c_8_bb2794e7.txt,".EA....CG +E........ +D....F... +...A..... +....B.... +......CB. +......... +.....G... +...D....F","EEAAAAACG +EFFFFFACG +DFBBBFACG +DFBABAACG +DFBABACCG +DFBAAACBG +DFBBBBBBG +DFFFFGGGG +DDDDFFFFF",9x9,7 +8x8_6c_5_176705c4.txt,"........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C","CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC",8x8,6 +7x7_7c_6_96ca9115.txt,"F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C","FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC",7x7,7 +9x9_9c_4_f2284643.txt,"........C +....F.EA. +..G...I.. +....F.E.. +..G.B..IC +..H...... +....H.... +..D...D.. +A.......B","AAAAAAAAC +AHHHFEEAC +AHGHFEIIC +AHGHFEEIC +AHGHBBBIC +AHHHHHBBB +AHHHHHHHB +AHDDDDDHB +AHHHHHHHB",9x9,9 +10x10_10c_2_a39d9d3d.txt,"AB......BD +.....A.... +E...I..J.J +......G... +...I...... +..C..G.... +E......... +FCH....... +.....H..D. +...F......","ABBBBBBBBD +AAAAAADDDD +EIIIIDDJJJ +EICCCDGGGG +EICICDDDDG +EICICGGGDG +EIIICCCGDG +FCHHHHCGDG +FCCCCHCGDG +FFFFCCCGGG",10x10,10 +5x5_3c_6_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +8x8_8c_9_12367174.txt,"........ +......F. +...H.... +.F.E.C.A +E..D.... +G.B....A +...H.... +..GB..DC","EEEEEEEE +EFFFFFFE +EFHHEEEE +EFHEECCA +EHHDDDCA +GHBBBDCA +GHHHBDCC +GGGBBDDC",8x8,8 +8x8_6c_8_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +6x6_5c_1_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +7x7_5c_10_799f6348.txt,"C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B","CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB",7x7,5 +8x8_8c_1_9c6e60cd.txt,"......G. +.FE..... +.......G +........ +.HABF.EA +HB...... +......D. +CD....C.","AAAAAAGG +AFEEEAAG +AFFFEEAG +AAAFFEAA +HHABFEEA +HBBBCCCC +CCCCCDDC +CDDDDDCC",8x8,8 +5x5_5c_9_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +9x9_8c_10_2471bb38.txt,"........D +.E...F..A +......... +A..BG.... +E..C...D. +......... +.GC...... +.....H.H. +.FB......","AAAAAAADD +AEFFFFADA +AEFBBBADA +AEFBGBADA +EEFCGBADA +FFFCGBAAA +FGCCGBBBB +FGGGGHHHB +FFBBBBBBB",9x9,8 +6x6_6c_7_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +5x5_5c_2_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +7x7_7c_10_547f74fe.txt,"C.....A +..E...G +....... +.C.E... +...B.AG +BF..... +D....DF","CBBBBAA +CBEEBAG +CBBEBAG +CCBEBAG +BBBBBAG +BFFFFFF +DDDDDDF",7x7,7 +6x6_5c_5_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_3c_3_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +5x5_5c_1_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_4c_9_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +9x9_7c_7_dce8ae70.txt,"....FG... +.......B. +.AE..D... +...C..... +..DE..... +......... +..A...... +......C.. +.FB.....G","FFFFFGGGG +FAAAAAABG +FAEEEDABG +FCCCEDABG +FCDEEDABG +FCDDDDABG +FCAAAAABG +FCCCCCCBG +FFBBBBBBG",9x9,7 +9x9_9c_8_da5d128a.txt,"...GB..BE +......... +......... +.F....... +.A..H.... +.DC...... +...H..A.. +.I..D.... +G...ICFE.","GGGGBBBBE +GFFFFFFFE +GFAAAAAFE +GFACCCAFE +GAACHCAFE +GDCCHCAFE +GDDHHCAFE +GIDDDCFFE +GIIIICFEE",9x9,9 +5x5_3c_1_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_5c_10_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +8x8_7c_4_2a92f0be.txt,"D....BGE +F....... +.D..A... +.......F +C..E.A.. +..B..G.. +........ +.C......","DDBBBBGE +FDBGGGGE +FDBGAAEE +FFBGGAEF +CFBEGAEF +CFBEGGEF +CFFEEEEF +CCFFFFFF",8x8,7 +8x8_6c_2_5e9b9218.txt,"A......B +...C.... +.E...... +...F.... +........ +F......B +.DE..C.. +......DA","AAAAAAAB +DDDCCCAB +DEDDDCAB +DEEFDCAB +DDEFDCAB +FDEFDCAB +FDEFDCAA +FFFFDDDA",8x8,6 +9x9_7c_10_67766dd4.txt,"B......C. +.......G. +......... +...F.E.G. +.A.A.D... +...D....B +F........ +....E..C. +.........","BBBBBBBCC +EEEEEEBGC +EAAAAEBGC +EAFFAEBGC +EAFAADBCC +EEFDDDBCB +FEFFFFBCB +FEEEEFBCB +FFFFFFBBB",9x9,7 +9x9_8c_8_aab17324.txt,"...DH.... +.G.....C. +...D..... +...EHB..F +......... +.AEF..... +......BC. +.A..G.... +.........","EEEDHBBBB +EGEDHBCCB +EGEDHBCBB +EGEEHBCBF +EGGGGCCBF +EAEFGCBBF +EAEFGCBCF +EAEFGCCCF +EEEFFFFFF",9x9,8 +7x7_5c_3_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +5x5_4c_7_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +5x5_5c_3_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_6c_4_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +6x6_4c_5_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_3c_10_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_5c_8_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +8x8_6c_8_b948f6b0.txt,".CB....B +..D..AF. +........ +.....A.. +........ +...E.E.. +......D. +C.....F.","CCBBBBBB +CDDAAAFF +CDAAEEEF +CDAEEAEF +CDAEAAEF +CDAEAEEF +CDAAADDF +CDDDDDFF",8x8,6 +6x6_5c_4_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +7x7_5c_7_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +5x5_4c_10_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +6x6_4c_9_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +8x8_7c_2_82209848.txt,".......E +.F...F.. +........ +..AD.G.. +.......C +.D..G.E. +.A....B. +BC......","BBBBBBBE +BFFFFFBE +BDDDBBBE +BDADBGEE +BDABBGEC +BDABGGEC +BAABBBBC +BCCCCCCC",8x8,7 +5x5_5c_10_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +6x6_5c_2_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +10x10_9c_2_fd8c9afe.txt,"..DG...F.F +.E........ +....D...H. +......GA.. +...C...B.. +..I....H.A +......B... +...I....E. +.C........ +..........","DDDGGGGFFF +DEEEEEGAAA +DDDDDEGAHA +IIIIIEGAHA +ICCCIEBBHA +ICIIIEBHHA +ICEEEEBIII +ICEIIIIIEI +ICEEEEEEEI +IIIIIIIIII",10x10,9 +7x7_6c_7_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +11x11_10c_1_2832e7ee.txt,"C....F..... +...J...F... +GH......E.. +........... +.D.J....... +...B....... +....IA.A... +....B...... +....C.E.I.. +..D.GH..... +...........","CCCCCFEEEEE +GGGJCFEFFFE +GHGJCFEEEFE +HHGJCFFFFFE +HDGJCCCCCCE +HDGBIIIIICE +HDGBIAAAICE +HDGBBCCCICE +HDGGCCECICE +HDDGGHECCCE +HHHHHHEEEEE",11x11,10 +7x7_7c_6_2c5e0644.txt,"......C +....A.A +..F..BD +.E.BE.. +.CF.... +....... +DG....G","CCCCCCC +CEEEAAA +CEFEEBD +CEFBEBD +CCFBBBD +DDDDDDD +DGGGGGG",7x7,7 +6x6_4c_7_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +6x6_4c_2_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +9x9_8c_8_43f37569.txt,".....DA.. +...H...B. +.....A... +......... +D...E..CH +G........ +....B.EGC +........F +.......F.","DDDDDDAAA +DHHHBBBBA +DHBBBAAAA +DHBHHHHHH +DHBHEEECH +GHBHHHECC +GHBBBHEGC +GHHHHHGGF +GGGGGGGFF",9x9,8 +10x10_9c_4_2e90136f.txt,"IC........ +.G......B. +..IA...HC. +.......... +.FD....... +.......G.. +.......A.. +.......... +.F......D. +BE....EH..","ICCCCCCCCC +IGGGGGBBBC +IIIAAGBHCC +BBBBAGBHHH +BFDBAGBBBH +BFDBAGGGBH +BFDBAAAABH +BFDBBBBBBH +BFDDDDDDDH +BEEEEEEHHH",10x10,9 +9x9_9c_2_b0120833.txt,"B...D.... +.EF.I..AD +........G +B...I..E. +......... +....C.... +..A.G.C.. +......... +FH.H.....","BEEEDDDDD +BEFEIAAAD +BFFEIAGGG +BFEEIAGEE +FFEAAAGGE +FEEACCCGE +FEAAGGCGE +FEEEEGGGE +FHHHEEEEE",9x9,9 +7x7_5c_7_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_5_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_1_492d5742.txt,"......F +.B..C.C +..F.... +..G.... +.A..BA. +.E.E... +...GD.D","FFFFFFF +FBBBCCC +FFFBBBB +GGGAAAB +GAAABAB +GEEEBBB +GGGGDDD",7x7,7 +6x6_4c_9_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +7x7_5c_9_799f6348.txt,"C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B","CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB",7x7,5 +9x9_8c_9_5fb7c0cf.txt,".....E..E +......... +..H....B. +A........ +C...D.... +.......AD +......... +CBH....F. +G...FG...","AAAAAEEEE +ABBBAAAAA +ABHBBBBBA +ABHAAAAAA +CBHADDDDD +CBHAAAAAD +CBHGGGGGG +CBHGFFFFG +GGGGFGGGG",9x9,8 +5x5_4c_9_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_7c_7_d0b91616.txt,".....FA. +.G....B. +.C...... +...F...A +D..EC..G +..D..... +..E..B.. +........","FFFFFFAA +FGGGGGBA +FCCCCGBA +FFFFCGBA +DEEECGBG +DEDDGGBG +DEEDGBBG +DDDDGGGG",8x8,7 +8x8_6c_7_82c77513.txt,"........ +........ +..B..AD. +.D.F.... +.....E.. +..C..... +.B...A.. +.CE..F..","FFFFFFFF +FDDDDDDF +FDBBBADF +FDFFBAAF +FFFBBEAF +CCCBEEAF +CBBBEAAF +CCEEEFFF",8x8,6 +6x6_6c_10_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_6c_1_70510986.txt,".....BA. +.C..C.E. +......D. +..F..... +...D.... +...F.E.. +......A. +..B.....","BBBBBBAA +BCCCCEEA +BEEEEEDA +BEFDDDDA +BEFDAAAA +BEFFAEEE +BEEEAAAE +BBBEEEEE",8x8,6 +9x9_7c_6_8fa5441c.txt,"..BF....G +.....C... +.F....EC. +...DA...E +G....A... +.....D.B. +......... +......... +.........","BBBFGGGGG +BFFFGCEEE +BFGGGCECE +BBGDACCCE +GBGDAAGGG +GBGDDDGBG +GBGGGGGBG +GBBBBBBBG +GGGGGGGGG",9x9,7 +5x5_4c_4_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +5x5_5c_6_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +8x8_6c_1_60c183b5.txt,".A...... +.B....D. +..F..... +.FD..... +...EB.A. +..C..... +.E...... +...C....","AABBBBBB +ABBDDDDB +AFFDBBBB +AFDDBCCC +AEEEBCAC +AECCCCAC +AEAAAAAC +AAACCCCC",8x8,6 +7x7_6c_5_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +10x10_9c_1_8bb56a0a.txt,".......... +DH..B..... +I.I......D +.....G.... +.G..AF...B +.......EAC +...H...... +......E..F +......C... +..........","DDDDDDDDDD +DHHHBBBBBD +IIIHAAAABD +FFFHAGGABB +FGFHAFGAAB +FGFHFFGEAC +FGFHFGGECC +FGFFFGEECF +FGGGGGCCCF +FFFFFFFFFF",10x10,9 +8x8_7c_3_18741047.txt,".....D.B +......BE +......F. +...G.C.. +....E..G +..C.A.A. +..F..... +.......D","DDDDDDBB +DFFFFFBE +DFCCCFFE +DFCGCCEE +DFCGEEEG +DFCGAAAG +DFFGGGGG +DDDDDDDD",8x8,7 +7x7_6c_10_edc5ddf1.txt,"A...... +.....F. +.D..... +...D..A +FEBE..C +....B.. +......C","AAAAAAA +BBBBBFA +BDDDBFA +BBBDBFA +FEBEBFC +FEEEBFC +FFFFFFC",7x7,6 +9x9_9c_1_80802004.txt,"...E..... +.B....... +...B..F.. +DA....... +...G....E +...A..... +H..D..... +.G....IF. +...HC..CI","EEEEEEEEE +EBBBEIIIE +EEEBEIFIE +DAEEEIFIE +DAAGGIFIE +DDAAGIFII +HDDDGIFFI +HGGGGIIFI +HHHHCCCCI",9x9,9 +6x6_4c_5_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +9x9_9c_3_93eaa6a8.txt,"D...IG.EF +.I...C... +.C.DG.... +....E.... +.....A... +..A..H.B. +..B....F. +.......H. +.........","DIIIIGGEF +DICCCCGEF +DCCDGGGEF +DDDDEEEEF +BBBBAAFFF +BAABAHFBB +BABBAHFFB +BAAAAHHHB +BBBBBBBBB",9x9,9 +9x9_7c_2_fd249655.txt,".F....... +.......E. +....G.... +........D +......... +..A.....D +..EGA.F.B +.C.....C. +.......B.","FFCCCCCCC +FCCAAAEEC +FCAAGAECC +FCAGGAECD +FCAGAAECD +FCAGAEECD +FCEGAEFCB +FCEEEEFCB +FFFFFFFBB",9x9,7 +5x5_3c_2_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +6x6_4c_1_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_1_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_5c_5_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_6c_2_d5cc36f7.txt,"B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +.......","BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB",7x7,6 +6x6_4c_6_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_6c_2_21b01e0e.txt,"...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE","AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE",7x7,6 +5x5_5c_9_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_7c_3_71726d93.txt,"....D..G +.C...... +....C... +B.A..... +....F... +.E.E.D.. +.A.F.G.B +........","EEEEDDDG +ECCEEEDG +EECCCEDG +BEAEEEDG +BEAEFDDG +BEAEFDGG +BAAFFGGB +BBBBBBBB",8x8,7 +9x9_8c_10_3e7e1f61.txt,"....BE... +.A..E..F. +......G.. +......... +...B.D... +......... +C..D..H.. +....A..FG +C.......H","DDDBBEGGG +DADBEEGFG +DADBBBGFG +DADDDBBFG +DAABDDBFG +DDABBBBFG +CDADDDHFG +CDAAADHFG +CDDDDDHHH",9x9,8 +7x7_6c_6_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +9x9_8c_3_01959e84.txt,"C........ +......... +......... +.....G.F. +...HB..E. +......... +F.BHGE.A. +D.....CD. +........A","CCCCCCCCC +FFFFFFFFC +FEEEEEEFC +FEBBBGEFC +FEBHBGEEC +FEBHGGCCC +FEBHGECAA +DEEEEECDA +DDDDDDDDA",9x9,8 +10x10_9c_8_84b82713.txt,".......B.B +.........A +.DC....... +......F... +......H.I. +.G...F.DA. +.......... +.......I.. +...E...C.. +E...G....H","IIIIIIIBBB +IDDDDDIIIA +IDCCCDDDIA +IIIICFFDIA +EEEICFHDIA +EGEICFHDAA +EGEICCHHHH +EGEIICCIIH +EGEEIICCIH +EGGGGIIIIH",10x10,9 +5x5_3c_3_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +6x6_5c_3_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_8c_4_36602eab.txt,"D........ +E...B.... +..H....B. +.G...E.C. +..A...... +........D +..HA...F. +.......CF +........G","DDDDDDDDD +EGGGBBBBD +EGHGGGGBD +EGHHEEGCD +EAAHEGGCD +EAHHEGCCD +EAHAEGCFF +EAAAEGCCF +EEEEEGGGG",9x9,8 +9x9_7c_2_056744a7.txt,"....A...D +.FB...C.. +......E.. +ACG...... +......... +.....B... +..D.F.... +..G...E.. +.........","AAAAADDDD +AFBBBDCCC +AFFFBDEEC +ACGFBDDEC +CCGFBBDEC +CGGFFBDEC +CGDDFDDEC +CGGDDDEEC +CCCCCCCCC",9x9,7 +5x5_5c_1_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +9x9_8c_4_a50e0622.txt,"D.......D +...GE...E +......... +..H.....C +......... +.......B. +.BA...C.. +...GA.... +F.FH.....","DDDDDDDDD +GGGGEEEEE +GCCCCCCCC +GCHHHHHHC +GCCCCCCHH +GBBBBBCBH +GBAAABCBH +GGGGABBBH +FFFHHHHHH",9x9,8 +8x8_8c_4_f967b217.txt,"GBHF.... +......H. +.B....G. +.....AE. +....FC.. +.AD...E. +......C. +...D....","GBHFFFFF +GBHHHHHF +GBGGGGGF +GGGAAAEF +DDDAFCEF +DADAFCEF +DAAAFCCF +DDDDFFFF",8x8,8 +8x8_8c_7_a3396780.txt,"........ +.E..E.A. +CD.B..G. +..BA.... +....G.F. +..H.CH.. +......F. +D.......","CCCCCCCC +CEEEEAAC +CDBBAAGC +DDBAAGGC +DCCCGGFC +DCHCCHFC +DCHHHHFC +DCCCCCCC",8x8,8 +7x7_5c_10_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +7x7_7c_9_0d9589a3.txt,"..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G","EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG",7x7,7 +8x8_8c_4_da9b061d.txt,"BC...... +...HA... +..B..... +..ED...C +...E...A +..D....F +....H.FG +......G.","BCCCCCCC +BHHHAAAC +BHBBBBAC +BHEDDBAC +BHEEDBAA +BHDDDBFF +BHHHHBFG +BBBBBBGG",8x8,8 +5x5_5c_7_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +7x7_7c_7_dae1eb3d.txt,"FD.D... +.....A. +F.B...C +G...C.B +....E.. +.E.A... +.G.....","FDDDCCC +FEEECAC +FEBECAC +GEBECAB +GEBEEAB +GEBAAAB +GGBBBBB",7x7,7 +6x6_4c_8_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +10x10_9c_9_cd48935d.txt,"......H... +CE......H. +I......... +..C.F..... +..B....F.. +.......... +..B....... +I.E....D.. +..A..DG... +AG........","CCCHHHHFFF +CECHFFFFHF +IECHFHHHHF +IECHFHGGGF +IEBHHHGFGF +IEBGGGGFGF +IEBGFFFFGF +IEEGFDDDGF +AAAGFDGGGF +AGGGFFFFFF",10x10,9 +8x8_6c_10_ee06545b.txt,"..BC...F +.E...... +....BE.. +........ +.FD..D.. +.......C +........ +A......A","BBBCCCCF +BEEEEECF +BBBBBECF +CCCCCCCF +CFDDDDFF +CFFFFFFC +CCCCCCCC +AAAAAAAA",8x8,6 +8x8_6c_5_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +7x7_5c_8_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +10x10_9c_10_48c869f8.txt,".......... +.......... +.......... +....GI.... +..DGF....C +......I... +....E.FDA. +..B.HC.... +.H..B..E.. +.........A","CCCCCCCCCC +CEEEEEEEEC +CEDDDDDDEC +CEDGGIIDEC +CEDGFFIDEC +CEEEEFIDEE +CHHHEFFDAE +CHBHHCAAAE +CHBBBCAEEE +CCCCCCAAAA",10x10,9 +6x6_6c_2_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +5x5_3c_2_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_6c_9_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +7x7_5c_6_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +9x9_8c_7_f1829bb0.txt,"G........ +.......A. +.H.D...C. +...G..... +E.......F +...A..... +.B....C.. +..D...B.. +E......HF","GHHHHHHHH +GHAAAAAAH +GHADDDCCH +GGAGGDCHH +EGAAGDCHF +EGGAGDCHF +EBGGGDCHF +EBDDDDBHF +EBBBBBBHF",9x9,8 +5x5_3c_9_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +6x6_4c_8_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +5x5_5c_1_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +5x5_3c_1_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +6x6_6c_1_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +10x10_9c_10_b9b91263.txt,"..FE.BG... +.D........ +.......I.. +.E........ +.F........ +..D.....A. +H.......G. +..HI...BC. +C......... +A.........","FFFEEBGGGG +FDDDEBBBBG +FFFDEIIIBG +EEFDEIBBBG +EFFDEIBGGG +EEDDEIBGAA +HEEEEIBGGA +HHHIIIBBCA +CCCCCCCCCA +AAAAAAAAAA",10x10,9 +5x5_5c_3_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +8x8_8c_8_14eb01d5.txt,"F......H +.C..E..A +..EFDC.. +H....... +.G..GD.. +........ +BA...... +.......B","FCCCCCHH +FCEEECHA +FFEFDCHA +HFFFDDHA +HGGGGDHA +HHHHHHHA +BAAAAAAA +BBBBBBBB",8x8,8 diff --git a/submodules/flowfree/flowfree_problems_solutions1.csv b/submodules/flowfree/flowfree_problems_solutions1.csv new file mode 100644 index 0000000000000000000000000000000000000000..336607903459a6260a0e415332aff37bd639a359 --- /dev/null +++ b/submodules/flowfree/flowfree_problems_solutions1.csv @@ -0,0 +1,5184 @@ +path,problem,solution,grid_size,num_colors +9x9_8c_5_2af3ded9.txt,"....F.... +.B.F..E.A +.....C... +.....G... +.D.GH..C. +.....B... +..E.H...D +......... +.A.......","AAAFFAAAA +ABAFAAEEA +ABAAACCEE +ABBGGGCCE +ADBGHHHCE +ADBBBBHEE +ADEEHHHED +ADDEEEEED +AADDDDDDD",9x9,8 +9x9_9c_10_f029a480.txt,".....E... +....I..D. +..G...B.. +..F.F.... +......D.. +..CE...A. +.C...HB.. +...I..H.. +A.......G","EEEEEEGGG +EIIIIGGDG +EIGGGGBDG +EIFFFBBDG +EIIIIBDDG +ECCEIBBAG +ECEEIHBAG +EEEIIHHAG +AAAAAAAAG",9x9,9 +8x8_8c_10_83d92d01.txt,"D...H... +..E..DC. +........ +..A....H +.C...... +..GB.... +F..E..GA +....F..B","DDDDHHHH +EEEDDDCH +ECCCCCCH +ECAAAAAH +ECGGGGAA +EEGBBGGA +FEEEBBGA +FFFFFBBB",8x8,8 +6x6_4c_7_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_5c_4_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_4c_2_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_3c_5_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_5c_1_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +7x7_7c_9_d249fa1f.txt,"......G +G....FD +...A... +C...... +..C.... +AE..FE. +B.B...D","GGGGGGG +GCCCCFD +CCAACFD +CAACCFD +AACCFFD +AEEEFED +BBBEEED",7x7,7 +5x5_5c_3_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_6c_7_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +7x7_6c_1_21b01e0e.txt,"...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE","AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE",7x7,6 +6x6_4c_4_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +9x9_8c_1_306fbd00.txt,".....B... +H......G. +..A.....B +....F..GD +E......H. +...E..... +.DF...A.. +....C..C. +.........","HHHHHBBBB +HEEEHHHGB +EEAEEEHGB +EAAFFEHGD +EAFFEEHHD +AAFEEDDDD +ADFDDDAAA +ADDDCCCCA +AAAAAAAAA",9x9,8 +5x5_5c_4_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +9x9_7c_4_207aef04.txt,"E......G. +B........ +.F..A.D.. +...B..... +......... +...C..D.. +......... +...E...C. +.F..AG...","EEEEEEEGG +BBBBBBEEG +FFAAABDEG +FAABBBDEG +FAEEEEDEG +FAECCEDEG +FAEECEEEG +FAAECCCCG +FFAAAGGGG",9x9,7 +7x7_7c_4_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +6x6_4c_9_7e2f1ba3.txt,"D..... +..A.A. +...... +....BC +.D..C. +.....B","DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB",6x6,4 +5x5_4c_1_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +7x7_6c_3_ad1343f0.txt,"AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +.......","ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE",7x7,6 +7x7_5c_9_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +5x5_5c_2_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_7_96ca9115.txt,"F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C","FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC",7x7,7 +7x7_7c_2_782c2792.txt,"....... +....ED. +B.G.... +..AFG.. +E...D.. +A....C. +F..C.B.","BBBBBBB +BEEEEDB +BEGGGDB +EEAFGDB +EAAFDDB +AAFFCCB +FFFCCBB",7x7,7 +7x7_5c_3_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +6x6_4c_3_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_6c_3_d5cc36f7.txt,"B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +.......","BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB",7x7,6 +7x7_5c_5_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +9x9_7c_9_a6b69ac4.txt,"...C..... +.G..D.... +....E.FD. +.......F. +....E.AC. +.......B. +.......G. +......... +..AB.....","AAACCCCCC +AGADDDDDC +AGADEDFDC +AGADEDFFC +AGADEDACC +AGADDDABB +AGAAAAAGB +AGGGGGGGB +AAABBBBBB",9x9,7 +8x8_6c_4_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +5x5_3c_8_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_7c_1_172e1fee.txt,"...GA... +......E. +.B.....A +.E.F.... +......C. +FG...B.. +....C... +D.D.....","GGGGAAAA +GBBBBBEA +GBEEEBEA +GEEFEBEE +GGFFEBCE +FGFEEBCE +FFFECCCE +DDDEEEEE",8x8,7 +7x7_5c_1_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +9x9_9c_6_a4b5019b.txt,"...AB...C +...H..... +..I....EB +....C.... +.......G. +......... +..GF.FI.. +.H......E +.AD.....D","AAAABCCCC +AHHHBCBBB +AHIBBCBEB +AHIBCCBEE +AHIBBBBGE +AHIIIIIGE +AHGFFFIGE +AHGGGGGGE +AADDDDDDD",9x9,9 +6x6_4c_10_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_5c_2_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +8x8_6c_9_fc59c90b.txt,"D....... +.E...... +.FA..C.. +........ +...B.... +......F. +..CBA.E. +D.......","DEEEEEEE +DEAAAAAE +DFACCCAE +DFCCAAAE +DFCBAEEE +DFCBAEFF +DFCBAEEF +DFFFFFFF",8x8,6 +5x5_5c_2_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +9x9_7c_6_d4cb8ca8.txt,"...G....A +.B......C +..DE..... +......... +......G.. +....E...C +F.B...ADF +......... +.........","DDDGGGGAA +DBDDDDGAC +DBDEEDGAC +DBDDEDGAC +DBBDEDGAC +DDBDEDAAC +FDBDDDADF +FDDDDDDDF +FFFFFFFFF",9x9,7 +6x6_4c_6_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_4c_8_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_5c_2_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +8x8_6c_3_cade0083.txt,"A.BC.... +..E...E. +........ +...C.... +...F..D. +........ +.BA....F +.......D","ABBCCCCC +ABEEEEEC +ABDDDDDC +ABDCCCDC +ABDFFCDC +ABDDFCCC +ABADFFFF +AAADDDDD",8x8,6 +7x7_6c_9_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +7x7_5c_5_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_4c_7_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_3c_7_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +6x6_5c_6_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +6x6_5c_7_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_7c_5_297ba08d.txt,"......... +......... +......B.. +C.......C +..B.A.... +..E.F.... +..A...D.. +.....D... +...G.EF.G","CCCCCCCCC +CGGGGGGGC +CGBBBBBGC +CGBFFFFGC +GGBFAAFGG +GEEFFAFFG +GEAAAADFG +GEEEEDDFG +GGGGEEFFG",9x9,7 +5x5_4c_2_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_6c_2_9769657e.txt,"........ +.B..D.F. +....CD.. +..A..... +A.C.E... +........ +BF...... +E.......","AAAEEEEE +ABAEDDFE +ABAECDFE +ABAECCFE +ABCEECFE +BBCCCCFE +BFFFFFFE +EEEEEEEE",8x8,6 +8x8_8c_3_c81e3705.txt,"HFD..D.E +.......A +.F....C. +.....G.. +.......B +..CE.AH. +....G... +......B.","HFDDDDEE +HFEEEEEA +HFECCCCA +HEECGGAA +HECCGAAB +HECEGAHB +HEEEGHHB +HHHHHHBB",8x8,8 +9x9_7c_1_e28dfc75.txt,"......GDB +.F..FA... +......... +..C...... +....D.B.. +..C...... +...G..... +.E.....EA +.........","AAAAAAGDB +AFFFFAGDB +AGGGGGGDB +AGCBBBBDB +AGCBDDBDB +AGCBBDDDB +AGGGBBBBB +AEEEEEEEA +AAAAAAAAA",9x9,7 +7x7_7c_8_63dec1fa.txt,"F....AE +....... +.A.GF.. +.C..... +.....C. +.B...B. +GD...DE","FFFFFAE +GGGGFAE +GAAGFAE +GCAAAAE +GCCCCCE +GBBBBBE +GDDDDDE",7x7,7 +6x6_6c_6_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +7x7_6c_4_ad1343f0.txt,"AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +.......","ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE",7x7,6 +5x5_5c_8_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_5c_5_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_6c_10_7f24b2e8.txt,".E...... +.A.BFC.. +.B...E.. +....F... +........ +.D.AC... +......D. +........","EEAAAAAA +EAABFCCA +EBBBFECA +EEEEFECA +AAAEEECA +ADAACCCA +ADDDDDDA +AAAAAAAA",8x8,6 +7x7_5c_6_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +7x7_5c_4_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_2_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_9_7e442b1b.txt,"...FA.. +.DC.B.. +..G.EB. +....... +..GFE.C +....DA. +.......","CCCFAAA +CDCFBBA +CDGFEBA +CDGFEAA +CDGFEAC +CDDDDAC +CCCCCCC",7x7,7 +7x7_5c_6_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_3_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_2_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +5x5_5c_7_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +7x7_5c_3_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_7c_4_f29c58ac.txt,"D.BE..E +..FAG.. +....C.. +....G.. +.B..... +.DF..C. +A......","DBBEEEE +DBFAGGG +DBFACCG +DBFAGCG +DBFAGCG +DDFAGCG +AAAAGGG",7x7,7 +5x5_3c_8_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +9x9_9c_9_e082bc41.txt,"......HGA +.BC..D... +.....F... +......... +.B.....G. +.......IA +..E.H.D.C +...F..I.. +.E.......","EEEEHHHGA +EBCEHDDGA +EBCEHFDGA +EBCEHFDGA +EBCEHFDGA +ECCEHFDIA +ECEEHFDIC +ECCFFFIIC +EECCCCCCC",9x9,9 +7x7_5c_2_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +8x8_6c_5_edf4c497.txt,"CE...... +........ +.C.BD... +.B.AF... +........ +.A...... +.F.D.... +.......E","CEEEEEEE +CCCCCCCE +CCBBDDCE +CBBAFDCE +CAAAFDCE +CAFFFDCE +CFFDDDCE +CCCCCCCE",8x8,6 +9x9_7c_4_b67fe4d3.txt,"...A....E +A....G... +......... +.B.E...D. +...F..... +.......G. +.B....D.. +....F...C +C........","AAAADDDDE +ADDDDGGDE +DDDDDDGDE +DBDEEDGDE +DBDFEDGGE +DBDFEDDGE +DBDFEEDEE +DDDFFEEEC +CCCCCCCCC",9x9,7 +6x6_6c_10_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_1_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +9x9_8c_1_55c4888b.txt,"C........ +.......G. +.....H.C. +..F..D.E. +.......H. +.FB...... +.......A. +.B...D..A +......G.E","CCCCCCCCC +GGGGGGGGC +GBBBBHHCC +GBFFBDHEE +GBBFBDHHE +GFBFBDEEE +GFFFBDEAA +GBBBBDEEA +GGGGGGGEE",9x9,8 +8x8_7c_5_0118fd6b.txt,"........ +B....... +........ +....A.F. +F.A..... +E.G..D.C +...GD... +....EB.C","BBBBBBBB +BFFFFFFB +FFGGGGFB +FGGAAGFB +FGAAGGBB +EGGGGDBC +EGGGDDBC +EEEEEBBC",8x8,7 +6x6_6c_9_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +10x10_9c_3_30461201.txt,"E........E +..H...A... +....G...F. +.......... +...IG..... +.A........ +.....C.DB. +.......... +.FIH....C. +........BD","EEEEEEEEEE +HHHAAAAGGG +HAAAGGGGFG +HAFFFFFFFG +HAFIGGGGGG +HAFIBBBDDD +HFFIBCBDBD +HFIIBCBBBD +HFIHBCCCCD +HHHHBBBBBD",10x10,9 +7x7_6c_7_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +6x6_5c_2_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +5x5_3c_2_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_7c_5_8c30c948.txt,".E....B +.A.FA.G +....F.. +.D..... +.....C. +..B.CE. +D.....G","EEAAABB +EAAFABG +EEEFFBG +DDEBBBG +DEEBCCG +DEBBCEG +DEEEEEG",7x7,7 +5x5_3c_7_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +10x10_9c_7_d35070f8.txt,"CB.......D +......I..B +..F.....D. +.E.A...... +.H.F...... +........G. +...EI..... +....AH.... +.......... +.......GC.","CBBBBBBBDD +CEEEEEIBDB +CEFFFEIBDB +CEAAFEIBBB +CHAFFEICCC +CHAEEEICGC +CHAEIIICGC +CHAAAHCCGC +CHHHHHCGGC +CCCCCCCGCC",10x10,9 +5x5_4c_6_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_4c_3_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +9x9_8c_2_f539b23a.txt,"G.BH..... +..C...... +..B...EA. +......AD. +F........ +......... +..C.E.... +......... +.F..GD.H.","GBBHHHHHH +GBCCAAAAH +GBBCAEEAH +GGCCAEADH +FGCAAEADH +FGCAEEADH +FGCAEAADH +FGGAAADDH +FFGGGDDHH",9x9,8 +5x5_5c_10_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_8c_10_f24df32a.txt,".AH..... +......B. +.BF..F.. +.CG....D +....C... +..G..... +E..A.... +..EH.D..","AAHHHHHH +ABBBBBBH +ABFFFFHH +ACGGGGHD +ACCCCGHD +AAGGGGHD +EAAAHHHD +EEEHHDDD",8x8,8 +6x6_6c_5_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_8c_6_3e7403c4.txt,"...E...ED +FG....... +.......BF +...D.B... +G.A...... +......... +.CHC..A.. +....H.... +.........","FFFEEEEED +FGFDDDDDD +GGFDAAABF +GFFDABABF +GFAAABABF +FFHHHBABF +FCHCHBABF +FCCCHBBBF +FFFFFFFFF",9x9,8 +5x5_3c_5_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_7c_1_a599e0e6.txt,"....EA..A +......... +..B.C..D. +......... +E.B.F.... +G.....G.. +..F...... +D........ +.....C...","EEEEEAAAA +EFFFFFCCC +EFBCCFCDC +EFBCFFCDC +EFBCFCCDC +GFFCCCGDC +GGFGGGGDC +DGGGDDDDC +DDDDDCCCC",9x9,7 +8x8_7c_8_12000403.txt,"..CA.... +.A....D. +.EF..... +..G.E..B +....CD.. +..G..... +......B. +.......F","CCCAFFFF +CAAAFDDF +CEFFFDFF +CEGEEDFB +CEGECDFB +CEGECFFB +CEEECFBB +CCCCCFFF",8x8,7 +8x8_6c_7_1786c3a8.txt,"........ +..F..E.D +C....D.. +A....... +....E... +........ +..CF..B. +A...B...","CCCCDDDD +CFFCDEED +CFCCDDEE +AFCBBBBE +AFCBEEBE +AFCBBEBE +AFCFBEBE +AFFFBEEE",8x8,6 +10x10_9c_2_e3905cd9.txt,"E..E..G... +........A. +.CB...I... +..C..H..D. +..G......F +.......... +.......... +.......I.. +..HFDA.... +B.........","EEEEGGGFFF +GGGGGFFFAF +GCBBFFIAAF +GCCBFHIADF +GGGBFHIADF +BBBBFHIADD +BFFFFHIAAD +BFHHHHIIAD +BFHFDAAAAD +BFFFDDDDDD",10x10,9 +5x5_3c_9_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +8x8_6c_10_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +5x5_3c_3_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_6c_9_4b7bece2.txt,"........ +.E....E. +CA....B. +...B.... +.F.D.... +..C..A.. +..FD.... +........","CCCCCCCC +CEEEEEEC +CAAAAABC +CCCBBABC +CFCDBABC +CFCDBABC +CFFDBBBC +CCCCCCCC",8x8,6 +7x7_7c_6_ec4e7a56.txt,"..F.EA. +.....F. +.....B. +.E.C... +....BD. +GC..D.A +......G","FFFEEAA +FEEEFFA +FEFFFBA +FEFCBBA +FFFCBDA +GCCCDDA +GGGGGGG",7x7,7 +6x6_5c_9_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_5c_7_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_4c_5_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_8_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +10x10_9c_6_0f9bfafe.txt,"....G..... +.C......D. +........A. +I.D.A...B. +.......... +..B..F.F.. +IC........ +...H...H.. +.E..E..... +......G...","DDDDGGGGGG +DCCDDDDDDG +DDCCAAAAAG +IDDCABBBBG +ICCCBBFFFG +ICBBBFFFFG +ICFFFFFFFG +FFFHHHHHFG +FEEEEFFFFG +FFFFFFGGGG",10x10,9 +10x10_9c_6_86268115.txt,"...A...... +FI........ +D......C.. +..I...E... +H....C.G.. +.D.G...A.F +.B.E...... +.......... +........H. +.........B","FFFAAAAAAA +FIFFGGGGGA +DIIFGCCCGA +DDIFGCEGGA +HDFFGCEGAA +HDFGGEEAAF +HBFEEEFFFF +HBFFFFFBBB +HBBBBBBBHB +HHHHHHHHHB",10x10,9 +5x5_3c_4_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +5x5_4c_4_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +5x5_3c_10_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_6c_1_6ec3c337.txt,"...E... +.B..... +..D.... +..A..F. +..B..C. +.A..D.. +FC....E","FFFEEEE +FBFFFFE +FBDDDFE +FBAADFE +FBBADCE +FAAADCE +FCCCCCE",7x7,6 +7x7_7c_10_077103b2.txt,"..CD... +.E..... +CD...E. +G...... +..F...B +.A...A. +...G.FB","CCCDDDD +CEEEEED +CDDDDED +GAAADDD +GAFAAAB +GAFFFAB +GGGGFFB",7x7,7 +8x8_7c_4_a3784e4f.txt,"FA...... +.G...... +.....B.. +.....D.. +...F.... +.B..C..A +.C..EDGE +........","FAAAAAAA +FGGGGGGA +FBBBBBGA +FBCCCDGA +FBCFCDGA +FBCFCDGA +FCCFEDGE +FFFFEEEE",8x8,7 +7x7_7c_10_0d9589a3.txt,"..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G","EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG",7x7,7 +5x5_5c_7_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_3_9baf1145.txt,"..C...D +..G.F.. +..A...D +......C +..GFA.. +E...... +.EB...B","CCCAAAD +CGGAFAD +CGAAFAD +CGGFFAC +CCGFAAC +ECCCCCC +EEBBBBB",7x7,7 +5x5_4c_5_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_8c_2_b69f748c.txt,"...H..... +H........ +F.A..BD.. +..B..D..E +..E...G.. +.....G.C. +..A..C... +........F +.........","HHHHEEEEE +HEEEEBBBE +FEAAABDBE +FEBBADDBE +FEEBAGGBB +FBBBAGCCB +FBAAACCBB +FBBBBBBBF +FFFFFFFFF",9x9,8 +7x7_7c_1_9dd2760b.txt,"....... +DBEA... +C.....D +.....AC +..GB.E. +.G..... +...F..F","DDDDDDD +DBEAAAD +CBEEEAD +CBBBEAC +CGGBEEC +CGCCCCC +CCCFFFF",7x7,7 +8x8_8c_2_5eb06022.txt,"H....... +..F...FE +..D....D +H.E....C +....C... +.G.GA.A. +........ +B......B","HEEEEEEE +HEFFFFFE +HEDDDDDD +HEEAAAAC +AAAACCAC +AGGGACAC +AAAAACCC +BBBBBBBB",8x8,8 +8x8_8c_7_ea280416.txt,"F....... +......HG +C.E..... +D....... +..CF.B.. +.......H +.EB....A +DG..A...","FFFFFGGG +CCCCFGHG +CEECFGHH +DECCFGGH +DECFFBGH +DEBBBBGH +DEBGGGGA +DGGGAAAA",8x8,8 +6x6_4c_10_7e2f1ba3.txt,"D..... +..A.A. +...... +....BC +.D..C. +.....B","DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB",6x6,4 +9x9_8c_7_a0a086d4.txt,"...A..... +A......E. +......F.. +.E.C..B.. +......... +...F.C... +.HD..B... +...H..... +.....G.GD","AAAADDDDD +ADDDDEEED +DDEEEEFFD +DEECCCBFD +DDDDDCBFD +FFFFDCBFD +FHDDDBBFD +FHHHFFFFD +FFFFFGGGD",9x9,8 +8x8_7c_6_3ff2d94a.txt,".....C.B +....BF.. +..D..... +.F..DC.. +........ +...E..EG +.A...... +G......A","BBBBBCCB +BFFFBFCB +BFDFFFCB +BFDDDCCB +BBBBBBBB +GGGEEEEG +GAGGGGGG +GAAAAAAA",8x8,7 +9x9_7c_3_999b887c.txt,"......... +.A..D..D. +..E...... +F........ +....C.... +.F..E.BA. +GB.....G. +......... +........C","AAAAAAAAA +AAAADDDDA +AAEAAAAAA +FAEECCCCC +FAAECAAAC +FFAEEABAC +GBAAAABGC +GBBBBBBGC +GGGGGGGGC",9x9,7 +6x6_6c_3_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +6x6_6c_6_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_8_4aae6c86.txt,"E.EFG.D +....F.. +.C..G.. +..ADB.. +....A.. +...CB.. +.......","EEEFGGD +DDDFFGD +DCDDGGD +DCADBBD +DCAAABD +DCCCBBD +DDDDDDD",7x7,7 +10x10_9c_8_c7fe0b9d.txt,"......I... +.CHG....E. +.......E.. +.....A.... +....A.BH.. +.......... +.......B.. +........F. +...DG..... +ICF......D","IIIIIIIGGG +ICHGGGGGEG +ICHBBBBEEG +ICHBAABBBG +ICHBABBHBG +ICHBBBHHBG +ICHHHHHBBG +ICFFFFFFFG +ICFDGGGGGG +ICFDDDDDDD",10x10,9 +5x5_4c_10_707b086f.txt,"D.... +C.... +B.... +.ABC. +AD...","DDDDD +CCCCD +BBBCD +AABCD +ADDDD",5x5,4 +6x6_6c_4_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +10x10_9c_5_28224532.txt,"......C... +.HD.....E. +..I..FA..D +.......... +.....B.... +..I....G.. +..GF...... +.....HC..E +.......... +........BA","CCCCCCCDDD +CHDDDDDDED +CHIFFFAAED +CHIFGGGAEE +CHIFGBGAAE +CHIFGBGGAE +CHGFGBBBAE +CHGGGHCBAE +CHHHHHCBAA +CCCCCCCBBA",10x10,9 +8x8_7c_10_a2d578a8.txt,"C......G +.......D +.G..EA.. +.ED..... +....BF.. +........ +........ +CFBA....","CGGGGGGG +CGDDDDDD +CGDEEAAA +CEDEBBBA +CEEEBFBA +CFFFFFBA +CFBBBBBA +CFBAAAAA",8x8,7 +9x9_7c_10_b9baf331.txt,"......... +.A....... +..GEFE... +.......F. +.C..D.... +......... +B.....DC. +GB....... +...A.....","GGGEEEEEE +GAGEFFFFE +GAGEFEEFE +GAAAAAEFE +GCCCDAEEE +GGGCDAAAA +BBGCDDDCA +GBGCCCCCA +GGGAAAAAA",9x9,7 +9x9_9c_2_cb24bd37.txt,"......... +.G....D.. +.B..F.... +.....I.D. +A...IG.A. +.FB...... +.H.HE.... +.C.C..... +.....E...","FFFFFEEEE +FGGGFEDDE +FBBGFEEDE +FFBGIIEDE +AFBGIGEAE +AFBGGGEAE +AHHHEEEAE +ACCCAAAAE +AAAAAEEEE",9x9,9 +8x8_6c_8_8b279246.txt,"......BC +.D.B.... +...A.... +..F...E. +.....A.. +...C.E.. +.D...... +.......F","FFFBBBBC +FDFBCCCC +FDFACAAA +FDFACAEA +FDAACAEA +FDACCEEA +FDAAAAAA +FFFFFFFF",8x8,6 +7x7_7c_3_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +6x6_4c_4_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +8x8_6c_6_fbde3bc8.txt,"DC...... +........ +.....B.. +AF.B.... +F..A.... +C.....D. +E....... +.......E","DCCCCCCC +DDDDDDDC +AAAAABDC +AFBBABDC +FFBAABDC +CCBBBBDC +ECCCCCCC +EEEEEEEE",8x8,6 +9x9_9c_5_a571c118.txt,".....D... +....B..E. +.....GF.. +.B.C..... +.......EG +.FH..H..I +.....I..A +..C...... +D.......A","DDDDDDGGG +DBBBBGGEG +DBFFFGFEG +DBFCFFFEG +DFFCCCCEG +DFHHHHCII +DIIIIICIA +DICCCCCIA +DIIIIIIIA",9x9,9 +6x6_6c_2_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +8x8_7c_1_826ba2c7.txt,"D...B... +..GD..F. +.....E.. +.....CE. +...CB... +........ +.F.A..A. +.G......","DDDDBBBB +GGGDFFFB +GFFFFEEB +GFCCCCEB +GFCCBBBB +GFCCCCCC +GFCAAAAC +GGCCCCCC",8x8,7 +6x6_4c_3_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_4c_1_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +8x8_7c_10_db102e74.txt,"....BE.E +.FC..... +........ +......F. +........ +.D.A.G.. +...B.... +GD.AC...","BBBBBEEE +BFCCCCCC +BFFFFFFC +BBBBBBFC +GGGGGBBC +GDAAGGBC +GDABBBBC +GDAACCCC",8x8,7 +5x5_3c_4_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +5x5_5c_10_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +6x6_5c_9_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_4c_7_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_6c_5_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +9x9_9c_10_b1d5c5be.txt,"..BH..... +......... +..F...... +B......A. +GID..A... +...C....H +.DI..C.FE +.......E. +........G","BBBHHHHHH +BAAAAAAAH +BAFFFFFAH +BAAAAAFAH +GIDDDAFFH +GIICDDDFH +GDICCCDFE +GDDDDDDEE +GGGGGGGGG",9x9,9 +8x8_8c_5_eba37cd0.txt,"D....... +........ +GB....G. +B.E.F.E. +........ +.CA..H.. +....C..D +...FH..A","DDDDDDDD +GGGGGGGD +GBEEEEGD +BBEFFEED +FFFFAAAD +FCAAAHAD +FCCCCHAD +FFFFHHAA",8x8,8 +5x5_4c_6_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_6c_6_13c2982c.txt,"........ +.D...A.. +..DC.... +B.F..FA. +..E..... +..C..... +......B. +E.......","CCCCFFFF +CDDCFAAF +CCDCFFAF +BCFFFFAF +BCEEFFFF +BCCEEEEE +BBBBBBBE +EEEEEEEE",8x8,6 +9x9_8c_3_21bd5b1f.txt,"..HCE..FE +.G....... +.H......D +.....F..A +.B....... +...D..... +.....B... +......C.. +..G.....A","HHHCEFFFE +HGGCEFEEE +HHGCEFEDD +GGGCEFEDA +GBCCEEEDA +GBCDDDDDA +GBCCCBBBA +GBBBCCCBA +GGGBBBBBA",9x9,8 +6x6_6c_6_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_9c_1_1956903b.txt,"......... +.C..B..E. +..BF..H.. +FC....... +...H..... +E.G...... +..D...AI. +.A....... +GI....D..","FFFFFFHHH +FCBBBFHEH +FCBFFFHEH +FCEEEEEEH +EEEHHHHHH +EGGDDDDDD +GGDDAAAID +GAAAAIIID +GIIIIIDDD",9x9,9 +6x6_6c_8_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +5x5_3c_4_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_8c_2_a7f0c08f.txt,"......BH +.E..H... +A.....B. +C..EG.F. +..A..... +........ +..CD..F. +D...G...","AAABBBBH +AEABHHHH +AEABBBBB +CEAEGBFB +CEAEGBFB +CEEEGBFB +CCCDGBFB +DDDDGBBB",8x8,8 +6x6_6c_7_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_6c_4_5f121b29.txt,"........ +......B. +.....C.. +.....A.E +F...D... +E.C.A.F. +....B.D. +........","FFFFFFFF +FBBBBBBF +FBCCCCFF +FBCAAAFE +FBCADDFE +EBCAADFE +EBBBBDDE +EEEEEEEE",8x8,6 +5x5_5c_6_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +7x7_5c_4_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_7c_2_d3be7e23.txt,".C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF..","CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF",7x7,7 +6x6_4c_4_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_4_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +6x6_5c_8_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_9c_5_7e0506bb.txt,"FI....... +.E....... +...GA.... +.....G... +...D...B. +.....DA.. +..C....IB +..E..C... +....FH..H","FIIIIIIII +FEBBBBBBI +FEBGAAABI +FEBGGGABI +FEBDDDABI +FEBBBDAII +FECCBBBIB +FEECCCBBB +FFFFFHHHH",9x9,9 +8x8_7c_7_d86e8aab.txt,".D..FE.. +......A. +..A..... +...F.GCB +.E...... +......C. +.GB..... +.......D","DDFFFEEE +DFFAAAAE +DFAAEEEE +DFFFEGCB +DEEEEGCB +DGGGGGCB +DGBBBBBB +DDDDDDDD",8x8,7 +8x8_6c_6_176705c4.txt,"........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C","CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC",8x8,6 +7x7_7c_1_d3be7e23.txt,".C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF..","CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF",7x7,7 +6x6_4c_3_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +5x5_3c_10_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +10x10_10c_1_f58fcbac.txt,"H......... +..J..F.H.. +.......C.. +.DJDG.F... +.......... +.......G.. +BE.......C +......B... +.A..AI..E. +.........I","HDDDCCCCCC +HDJDCFFHHC +HDJDCCFCHC +HDJDGCFCHC +HHHHGCCCHC +BBBHGGGGHC +BEBHHHHHHC +EEBBBBBIII +EAAAAIIIEI +EEEEEEEEEI",10x10,10 +5x5_5c_6_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +9x9_9c_6_dd9b1f9e.txt,"......... +....H.... +..D...H.. +......... +EI....I.. +BF.C...DE +..FG....A +C...B.G.. +........A","EEEEEEEEE +EHHHHDDDE +EHDDDDHDE +EHHHHHHDE +EIIIIIIDE +BFFCCCCDE +BBFGGGCCA +CBBBBGGCA +CCCCCCCCA",9x9,9 +5x5_5c_5_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +6x6_5c_8_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +5x5_3c_9_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +5x5_5c_5_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +7x7_7c_4_331bf87b.txt,"......E +.GAEF.F +....... +.CBG.D. +....... +.CB.D.. +....A..","AAAEEEE +AGAEFFF +AGGGAAA +ACBGADA +ACBAADA +ACBADDA +AAAAAAA",7x7,7 +7x7_6c_10_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +10x10_10c_1_a63c6afb.txt,"..B......E +.......... +........C. +.E.GC..... +.......BG. +F.......J. +......D..H +.D.J..I.A. +.......... +F......IHA","BBBEEEEEEE +BEEEJJJJJJ +BEJJJCCCCJ +BEJGCCGGGJ +BBJGGGGBGJ +FBJJBBBBJJ +FBBJBDDHHH +FDBJBDIHAA +FDBBBDIHHA +FDDDDDIIHA",10x10,10 +9x9_9c_9_503c7f99.txt,"...B..... +EH..A...A +....F.G.. +H......G. +......... +...D...CI +..D...... +....CBF.. +..E.....I","EEEBAAAAA +EHEBAFFFA +HHEBFFGFF +HEEBBBGGF +EECCCBFFF +ECCDCBFCI +ECDDCBFCI +ECCCCBFCI +EEECCCCCI",9x9,9 +5x5_5c_9_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_5c_4_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +9x9_8c_6_08c857eb.txt,"B........ +H.....F.. +......GF. +H..D..... +G.A.E.... +........B +.C....E.D +...C..A.. +.........","BBBBBBBBB +HGGGGGFFB +HGAAAGGFB +HGADAAAAB +GGADEEEAB +GGGDDDEAB +GCGGGDEAD +GCCCGDAAD +GGGGGDDDD",9x9,8 +8x8_7c_9_aad8ae11.txt,"...A.... +...DFE.. +..B..... +....G... +...C...F +A..G.... +EDC...B. +........","AAAAFFFF +ADDDFEEF +ADBBBBEF +ADGGGBEF +ADGCCBEF +ADGGCBEE +EDCCCBBE +EEEEEEEE",8x8,7 +5x5_3c_7_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_7c_5_d4345423.txt,"........ +.C...... +..AF.D.. +....DG.. +........ +F.E..... +G.BEB.C. +......A.","AAAAAAAA +ACCCCCCA +AAAFDDCA +FFFFDGCA +FBBBBGCA +FBEEBGCA +GBBEBGCA +GGGGGGAA",8x8,7 +5x5_3c_8_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +8x8_8c_1_67d5ba9e.txt,".....HGD +..FB.... +..H..G.. +B.D....F +A....... +.EC..... +....E.A. +......C.","BBBBHHGD +BFFBHGGD +BFHHHGDD +BFDDDDDF +AFFFFFFF +AECCCCCC +AEEEEAAC +AAAAAACC",8x8,8 +6x6_5c_10_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +8x8_7c_2_50f367b4.txt,".C....AG +.A.E.... +..F.DB.. +D......G +...BE... +......F. +.C...... +........","CCAAAAAG +CAAEDDDG +CCFEDBDG +DCFEEBDG +DCFBEBDD +DCFBBBFD +DCFFFFFD +DDDDDDDD",8x8,7 +6x6_4c_10_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +6x6_6c_3_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +5x5_3c_6_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +7x7_7c_2_a92aa206.txt,"FG..... +...FDEG +D...... +B.....E +A...A.C +....... +BC.....","FGGGGGG +FFFFDEG +DDDDDEE +BBBBBBE +AAAAABC +BBBBBBC +BCCCCCC",7x7,7 +8x8_6c_1_14765f5e.txt,"........ +.F.....C +.B.F.E.. +........ +D...A.E. +..B..... +...C..DA +........","CCCCCCCC +CFFFDDDC +CBBFDEDD +CCBDDEED +DCBDAAED +DCBDDADD +DCCCDADA +DDDDDAAA",8x8,6 +6x6_4c_6_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_5c_3_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +6x6_5c_10_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_8c_6_86c5e3a0.txt,".EF...AH +.G.CF... +...A...B +.....C.. +........ +E...DG.. +..H..... +DB......","EEFFFAAH +EGCCFAHH +EGCAAAHB +EGCCCCHB +EGGGGGHB +EDDDDGHB +DDHHHHHB +DBBBBBBB",8x8,8 +10x10_9c_9_61ffb2de.txt,".F...B.... +.A.H.H.I.. +.......... +F.......I. +...DAD...C +.G.....E.. +...B....G. +.......... +.......... +.....EC...","FFBBBBCCCC +FABHHHCIIC +FABBBBCCIC +FAAAABBCIC +EEEDADBCCC +EGEDDDBECC +EGEBBBBEGC +EGEEEEEEGC +EGGGGGGGGC +EEEEEECCCC",10x10,9 +6x6_6c_10_3a68d0e8.txt,"BA...A +..E... +..D.F. +..F..D +..C.CE +B.....","BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE",6x6,6 +5x5_4c_8_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_9c_3_bb39e0a5.txt,"C.GD..... +H......A. +..G.D.... +H........ +B..I....I +...F.BE.. +...A...E. +....C..F. +.........","CCGDDDDDD +HCGAAAAAD +HCGADDDDD +HCAAIIIII +BCAIIBBBI +BCAFFBEBB +BCAAFFEEB +BCCCCFFFB +BBBBBBBBB",9x9,9 +9x9_8c_5_e51c3380.txt,"C......F. +.E...H... +...G.AHE. +..G....B. +......... +.C.A...D. +B........ +F.....D.. +.........","CEEEEEEFF +CEHHHHEEF +CHHGAAHEF +CHGGAHHBF +CHHAAHBBF +CCHAHHBDF +BBHHHBBDF +FBBBBBDDF +FFFFFFFFF",9x9,8 +9x9_7c_3_b3558dd5.txt,"........G +....A.... +G.C...... +B...F.B.. +......... +.C.F..... +.D....E.E +..D..A... +.........","GGGGGGGGG +GBBBAAAAA +GBCBFFFFA +BBCBFBBFA +CCCBBBFFA +CCCFFFFAA +CDCCEEEAE +CDDCEAAAE +CCCCEEEEE",9x9,7 +7x7_7c_5_ae0f223a.txt,".....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G","CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG",7x7,7 +10x10_9c_3_bf7c15fb.txt,".......F.. +.....C..A. +..H.HG.... +.......... +......D.G. +..AE...... +.......... +.D..I.FE.. +.I......C. +....B.B...","AAAAAAAFFF +ACCCCCAAAF +ACHHHGGGGF +ACCCCCCCGF +ADDDDDDCGF +ADAEEEECCF +ADAAAAEECF +ADIIIAFECF +AIIAAAFFCF +AAAABBBFFF",10x10,9 +8x8_6c_3_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +8x8_6c_7_1f3b452b.txt,"........ +.B..CF.. +......F. +..D.A... +..C....A +......BD +.E....E. +........","DDDCCCCC +DBDCCFFC +DBDCCCFC +DBDCACCC +DBCCAAAA +DBBBBBBD +DEEEEEED +DDDDDDDD",8x8,6 +7x7_6c_8_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +8x8_7c_8_d3386298.txt,"EA..B..B +........ +.D...... +.....EG. +........ +..G..ACF +........ +DC...F..","EAAABBBB +EEEAAAAA +DDEGGGGA +DEEGEEGA +DEGGEAAA +DEGEEACF +DEEECCCF +DCCCCFFF",8x8,7 +10x10_9c_5_ce9aa220.txt,".H........ +.D........ +....BI.IH. +.....E.... +........DE +.....G.... +B..A...... +F....G..A. +.....C.... +...F....C.","HHDDDDDDDD +HDDHHHHHHD +HHHHBIIIHD +BBBBBEEEDD +BAAAAAAEDE +BAGGGGAEEE +BAGAAAACCC +FAGGGGCCAC +FAAAACCAAC +FFFFAAAACC",10x10,9 +5x5_3c_6_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_9c_7_d151790b.txt,"...H....A +HI...B..E +......I.. +......... +..C..GC.. +...F..... +......AD. +..F...D.. +BG..E....","HHHHIIIAA +HIIIIBIAE +BBBBBBIAE +BFFFCCCAE +BFCFCGCAE +BFCFCGAAE +BFCCCGADE +BFFGGGDDE +BGGGEEEEE",9x9,9 +6x6_6c_1_35b6178f.txt,"F.A.ED +....D. +..E..A +....C. +....FC +B....B","FAAEED +FAEEDD +FAEAAA +FAAACC +FFFFFC +BBBBBB",6x6,6 +8x8_8c_9_3b537bc3.txt,".F.....H +.E....A. +....D.GA +.......C +.E...G.. +.BH..B.. +........ +FD...C..","FFHHHHHH +FEHGGGAA +FEHGDGGA +FEHGDDDC +FEHGGGDC +FBHBBBDC +FBBBDDDC +FDDDDCCC",8x8,8 +5x5_3c_1_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +9x9_7c_9_d3ff1418.txt,"...EA..B. +.C....... +...CD.... +.....G... +..F...... +....D.... +...AG.... +.F..E.... +........B","CCCEAAABB +CCCEEEAAB +CCCCDEEAB +CCCCDGEAB +CFFCDGEAB +CFCCDGEAB +CFCAGGEAB +CFCAEEEAB +CCCAAAAAB",9x9,7 +9x9_9c_4_28d534c2.txt,"..D.HB... +......... +..CF.B... +.H..AG.F. +..E...... +......I.I +D..G..... +.......A. +EC.......","DDDHHBBBB +DHHHFFFFB +DHCFFBBFB +DHCCAGBFB +DEECAGBBB +DECCAGIII +DECGAGGGG +EECGAAAAG +ECCGGGGGG",9x9,9 +8x8_7c_9_9d87e141.txt,"B...G..G +....ED.D +.EF..... +..B...A. +........ +........ +.C..FA.. +...C....","BBBBGGGG +FFFBEDDD +FEFBECCC +FEBBECAC +FEEEECAC +FCCCCCAC +FCFFFAAC +FFFCCCCC",8x8,7 +5x5_5c_8_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +5x5_4c_3_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +9x9_8c_9_fe00bcd5.txt,"D.....FC. +......B.. +....F.C.. +......... +..H.HA... +D...E.... +.......B. +......... +EAG.....G","DFFFFFFCC +DFHHHHBBC +DFHFFHCBC +DFHFHHCBC +DFHFHACBC +DFFFEACBC +EEEEEACBC +EAAAAACCC +EAGGGGGGG",9x9,8 +7x7_5c_1_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +8x8_7c_6_d2bfa7eb.txt,"........ +.E...... +..FA.... +....B... +.F.A..E. +...G.... +BC...DG. +...DC...","CCCCCCCC +CEEEEEEC +CFFAAAEC +CFBBBAEC +CFBAAAEC +CCBGGGGC +BCBDDDGC +BBBDCCCC",8x8,7 +6x6_6c_8_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_8c_3_671c264d.txt,".H...... +.CB...C. +....F... +.G...BA. +..H...D. +EG...DF. +.A...... +..E.....","HHBBBBBB +HCBCCCCB +HCCCFBBB +HGGGFBAA +HHHGFDDA +EGGGFDFA +EAAAFFFA +EEEAAAAA",8x8,8 +6x6_5c_6_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +9x9_7c_7_126ff9b4.txt,"...FG.... +..E....A. +.EF.B.... +.D....... +.....C.B. +......... +......... +.D......C +......A.G","FFFFGGGGG +FEEAAAAAG +FEFABBBBG +FDFAGGGBG +FDFAGCGBG +FDFAGCGGG +FDFAGCCCC +FDFAGGGGC +FFFAAAAGG",9x9,7 +7x7_7c_7_ef6fad8a.txt,"E..E... +..C..F. +.A.GF.. +...D..G +B...A.. +......D +....B.C","EEEEGGG +CCCGGFG +CAAGFFG +CCADDDG +BCAAADD +BCCCCCD +BBBBBCC",7x7,7 +9x9_9c_8_d1aea511.txt,".......A. +......... +.CH...... +...F..... +...EGH..A +.I...C..E +...IGF... +.B....... +BD......D","FFFFFFFAA +FCCCCCFFA +FCHHHCCFA +FFFFHHCFA +EEEEGHCFA +EIIIGCCFE +EEEIGFFFE +BBEEEEEEE +BDDDDDDDD",9x9,9 +8x8_8c_1_25624d86.txt,".......H +.....F.. +..G..B.. +...BH... +A..C.... +........ +F.EGC.A. +E.D.D...","AAAAAAAH +AFFFFFAH +AFGBBBAH +AFGBHHAH +AFGCCHAH +FFGGCHAH +FEEGCHAH +EEDDDHHH",8x8,8 +6x6_6c_9_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +9x9_9c_7_71aa2cff.txt,"....BA... +B......C. +..E..E... +I........ +..G...... +......... +.C....G.A +.FDF....H +I.....DH.","BBBBBAAAA +BIIIIIICA +IIEEEEICA +IIIIIIICA +IIGGGGGCA +ICCCCCGCA +ICDDDCGCA +IFDFDCCCH +IFFFDDDHH",9x9,9 +7x7_6c_4_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +6x6_6c_9_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +7x7_6c_9_2a5b24a6.txt,"D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA...","DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF",7x7,6 +7x7_7c_3_f76c93f4.txt,"E...D.B +AE.B..F +.G.CF.. +..D...C +..A.... +.....G. +.......","EEDDDBB +AEDBBBF +AGDCFFF +AGDCCCC +AGAAAAA +AGGGGGA +AAAAAAA",7x7,7 +8x8_8c_6_410da633.txt,"D....DE. +........ +.B.C.... +.G..H... +A..HB..E +C......F +....A.G. +......F.","DDDDDDEE +GGGGGGGE +GBBCCCGE +GGBHHCGE +AABHBCGE +CABBBCGF +CAAAACGF +CCCCCCFF",8x8,8 +10x10_9c_4_ee625044.txt,".....I..C. +......D..C +..H....... +.F......A. +.......... +.EG.B..... +.H....GD.. +.B.....F.. +....E..... +A.....I...","GGGGGIIICC +GFFFGGDIIC +GFHFFGDDII +GFHHFGGDAI +GGGHFFGDAI +EEGHBFGDAI +EHHHBFGDAI +EBBBBFFFAI +EEEEEAAAAI +AAAAAAIIII",10x10,9 +5x5_3c_5_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +6x6_4c_2_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +6x6_4c_8_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_7c_8_a7b3eb1c.txt,"......F +..B...G +.BD...A +.E.G.CF +...DA.. +....EC. +.......","FFFFFFF +FBBGGGG +FBDGAAA +FEDGACF +FEDDACF +FEEEECF +FFFFFFF",7x7,7 +6x6_6c_5_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +8x8_6c_3_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +8x8_8c_8_6ac110ec.txt,"........ +.F..C... +..D..BCF +D....... +.G.AB.G. +.HA..... +.......H +.....E.E","DDDFFFFF +DFDFCCCF +DFDFBBCF +DFFFBHHH +GGAABHGH +GHAHHHGH +GHHHGGGH +GGGGGEEE",8x8,8 +10x10_9c_7_6588d764.txt,"I.HA...... +....EB.... +.......... +..A....... +.....GF... +..D....... +..I.E..... +........B. +.D.CF.G.H. +....C.....","IHHAEEEEEE +IHAAEBBBBE +IHAHHHHHBE +IHAHFFFHBE +IHHHFGFHBE +IDDFFGGHBE +IDIFEEGHBE +IDIFFEGHBE +IDICFEGHHE +IIICCEEEEE",10x10,9 +5x5_5c_8_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_4c_5_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +7x7_6c_6_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +6x6_5c_1_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +8x8_8c_5_76af8782.txt,"C....... +..BHEDFE +....B... +....HDA. +.C...... +........ +.G...A.. +.....G.F","CHHHEEEE +CHBHEDFE +CHBBBDFF +CHHHHDAF +CCAAAAAF +AAAGGGGF +AGGGAAGF +AAAAAGGF",8x8,8 +7x7_5c_9_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +9x9_7c_8_72f89e8a.txt,"....F.... +..E..AFB. +..A...... +...E..... +.GD...... +......B.. +.DG..C... +.......C. +.........","AAAAFAAAA +AEEAFAFBA +AEAAFFFBA +AEEEBBBBA +AGDDBCCCA +AGGDBCBCA +ADGDBCBCA +ADDDBBBCA +AAAAAAAAA",9x9,7 +7x7_5c_4_629a2f5e.txt,"...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E...","CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA",7x7,5 +5x5_5c_5_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +10x10_9c_1_eb7c4808.txt,".......... +.G...C.F.. +...A.G.... +.A.......E +.D........ +..H.B..... +..C....... +.......H.. +.D........ +....I.BIEF","CCCCCCEEEE +CGGGGCEFFE +CAAAGGEEFE +CAHHHHHEFE +CDHIIIHEFF +CDHIBIHEEF +CDCIBIHHEF +CDCIBIIHEF +CDCIBBIIEF +CCCIIBBIEF",10x10,9 +7x7_6c_8_220f13d1.txt,".F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA","FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA",7x7,6 +7x7_5c_7_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +6x6_6c_4_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +6x6_4c_1_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_5c_8_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +7x7_7c_5_c7b7fb36.txt,".....D. +...C.F. +.C..... +.D.BF.G +..B...A +E....G. +....EA.","FFFFFDD +FCCCFFD +FCDDDDD +FDDBFGG +FFBBFGA +EFFFFGA +EEEEEAA",7x7,7 +5x5_5c_4_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_6c_2_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +9x9_7c_5_64e8fc42.txt,".....A... +.GD...... +..G.....A +.B....... +....CB.E. +........C +.E......D +......... +F.......F","CCCCCAAAA +CGDDCCCCA +CGGDDDDCA +CBBBBBDCC +CCCCCBDEC +DDDDDDDEC +DEEEEEEED +DDDDDDDDD +FFFFFFFFF",9x9,7 +9x9_7c_8_bb2794e7.txt,".EA....CG +E........ +D....F... +...A..... +....B.... +......CB. +......... +.....G... +...D....F","EEAAAAACG +EFFFFFACG +DFBBBFACG +DFBABAACG +DFBABACCG +DFBAAACBG +DFBBBBBBG +DFFFFGGGG +DDDDFFFFF",9x9,7 +8x8_6c_5_176705c4.txt,"........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C","CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC",8x8,6 +7x7_7c_6_96ca9115.txt,"F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C","FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC",7x7,7 +9x9_9c_4_f2284643.txt,"........C +....F.EA. +..G...I.. +....F.E.. +..G.B..IC +..H...... +....H.... +..D...D.. +A.......B","AAAAAAAAC +AHHHFEEAC +AHGHFEIIC +AHGHFEEIC +AHGHBBBIC +AHHHHHBBB +AHHHHHHHB +AHDDDDDHB +AHHHHHHHB",9x9,9 +10x10_10c_2_a39d9d3d.txt,"AB......BD +.....A.... +E...I..J.J +......G... +...I...... +..C..G.... +E......... +FCH....... +.....H..D. +...F......","ABBBBBBBBD +AAAAAADDDD +EIIIIDDJJJ +EICCCDGGGG +EICICDDDDG +EICICGGGDG +EIIICCCGDG +FCHHHHCGDG +FCCCCHCGDG +FFFFCCCGGG",10x10,10 +5x5_3c_6_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +8x8_8c_9_12367174.txt,"........ +......F. +...H.... +.F.E.C.A +E..D.... +G.B....A +...H.... +..GB..DC","EEEEEEEE +EFFFFFFE +EFHHEEEE +EFHEECCA +EHHDDDCA +GHBBBDCA +GHHHBDCC +GGGBBDDC",8x8,8 +8x8_6c_8_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +6x6_5c_1_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +7x7_5c_10_799f6348.txt,"C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B","CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB",7x7,5 +8x8_8c_1_9c6e60cd.txt,"......G. +.FE..... +.......G +........ +.HABF.EA +HB...... +......D. +CD....C.","AAAAAAGG +AFEEEAAG +AFFFEEAG +AAAFFEAA +HHABFEEA +HBBBCCCC +CCCCCDDC +CDDDDDCC",8x8,8 +5x5_5c_9_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +9x9_8c_10_2471bb38.txt,"........D +.E...F..A +......... +A..BG.... +E..C...D. +......... +.GC...... +.....H.H. +.FB......","AAAAAAADD +AEFFFFADA +AEFBBBADA +AEFBGBADA +EEFCGBADA +FFFCGBAAA +FGCCGBBBB +FGGGGHHHB +FFBBBBBBB",9x9,8 +6x6_6c_7_f86ee188.txt,"BD...E +.ED.C. +....A. +...... +BAC... +F....F","BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF",6x6,6 +5x5_5c_2_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +7x7_7c_10_547f74fe.txt,"C.....A +..E...G +....... +.C.E... +...B.AG +BF..... +D....DF","CBBBBAA +CBEEBAG +CBBEBAG +CCBEBAG +BBBBBAG +BFFFFFF +DDDDDDF",7x7,7 +6x6_5c_5_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +5x5_3c_3_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +5x5_5c_1_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +5x5_4c_9_904e33b2.txt,"..... +.D.AB +B.ADC +C.... +.....","BBBBB +BDAAB +BDADC +CDDDC +CCCCC",5x5,4 +9x9_7c_7_dce8ae70.txt,"....FG... +.......B. +.AE..D... +...C..... +..DE..... +......... +..A...... +......C.. +.FB.....G","FFFFFGGGG +FAAAAAABG +FAEEEDABG +FCCCEDABG +FCDEEDABG +FCDDDDABG +FCAAAAABG +FCCCCCCBG +FFBBBBBBG",9x9,7 +9x9_9c_8_da5d128a.txt,"...GB..BE +......... +......... +.F....... +.A..H.... +.DC...... +...H..A.. +.I..D.... +G...ICFE.","GGGGBBBBE +GFFFFFFFE +GFAAAAAFE +GFACCCAFE +GAACHCAFE +GDCCHCAFE +GDDHHCAFE +GIDDDCFFE +GIIIICFEE",9x9,9 +5x5_3c_1_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_5c_10_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +8x8_7c_4_2a92f0be.txt,"D....BGE +F....... +.D..A... +.......F +C..E.A.. +..B..G.. +........ +.C......","DDBBBBGE +FDBGGGGE +FDBGAAEE +FFBGGAEF +CFBEGAEF +CFBEGGEF +CFFEEEEF +CCFFFFFF",8x8,7 +8x8_6c_2_5e9b9218.txt,"A......B +...C.... +.E...... +...F.... +........ +F......B +.DE..C.. +......DA","AAAAAAAB +DDDCCCAB +DEDDDCAB +DEEFDCAB +DDEFDCAB +FDEFDCAB +FDEFDCAA +FFFFDDDA",8x8,6 +9x9_7c_10_67766dd4.txt,"B......C. +.......G. +......... +...F.E.G. +.A.A.D... +...D....B +F........ +....E..C. +.........","BBBBBBBCC +EEEEEEBGC +EAAAAEBGC +EAFFAEBGC +EAFAADBCC +EEFDDDBCB +FEFFFFBCB +FEEEEFBCB +FFFFFFBBB",9x9,7 +9x9_8c_8_aab17324.txt,"...DH.... +.G.....C. +...D..... +...EHB..F +......... +.AEF..... +......BC. +.A..G.... +.........","EEEDHBBBB +EGEDHBCCB +EGEDHBCBB +EGEEHBCBF +EGGGGCCBF +EAEFGCBBF +EAEFGCBCF +EAEFGCCCF +EEEFFFFFF",9x9,8 +7x7_5c_3_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +5x5_4c_7_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +5x5_5c_3_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_6c_4_dc1bb401.txt,".....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB","DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB",8x8,6 +6x6_4c_5_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +5x5_3c_10_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +7x7_5c_8_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +8x8_6c_8_b948f6b0.txt,".CB....B +..D..AF. +........ +.....A.. +........ +...E.E.. +......D. +C.....F.","CCBBBBBB +CDDAAAFF +CDAAEEEF +CDAEEAEF +CDAEAAEF +CDAEAEEF +CDAAADDF +CDDDDDFF",8x8,6 +6x6_5c_4_3ac21572.txt,"...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C","BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC",6x6,5 +7x7_5c_7_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +5x5_4c_10_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +6x6_4c_9_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +8x8_7c_2_82209848.txt,".......E +.F...F.. +........ +..AD.G.. +.......C +.D..G.E. +.A....B. +BC......","BBBBBBBE +BFFFFFBE +BDDDBBBE +BDADBGEE +BDABBGEC +BDABGGEC +BAABBBBC +BCCCCCCC",8x8,7 +5x5_5c_10_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +6x6_5c_2_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +10x10_9c_2_fd8c9afe.txt,"..DG...F.F +.E........ +....D...H. +......GA.. +...C...B.. +..I....H.A +......B... +...I....E. +.C........ +..........","DDDGGGGFFF +DEEEEEGAAA +DDDDDEGAHA +IIIIIEGAHA +ICCCIEBBHA +ICIIIEBHHA +ICEEEEBIII +ICEIIIIIEI +ICEEEEEEEI +IIIIIIIIII",10x10,9 +7x7_6c_7_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +11x11_10c_1_2832e7ee.txt,"C....F..... +...J...F... +GH......E.. +........... +.D.J....... +...B....... +....IA.A... +....B...... +....C.E.I.. +..D.GH..... +...........","CCCCCFEEEEE +GGGJCFEFFFE +GHGJCFEEEFE +HHGJCFFFFFE +HDGJCCCCCCE +HDGBIIIIICE +HDGBIAAAICE +HDGBBCCCICE +HDGGCCECICE +HDDGGHECCCE +HHHHHHEEEEE",11x11,10 +7x7_7c_6_2c5e0644.txt,"......C +....A.A +..F..BD +.E.BE.. +.CF.... +....... +DG....G","CCCCCCC +CEEEAAA +CEFEEBD +CEFBEBD +CCFBBBD +DDDDDDD +DGGGGGG",7x7,7 +6x6_4c_7_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +6x6_4c_2_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +9x9_8c_8_43f37569.txt,".....DA.. +...H...B. +.....A... +......... +D...E..CH +G........ +....B.EGC +........F +.......F.","DDDDDDAAA +DHHHBBBBA +DHBBBAAAA +DHBHHHHHH +DHBHEEECH +GHBHHHECC +GHBBBHEGC +GHHHHHGGF +GGGGGGGFF",9x9,8 +10x10_9c_4_2e90136f.txt,"IC........ +.G......B. +..IA...HC. +.......... +.FD....... +.......G.. +.......A.. +.......... +.F......D. +BE....EH..","ICCCCCCCCC +IGGGGGBBBC +IIIAAGBHCC +BBBBAGBHHH +BFDBAGBBBH +BFDBAGGGBH +BFDBAAAABH +BFDBBBBBBH +BFDDDDDDDH +BEEEEEEHHH",10x10,9 +9x9_9c_2_b0120833.txt,"B...D.... +.EF.I..AD +........G +B...I..E. +......... +....C.... +..A.G.C.. +......... +FH.H.....","BEEEDDDDD +BEFEIAAAD +BFFEIAGGG +BFEEIAGEE +FFEAAAGGE +FEEACCCGE +FEAAGGCGE +FEEEEGGGE +FHHHEEEEE",9x9,9 +7x7_5c_7_a2f64424.txt,"E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D......","EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD",7x7,5 +6x6_6c_5_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_7c_1_492d5742.txt,"......F +.B..C.C +..F.... +..G.... +.A..BA. +.E.E... +...GD.D","FFFFFFF +FBBBCCC +FFFBBBB +GGGAAAB +GAAABAB +GEEEBBB +GGGGDDD",7x7,7 +6x6_4c_9_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +7x7_5c_9_799f6348.txt,"C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B","CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB",7x7,5 +9x9_8c_9_5fb7c0cf.txt,".....E..E +......... +..H....B. +A........ +C...D.... +.......AD +......... +CBH....F. +G...FG...","AAAAAEEEE +ABBBAAAAA +ABHBBBBBA +ABHAAAAAA +CBHADDDDD +CBHAAAAAD +CBHGGGGGG +CBHGFFFFG +GGGGFGGGG",9x9,8 +5x5_4c_9_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +8x8_7c_7_d0b91616.txt,".....FA. +.G....B. +.C...... +...F...A +D..EC..G +..D..... +..E..B.. +........","FFFFFFAA +FGGGGGBA +FCCCCGBA +FFFFCGBA +DEEECGBG +DEDDGGBG +DEEDGBBG +DDDDGGGG",8x8,7 +8x8_6c_7_82c77513.txt,"........ +........ +..B..AD. +.D.F.... +.....E.. +..C..... +.B...A.. +.CE..F..","FFFFFFFF +FDDDDDDF +FDBBBADF +FDFFBAAF +FFFBBEAF +CCCBEEAF +CBBBEAAF +CCEEEFFF",8x8,6 +6x6_6c_10_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +8x8_6c_1_70510986.txt,".....BA. +.C..C.E. +......D. +..F..... +...D.... +...F.E.. +......A. +..B.....","BBBBBBAA +BCCCCEEA +BEEEEEDA +BEFDDDDA +BEFDAAAA +BEFFAEEE +BEEEAAAE +BBBEEEEE",8x8,6 +9x9_7c_6_8fa5441c.txt,"..BF....G +.....C... +.F....EC. +...DA...E +G....A... +.....D.B. +......... +......... +.........","BBBFGGGGG +BFFFGCEEE +BFGGGCECE +BBGDACCCE +GBGDAAGGG +GBGDDDGBG +GBGGGGGBG +GBBBBBBBG +GGGGGGGGG",9x9,7 +5x5_4c_4_812f5e6a.txt,"AB... +...C. +DA... +.C.BD +.....","ABBBB +AACCB +DACBB +DCCBD +DDDDD",5x5,4 +5x5_5c_6_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +8x8_6c_1_60c183b5.txt,".A...... +.B....D. +..F..... +.FD..... +...EB.A. +..C..... +.E...... +...C....","AABBBBBB +ABBDDDDB +AFFDBBBB +AFDDBCCC +AEEEBCAC +AECCCCAC +AEAAAAAC +AAACCCCC",8x8,6 +7x7_6c_5_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +10x10_9c_1_8bb56a0a.txt,".......... +DH..B..... +I.I......D +.....G.... +.G..AF...B +.......EAC +...H...... +......E..F +......C... +..........","DDDDDDDDDD +DHHHBBBBBD +IIIHAAAABD +FFFHAGGABB +FGFHAFGAAB +FGFHFFGEAC +FGFHFGGECC +FGFFFGEECF +FGGGGGCCCF +FFFFFFFFFF",10x10,9 +8x8_7c_3_18741047.txt,".....D.B +......BE +......F. +...G.C.. +....E..G +..C.A.A. +..F..... +.......D","DDDDDDBB +DFFFFFBE +DFCCCFFE +DFCGCCEE +DFCGEEEG +DFCGAAAG +DFFGGGGG +DDDDDDDD",8x8,7 +7x7_6c_10_edc5ddf1.txt,"A...... +.....F. +.D..... +...D..A +FEBE..C +....B.. +......C","AAAAAAA +BBBBBFA +BDDDBFA +BBBDBFA +FEBEBFC +FEEEBFC +FFFFFFC",7x7,6 +9x9_9c_1_80802004.txt,"...E..... +.B....... +...B..F.. +DA....... +...G....E +...A..... +H..D..... +.G....IF. +...HC..CI","EEEEEEEEE +EBBBEIIIE +EEEBEIFIE +DAEEEIFIE +DAAGGIFIE +DDAAGIFII +HDDDGIFFI +HGGGGIIFI +HHHHCCCCI",9x9,9 +6x6_4c_5_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +9x9_9c_3_93eaa6a8.txt,"D...IG.EF +.I...C... +.C.DG.... +....E.... +.....A... +..A..H.B. +..B....F. +.......H. +.........","DIIIIGGEF +DICCCCGEF +DCCDGGGEF +DDDDEEEEF +BBBBAAFFF +BAABAHFBB +BABBAHFFB +BAAAAHHHB +BBBBBBBBB",9x9,9 +9x9_7c_2_fd249655.txt,".F....... +.......E. +....G.... +........D +......... +..A.....D +..EGA.F.B +.C.....C. +.......B.","FFCCCCCCC +FCCAAAEEC +FCAAGAECC +FCAGGAECD +FCAGAAECD +FCAGAEECD +FCEGAEFCB +FCEEEEFCB +FFFFFFFBB",9x9,7 +5x5_3c_2_3b862eec.txt,"A.... +.B.B. +...C. +..C.. +A....","ABBBB +ABBBB +ABBCB +ABCCB +ABBBB",5x5,3 +6x6_4c_1_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +6x6_6c_1_c60e480c.txt,"F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C","FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC",6x6,6 +7x7_5c_5_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +7x7_6c_2_d5cc36f7.txt,"B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +.......","BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB",7x7,6 +6x6_4c_6_f296c06e.txt,"...... +...... +...B.D +...C.. +.....A +DA.B.C","DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC",6x6,4 +7x7_6c_2_21b01e0e.txt,"...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE","AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE",7x7,6 +5x5_5c_9_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +8x8_7c_3_71726d93.txt,"....D..G +.C...... +....C... +B.A..... +....F... +.E.E.D.. +.A.F.G.B +........","EEEEDDDG +ECCEEEDG +EECCCEDG +BEAEEEDG +BEAEFDDG +BEAEFDGG +BAAFFGGB +BBBBBBBB",8x8,7 +9x9_8c_10_3e7e1f61.txt,"....BE... +.A..E..F. +......G.. +......... +...B.D... +......... +C..D..H.. +....A..FG +C.......H","DDDBBEGGG +DADBEEGFG +DADBBBGFG +DADDDBBFG +DAABDDBFG +DDABBBBFG +CDADDDHFG +CDAAADHFG +CDDDDDHHH",9x9,8 +7x7_6c_6_13d5d5cf.txt,"......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A","DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA",7x7,6 +9x9_8c_3_01959e84.txt,"C........ +......... +......... +.....G.F. +...HB..E. +......... +F.BHGE.A. +D.....CD. +........A","CCCCCCCCC +FFFFFFFFC +FEEEEEEFC +FEBBBGEFC +FEBHBGEEC +FEBHGGCCC +FEBHGECAA +DEEEEECDA +DDDDDDDDA",9x9,8 +10x10_9c_8_84b82713.txt,".......B.B +.........A +.DC....... +......F... +......H.I. +.G...F.DA. +.......... +.......I.. +...E...C.. +E...G....H","IIIIIIIBBB +IDDDDDIIIA +IDCCCDDDIA +IIIICFFDIA +EEEICFHDIA +EGEICFHDAA +EGEICCHHHH +EGEIICCIIH +EGEEIICCIH +EGGGGIIIIH",10x10,9 +5x5_3c_3_3b79ecca.txt,"..... +B..C. +...A. +.A.B. +....C","BBBBB +BCCCB +CCAAB +CAABB +CCCCC",5x5,3 +6x6_5c_3_25f9a72a.txt,"C.D... +....B. +...B.. +....E. +C.A..E +D....A","CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA",6x6,5 +9x9_8c_4_36602eab.txt,"D........ +E...B.... +..H....B. +.G...E.C. +..A...... +........D +..HA...F. +.......CF +........G","DDDDDDDDD +EGGGBBBBD +EGHGGGGBD +EGHHEEGCD +EAAHEGGCD +EAHHEGCCD +EAHAEGCFF +EAAAEGCCF +EEEEEGGGG",9x9,8 +9x9_7c_2_056744a7.txt,"....A...D +.FB...C.. +......E.. +ACG...... +......... +.....B... +..D.F.... +..G...E.. +.........","AAAAADDDD +AFBBBDCCC +AFFFBDEEC +ACGFBDDEC +CCGFBBDEC +CGGFFBDEC +CGDDFDDEC +CGGDDDEEC +CCCCCCCCC",9x9,7 +5x5_5c_1_4f5ec3ca.txt,"DECB. +..... +..E.B +DC..A +A....","DECBB +DECCB +DEECB +DCCCA +AAAAA",5x5,5 +9x9_8c_4_a50e0622.txt,"D.......D +...GE...E +......... +..H.....C +......... +.......B. +.BA...C.. +...GA.... +F.FH.....","DDDDDDDDD +GGGGEEEEE +GCCCCCCCC +GCHHHHHHC +GCCCCCCHH +GBBBBBCBH +GBAAABCBH +GGGGABBBH +FFFHHHHHH",9x9,8 +8x8_8c_4_f967b217.txt,"GBHF.... +......H. +.B....G. +.....AE. +....FC.. +.AD...E. +......C. +...D....","GBHFFFFF +GBHHHHHF +GBGGGGGF +GGGAAAEF +DDDAFCEF +DADAFCEF +DAAAFCCF +DDDDFFFF",8x8,8 +8x8_8c_7_a3396780.txt,"........ +.E..E.A. +CD.B..G. +..BA.... +....G.F. +..H.CH.. +......F. +D.......","CCCCCCCC +CEEEEAAC +CDBBAAGC +DDBAAGGC +DCCCGGFC +DCHCCHFC +DCHHHHFC +DCCCCCCC",8x8,8 +7x7_5c_10_d45b6049.txt,"......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE...","DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE",7x7,5 +7x7_7c_9_0d9589a3.txt,"..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G","EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG",7x7,7 +8x8_8c_4_da9b061d.txt,"BC...... +...HA... +..B..... +..ED...C +...E...A +..D....F +....H.FG +......G.","BCCCCCCC +BHHHAAAC +BHBBBBAC +BHEDDBAC +BHEEDBAA +BHDDDBFF +BHHHHBFG +BBBBBBGG",8x8,8 +5x5_5c_7_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +7x7_7c_7_dae1eb3d.txt,"FD.D... +.....A. +F.B...C +G...C.B +....E.. +.E.A... +.G.....","FDDDCCC +FEEECAC +FEBECAC +GEBECAB +GEBEEAB +GEBAAAB +GGBBBBB",7x7,7 +6x6_4c_8_a09192ab.txt,"C.B... +A..... +...A.. +.D.... +.C.B.. +.....D","CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD",6x6,4 +10x10_9c_9_cd48935d.txt,"......H... +CE......H. +I......... +..C.F..... +..B....F.. +.......... +..B....... +I.E....D.. +..A..DG... +AG........","CCCHHHHFFF +CECHFFFFHF +IECHFHHHHF +IECHFHGGGF +IEBHHHGFGF +IEBGGGGFGF +IEBGFFFFGF +IEEGFDDDGF +AAAGFDGGGF +AGGGFFFFFF",10x10,9 +8x8_6c_10_ee06545b.txt,"..BC...F +.E...... +....BE.. +........ +.FD..D.. +.......C +........ +A......A","BBBCCCCF +BEEEEECF +BBBBBECF +CCCCCCCF +CFDDDDFF +CFFFFFFC +CCCCCCCC +AAAAAAAA",8x8,6 +8x8_6c_5_271db818.txt,"CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........","CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE",8x8,6 +7x7_5c_8_9adff41d.txt,"C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D......","CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD",7x7,5 +10x10_9c_10_48c869f8.txt,".......... +.......... +.......... +....GI.... +..DGF....C +......I... +....E.FDA. +..B.HC.... +.H..B..E.. +.........A","CCCCCCCCCC +CEEEEEEEEC +CEDDDDDDEC +CEDGGIIDEC +CEDGFFIDEC +CEEEEFIDEE +CHHHEFFDAE +CHBHHCAAAE +CHBBBCAEEE +CCCCCCAAAA",10x10,9 +6x6_6c_2_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +5x5_3c_2_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +8x8_6c_9_7d3b36a6.txt,"....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C","AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC",8x8,6 +7x7_5c_6_26f5cc22.txt,"DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E...","DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA",7x7,5 +9x9_8c_7_f1829bb0.txt,"G........ +.......A. +.H.D...C. +...G..... +E.......F +...A..... +.B....C.. +..D...B.. +E......HF","GHHHHHHHH +GHAAAAAAH +GHADDDCCH +GGAGGDCHH +EGAAGDCHF +EGGAGDCHF +EBGGGDCHF +EBDDDDBHF +EBBBBBBHF",9x9,8 +5x5_3c_9_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +6x6_4c_8_145c5d4f.txt,".....B +..AC.. +.....C +...D.. +.AB.D. +......","BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB",6x6,4 +5x5_5c_1_22075c83.txt,"C...C +..EDA +..... +.DEBA +....B","CCCCC +EEEDA +EDDDA +EDEBA +EEEBB",5x5,5 +5x5_3c_1_87fc29c5.txt,"...A. +.C.B. +..B.. +..C.. +....A","BBBAA +BCBBA +BCBBA +BCCBA +BBBBA",5x5,3 +6x6_6c_1_396060ff.txt,"AEF... +....D. +...DC. +B..... +....C. +.BA.EF","AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF",6x6,6 +10x10_9c_10_b9b91263.txt,"..FE.BG... +.D........ +.......I.. +.E........ +.F........ +..D.....A. +H.......G. +..HI...BC. +C......... +A.........","FFFEEBGGGG +FDDDEBBBBG +FFFDEIIIBG +EEFDEIBBBG +EFFDEIBGGG +EEDDEIBGAA +HEEEEIBGGA +HHHIIIBBCA +CCCCCCCCCA +AAAAAAAAAA",10x10,9 +5x5_5c_3_a482332b.txt,"E.DA. +C..B. +..... +..D.. +C.EBA","EEDAA +CEDBA +CEDBA +CEDBA +CEEBA",5x5,5 +8x8_8c_8_14eb01d5.txt,"F......H +.C..E..A +..EFDC.. +H....... +.G..GD.. +........ +BA...... +.......B","FCCCCCHH +FCEEECHA +FFEFDCHA +HFFFDDHA +HGGGGDHA +HHHHHHHA +BAAAAAAA +BBBBBBBB",8x8,8 diff --git a/submodules/flowfree/generate_puzzles.py b/submodules/flowfree/generate_puzzles.py new file mode 100644 index 0000000000000000000000000000000000000000..523d9197ab71b74ff44e50ae0c3c104764ef4af2 --- /dev/null +++ b/submodules/flowfree/generate_puzzles.py @@ -0,0 +1,260 @@ +#!/usr/bin/env python3 +""" +generate_puzzles.py + +Generate FlowFree puzzles by calling the C generator (./flowfree), +keep only those with exactly one solution, and save them to ./generated/. + +Each saved file contains: +1) a human-readable grid from convert_freeflow.py +2) the raw generator block (header + endpoint pairs) + +Defaults: +- k x k boards for k in [5..14] +- colors in [3..7] but not exceeding k +- 3 puzzles per (k, colors) + +Usage examples: + python generate_puzzles.py + python generate_puzzles.py --per-size 5 --colors 3-8 --progress 1000 + python generate_puzzles.py --exe ./flowfree --mindist 2 --forbid 0 + +Requirements in the same directory: +- ./flowfree (compiled C generator) +- ./convert_freeflow.py (your converter script that reads stdin and prints the quoted grid) +""" + +import argparse +import os +import re +import subprocess +import sys +from pathlib import Path +from typing import Optional, Tuple, List + +# --------- Parsing helpers (match the generator's output) --------- +HEADER_RE = re.compile(r"^\s*(\d+)\s+(\d+)\s+(\d+)\s*$") +PAIR_RE = re.compile(r"\(\s*(\d+)\s*,\s*(\d+)\s*\)\s*\(\s*(\d+)\s*,\s*(\d+)\s*\)") +SOLUTIONS_RE = re.compile(r"^\s*Solutions\s+(\d+)\s*$", re.IGNORECASE) + +def extract_first_puzzle_block(output: str) -> Optional[Tuple[str, int]]: + """ + From the program's stdout, find the first complete puzzle block and the + 'Solutions N' line. Return (raw_block_text, solutions_count) or None. + """ + lines = output.splitlines() + raw_block_lines: List[str] = [] + ncolors = ncols = nrows = None + pairs_found = 0 + solutions_found: Optional[int] = None + + i = 0 + while i < len(lines): + m = HEADER_RE.match(lines[i]) + if m: + # start of a potential block + try: + ncolors = int(m.group(1)); ncols = int(m.group(2)); nrows = int(m.group(3)) + except ValueError: + i += 1 + continue + raw_block_lines = [lines[i]] + pairs_found = 0 + i += 1 + # collect exactly ncolors endpoint lines (skip noise until we have them) + while i < len(lines) and pairs_found < ncolors: + pm = PAIR_RE.search(lines[i]) + if pm: + raw_block_lines.append(lines[i]) + pairs_found += 1 + i += 1 + + if pairs_found == ncolors: + # After a complete block, scan forward for "Solutions N" + j = i + while j < len(lines): + sm = SOLUTIONS_RE.match(lines[j]) + if sm: + try: + solutions_found = int(sm.group(1)) + except ValueError: + solutions_found = None + break + j += 1 + + if solutions_found is not None: + return ("\n".join(raw_block_lines) + "\n", solutions_found) + # If no Solutions line found, still return the block (solutions_count=None) + return ("\n".join(raw_block_lines) + "\n", -1) + + else: + i += 1 + + return None + +# --------- Core runner --------- +def run_generator_once(exe: str, params_line: str) -> str: + """ + Invoke ./flowfree once, supplying the params via stdin. + Return stdout as text. + """ + proc = subprocess.run( + [exe], + input=(params_line + "\n").encode("utf-8"), + stdout=subprocess.PIPE, + stderr=subprocess.STDOUT, + check=False, + ) + return proc.stdout.decode("utf-8", errors="replace") + +def convert_with_freeflow(raw_block: str, converter_path: str) -> str: + """ + Pipe the raw block to convert_freeflow.py and capture the human-readable grid. + """ + proc = subprocess.run( + [sys.executable, converter_path], + input=raw_block.encode("utf-8"), + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + check=False, + ) + if proc.returncode != 0: + # If conversion fails, include stderr for debugging in the saved file + pretty = f'"""CONVERSION FAILED (exit {proc.returncode})"""\n{proc.stderr.decode("utf-8", "replace")}' + else: + pretty = proc.stdout.decode("utf-8", "replace").strip() + return pretty + +def ensure_dir(d: Path): + d.mkdir(parents=True, exist_ok=True) + +def parse_colors_arg(arg: str, k: int) -> List[int]: + """ + Parse --colors argument. Accepts: + - a range like "3-7" + - a comma list like "3,4,5" + - a single int like "6" + Caps values at k (cannot have more colors than grid size realistically). + """ + arg = arg.strip() + vals: List[int] = [] + if "-" in arg: + a, b = arg.split("-", 1) + lo, hi = int(a), int(b) + vals = list(range(lo, hi + 1)) + elif "," in arg: + vals = [int(x) for x in arg.split(",")] + else: + vals = [int(arg)] + # cap at k and filter invalid + vals = [c for c in vals if 1 <= c <= max(1, k)] + # unique & sorted + return sorted(set(vals)) + + +recommended_flows_per_grid = { + 5: [3, 5], + 6: [4, 6], + 7: [5, 7], + 8: [6, 8], + 9: [7, 9], + 10: [9, 11], + 11: [10, 12], + 12: [11, 13], + 13: [12, 14], + 14: [13, 15], + 15: [14, 16] +} + +def main(): + ap = argparse.ArgumentParser(description="Generate FlowFree puzzles with unique solutions.") + ap.add_argument("--exe", default="./flowfree", help="Path to the C generator executable (default: ./flowfree)") + ap.add_argument("--converter", default="./convert_freeflow.py", help="Path to convert_freeflow.py") + ap.add_argument("--outdir", default="generated", help="Folder to save puzzles (default: generated)") + ap.add_argument("--kmin", type=int, default=5, help="Min board size k for kxk (default: 5)") + ap.add_argument("--kmax", type=int, default=12, help="Max board size k for kxk (default: 14)") + ap.add_argument("--colors", default="3-7", help="Colors to try per k (range like 3-7, list like 3,4,5, or single int)") + ap.add_argument("--per-size", type=int, default=10, help="Number of puzzles to save per (k, colors) combo (default: 3)") + ap.add_argument("--forbid", type=int, default=0, help="Forbid self-touching? (0 or 1) (default: 0)") # here 0 means we forbid self-touching + ap.add_argument("--mindist", type=int, default=2, help="Minimum endpoint distance (default: 2)") + ap.add_argument("--progress", type=int, default=1000000, help="Progress print interval (default: 1000)") + ap.add_argument("--max-tries", type=int, default=100000, help="Hard cap on generator invocations per (k, colors) (default: 100000)") + args = ap.parse_args() + + exe = args.exe + converter = args.converter + outdir = Path(args.outdir) + ensure_dir(outdir) + + # sanity checks + if not Path(exe).exists(): + print(f"ERROR: generator executable not found: {exe}", file=sys.stderr) + sys.exit(1) + if not Path(converter).exists(): + print(f"WARNING: converter not found: {converter} — files will be saved without pretty grids.", file=sys.stderr) + + for k in range(args.kmin, args.kmax + 1): + # colors_list = parse_colors_arg(args.colors, k) + colors_range = recommended_flows_per_grid[k] + colors_list = list(range(colors_range[0], colors_range[1]+1)) + print(f"\n=== Board size: {k}x{k}, colors to try: {colors_list} ===") + if not colors_list: + print(f"Skipping k={k} as no recommended colors are defined for it.", file=sys.stderr) + continue + for ncolors in colors_list: + target_count = args.per_size + saved = 0 + tries = 0 + print(f"\n=== Generating k={k} ({k}x{k}), colors={ncolors} ===") + while saved < target_count and tries < args.max_tries: + tries += 1 + # params: + params_line = f"{ncolors} {k} {k} {args.forbid} {args.mindist} 1 {args.progress}" + print(f"Try {tries}: params: {params_line}") + out = run_generator_once(exe, params_line) + + found = extract_first_puzzle_block(out) + if not found: + # keep going + continue + + raw_block, sol = found + if sol != 1: + # ignore anything that's not unique + continue + + # Convert to human-readable + if Path(converter).exists(): + pretty = convert_with_freeflow(raw_block, converter) + + else: + pretty = '"""(converter missing)"""' + + + print(pretty) + + print(f"Solutions: {sol}") + asd + + # Create a stable-ish suffix to avoid overwrites when saving multiple puzzles + # Use a short hash of the raw_block. + import hashlib + h = hashlib.sha1(raw_block.encode("utf-8")).hexdigest()[:8] + filename = outdir / f"{k}x{k}_{ncolors}c_{saved+1}_{h}.txt" + + with open(filename, "w", encoding="utf-8") as f: + f.write(pretty.strip() + "\n\n") + f.write("# ---- raw puzzle block (for reproducibility) ----\n") + f.write(raw_block) + f.write("\n param line: " + params_line + "\n") + + saved += 1 + print(f"Saved: {filename}") + + if saved < target_count: + print(f"Note: only saved {saved}/{target_count} for k={k}, colors={ncolors} (after {tries} tries)") + # asd + print("\nDone.") + +if __name__ == "__main__": + main() diff --git a/submodules/flowfree/generated/10x10_10c_1_a63c6afb.txt b/submodules/flowfree/generated/10x10_10c_1_a63c6afb.txt new file mode 100644 index 0000000000000000000000000000000000000000..26b2f880dc5e8b484d95abf6c9f89c4d69dd034d --- /dev/null +++ b/submodules/flowfree/generated/10x10_10c_1_a63c6afb.txt @@ -0,0 +1,72 @@ +""" +..B......E +.......... +........C. +.E.GC..... +.......BG. +F.......J. +......D..H +.D.J..I.A. +.......... +F......IHA +""" + +# ---- raw puzzle block (for reproducibility) ---- +10 10 10 +(9, 9) (8, 7) +(2, 0) (7, 4) +(4, 3) (8, 2) +(6, 6) (1, 7) +(9, 0) (1, 3) +(0, 5) (0, 9) +(3, 3) (8, 4) +(9, 6) (8, 9) +(6, 7) (7, 9) +(8, 5) (3, 7) + + param line: 10 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBEEEEEEE +BEEEJJJJJJ +BEJJJCCCCJ +BEJGCCGGGJ +BBJGGGGBGJ +FBJJBBBBJJ +FBBJBDDHHH +FDBJBDIHAA +FDBBBDIHHA +FDDDDDIIHA +""" + +## Raw solver output: +10 10 10 +(9, 9) (9, 8) (9, 7) (8, 7) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (1, 5) (1, 6) (2, 6) (2, 7) (2, 8) (3, 8) (4, 8) (4, 7) (4, 6) (4, 5) (5, 5) (6, 5) (7, 5) (7, 4) +(4, 3) (5, 3) (5, 2) (6, 2) (7, 2) (8, 2) +(6, 6) (5, 6) (5, 7) (5, 8) (5, 9) (4, 9) (3, 9) (2, 9) (1, 9) (1, 8) (1, 7) +(9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) +(0, 5) (0, 6) (0, 7) (0, 8) (0, 9) +(3, 3) (3, 4) (4, 4) (5, 4) (6, 4) (6, 3) (7, 3) (8, 3) (8, 4) +(9, 6) (8, 6) (7, 6) (7, 7) (7, 8) (8, 8) (8, 9) +(6, 7) (6, 8) (6, 9) (7, 9) +(8, 5) (9, 5) (9, 4) (9, 3) (9, 2) (9, 1) (8, 1) (7, 1) (6, 1) (5, 1) (4, 1) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) (3, 7) + +Touching forbidden +Nodes 107 +Solutions 1 + +## Solver input (raw puzzle block): +10 10 10 +(9, 9) (8, 7) +(2, 0) (7, 4) +(4, 3) (8, 2) +(6, 6) (1, 7) +(9, 0) (1, 3) +(0, 5) (0, 9) +(3, 3) (8, 4) +(9, 6) (8, 9) +(6, 7) (7, 9) +(8, 5) (3, 7) diff --git a/submodules/flowfree/generated/10x10_10c_1_f58fcbac.txt b/submodules/flowfree/generated/10x10_10c_1_f58fcbac.txt new file mode 100644 index 0000000000000000000000000000000000000000..f54bcf6cc67ba7ae59ee07d7043d893fd1a3098e --- /dev/null +++ b/submodules/flowfree/generated/10x10_10c_1_f58fcbac.txt @@ -0,0 +1,72 @@ +""" +H......... +..J..F.H.. +.......C.. +.DJDG.F... +.......... +.......G.. +BE.......C +......B... +.A..AI..E. +.........I +""" + +# ---- raw puzzle block (for reproducibility) ---- +10 10 10 +(1, 8) (4, 8) +(0, 6) (6, 7) +(7, 2) (9, 6) +(3, 3) (1, 3) +(1, 6) (8, 8) +(6, 3) (5, 1) +(4, 3) (7, 5) +(0, 0) (7, 1) +(5, 8) (9, 9) +(2, 1) (2, 3) + + param line: 10 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HDDDCCCCCC +HDJDCFFHHC +HDJDCCFCHC +HDJDGCFCHC +HHHHGCCCHC +BBBHGGGGHC +BEBHHHHHHC +EEBBBBBIII +EAAAAIIIEI +EEEEEEEEEI +""" + +## Raw solver output: +10 10 10 +(1, 8) (2, 8) (3, 8) (4, 8) +(0, 6) (0, 5) (1, 5) (2, 5) (2, 6) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) +(7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 3) (5, 2) (4, 2) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) (9, 4) (9, 5) (9, 6) +(3, 3) (3, 2) (3, 1) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) +(1, 6) (1, 7) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (8, 8) +(6, 3) (6, 2) (6, 1) (5, 1) +(4, 3) (4, 4) (4, 5) (5, 5) (6, 5) (7, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (3, 5) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (7, 1) +(5, 8) (6, 8) (7, 8) (7, 7) (8, 7) (9, 7) (9, 8) (9, 9) +(2, 1) (2, 2) (2, 3) + +Touching forbidden +Nodes 193 +Solutions 1 + +## Solver input (raw puzzle block): +10 10 10 +(1, 8) (4, 8) +(0, 6) (6, 7) +(7, 2) (9, 6) +(3, 3) (1, 3) +(1, 6) (8, 8) +(6, 3) (5, 1) +(4, 3) (7, 5) +(0, 0) (7, 1) +(5, 8) (9, 9) +(2, 1) (2, 3) diff --git a/submodules/flowfree/generated/10x10_10c_2_a39d9d3d.txt b/submodules/flowfree/generated/10x10_10c_2_a39d9d3d.txt new file mode 100644 index 0000000000000000000000000000000000000000..a61a6ec2c9b601d576a4cc73764e9952c485ce0c --- /dev/null +++ b/submodules/flowfree/generated/10x10_10c_2_a39d9d3d.txt @@ -0,0 +1,72 @@ +""" +AB......BD +.....A.... +E...I..J.J +......G... +...I...... +..C..G.... +E......... +FCH....... +.....H..D. +...F...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +10 10 10 +(0, 0) (5, 1) +(1, 0) (8, 0) +(2, 5) (1, 7) +(9, 0) (8, 8) +(0, 6) (0, 2) +(3, 9) (0, 7) +(6, 3) (5, 5) +(5, 8) (2, 7) +(3, 4) (4, 2) +(9, 2) (7, 2) + + param line: 10 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBBBBBBD +AAAAAADDDD +EIIIIDDJJJ +EICCCDGGGG +EICICDDDDG +EICICGGGDG +EIIICCCGDG +FCHHHHCGDG +FCCCCHCGDG +FFFFCCCGGG +""" + +## Raw solver output: +10 10 10 +(0, 0) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) +(1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) +(2, 5) (2, 4) (2, 3) (3, 3) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (6, 6) (6, 7) (6, 8) (6, 9) (5, 9) (4, 9) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) +(9, 0) (9, 1) (8, 1) (7, 1) (6, 1) (6, 2) (5, 2) (5, 3) (5, 4) (6, 4) (7, 4) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) +(0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(3, 9) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) +(6, 3) (7, 3) (8, 3) (9, 3) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) (7, 9) (7, 8) (7, 7) (7, 6) (7, 5) (6, 5) (5, 5) +(5, 8) (5, 7) (4, 7) (3, 7) (2, 7) +(3, 4) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (2, 2) (3, 2) (4, 2) +(9, 2) (8, 2) (7, 2) + +Touching forbidden +Nodes 211 +Solutions 1 + +## Solver input (raw puzzle block): +10 10 10 +(0, 0) (5, 1) +(1, 0) (8, 0) +(2, 5) (1, 7) +(9, 0) (8, 8) +(0, 6) (0, 2) +(3, 9) (0, 7) +(6, 3) (5, 5) +(5, 8) (2, 7) +(3, 4) (4, 2) +(9, 2) (7, 2) diff --git a/submodules/flowfree/generated/10x10_9c_10_48c869f8.txt b/submodules/flowfree/generated/10x10_9c_10_48c869f8.txt new file mode 100644 index 0000000000000000000000000000000000000000..cbdcf2722ac4be99d99259b7022ed8c7ae494fcd --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_10_48c869f8.txt @@ -0,0 +1,69 @@ +""" +.......... +.......... +.......... +....GI.... +..DGF....C +......I... +....E.FDA. +..B.HC.... +.H..B..E.. +.........A +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 6) (9, 9) +(4, 8) (2, 7) +(9, 4) (5, 7) +(7, 6) (2, 4) +(4, 6) (7, 8) +(6, 6) (4, 4) +(3, 4) (4, 3) +(4, 7) (1, 8) +(5, 3) (6, 5) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCCCC +CEEEEEEEEC +CEDDDDDDEC +CEDGGIIDEC +CEDGFFIDEC +CEEEEFIDEE +CHHHEFFDAE +CHBHHCAAAE +CHBBBCAEEE +CCCCCCAAAA +""" + +## Raw solver output: +9 10 10 +(8, 6) (8, 7) (7, 7) (6, 7) (6, 8) (6, 9) (7, 9) (8, 9) (9, 9) +(4, 8) (3, 8) (2, 8) (2, 7) +(9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (5, 8) (5, 7) +(7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(4, 6) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (9, 5) (9, 6) (9, 7) (9, 8) (8, 8) (7, 8) +(6, 6) (5, 6) (5, 5) (5, 4) (4, 4) +(3, 4) (3, 3) (4, 3) +(4, 7) (3, 7) (3, 6) (2, 6) (1, 6) (1, 7) (1, 8) +(5, 3) (6, 3) (6, 4) (6, 5) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 6) (9, 9) +(4, 8) (2, 7) +(9, 4) (5, 7) +(7, 6) (2, 4) +(4, 6) (7, 8) +(6, 6) (4, 4) +(3, 4) (4, 3) +(4, 7) (1, 8) +(5, 3) (6, 5) diff --git a/submodules/flowfree/generated/10x10_9c_10_b9b91263.txt b/submodules/flowfree/generated/10x10_9c_10_b9b91263.txt new file mode 100644 index 0000000000000000000000000000000000000000..7ac3ba78895a0a0579d6ca9807303ee06ed8c01d --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_10_b9b91263.txt @@ -0,0 +1,69 @@ +""" +..FE.BG... +.D........ +.......I.. +.E........ +.F........ +..D.....A. +H.......G. +..HI...BC. +C......... +A......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(0, 9) (8, 5) +(7, 7) (5, 0) +(8, 7) (0, 8) +(1, 1) (2, 5) +(3, 0) (1, 3) +(2, 0) (1, 4) +(6, 0) (8, 6) +(0, 6) (2, 7) +(3, 7) (7, 2) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFEEBGGGG +FDDDEBBBBG +FFFDEIIIBG +EEFDEIBBBG +EFFDEIBGGG +EEDDEIBGAA +HEEEEIBGGA +HHHIIIBBCA +CCCCCCCCCA +AAAAAAAAAA +""" + +## Raw solver output: +9 10 10 +(0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (8, 5) +(7, 7) (6, 7) (6, 6) (6, 5) (6, 4) (6, 3) (7, 3) (8, 3) (8, 2) (8, 1) (7, 1) (6, 1) (5, 1) (5, 0) +(8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) +(1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (2, 5) +(3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (3, 6) (2, 6) (1, 6) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (2, 3) (2, 4) (1, 4) +(6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) (9, 4) (8, 4) (7, 4) (7, 5) (7, 6) (8, 6) +(0, 6) (0, 7) (1, 7) (2, 7) +(3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (6, 2) (7, 2) + +Touching forbidden +Nodes 172 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(0, 9) (8, 5) +(7, 7) (5, 0) +(8, 7) (0, 8) +(1, 1) (2, 5) +(3, 0) (1, 3) +(2, 0) (1, 4) +(6, 0) (8, 6) +(0, 6) (2, 7) +(3, 7) (7, 2) diff --git a/submodules/flowfree/generated/10x10_9c_1_8bb56a0a.txt b/submodules/flowfree/generated/10x10_9c_1_8bb56a0a.txt new file mode 100644 index 0000000000000000000000000000000000000000..37030c5c22156318d284944dcd60402b32db388b --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_1_8bb56a0a.txt @@ -0,0 +1,69 @@ +""" +.......... +DH..B..... +I.I......D +.....G.... +.G..AF...B +.......EAC +...H...... +......E..F +......C... +.......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 5) (4, 4) +(4, 1) (9, 4) +(9, 5) (6, 8) +(0, 1) (9, 2) +(7, 5) (6, 7) +(5, 4) (9, 7) +(5, 3) (1, 4) +(1, 1) (3, 6) +(2, 2) (0, 2) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDDDDD +DHHHBBBBBD +IIIHAAAABD +FFFHAGGABB +FGFHAFGAAB +FGFHFFGEAC +FGFHFGGECC +FGFFFGEECF +FGGGGGCCCF +FFFFFFFFFF +""" + +## Raw solver output: +9 10 10 +(8, 5) (8, 4) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (4, 2) (4, 3) (4, 4) +(4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (9, 3) (9, 4) +(9, 5) (9, 6) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) +(7, 5) (7, 6) (7, 7) (6, 7) +(5, 4) (5, 5) (4, 5) (4, 6) (4, 7) (3, 7) (2, 7) (2, 6) (2, 5) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) +(5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (5, 7) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) +(1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (3, 6) +(2, 2) (1, 2) (0, 2) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 5) (4, 4) +(4, 1) (9, 4) +(9, 5) (6, 8) +(0, 1) (9, 2) +(7, 5) (6, 7) +(5, 4) (9, 7) +(5, 3) (1, 4) +(1, 1) (3, 6) +(2, 2) (0, 2) diff --git a/submodules/flowfree/generated/10x10_9c_1_eb7c4808.txt b/submodules/flowfree/generated/10x10_9c_1_eb7c4808.txt new file mode 100644 index 0000000000000000000000000000000000000000..c4b077b33532db7cfba12253fd3416ff5da9e342 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_1_eb7c4808.txt @@ -0,0 +1,69 @@ +""" +.......... +.G...C.F.. +...A.G.... +.A.......E +.D........ +..H.B..... +..C....... +.......H.. +.D........ +....I.BIEF +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(1, 3) (3, 2) +(6, 9) (4, 5) +(5, 1) (2, 6) +(1, 8) (1, 4) +(8, 9) (9, 3) +(7, 1) (9, 9) +(5, 2) (1, 1) +(2, 5) (7, 7) +(7, 9) (4, 9) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCEEEE +CGGGGCEFFE +CAAAGGEEFE +CAHHHHHEFE +CDHIIIHEFF +CDHIBIHEEF +CDCIBIHHEF +CDCIBIIHEF +CDCIBBIIEF +CCCIIBBIEF +""" + +## Raw solver output: +9 10 10 +(1, 3) (1, 2) (2, 2) (3, 2) +(6, 9) (5, 9) (5, 8) (4, 8) (4, 7) (4, 6) (4, 5) +(5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (2, 8) (2, 7) (2, 6) +(1, 8) (1, 7) (1, 6) (1, 5) (1, 4) +(8, 9) (8, 8) (8, 7) (8, 6) (8, 5) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (6, 1) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) +(7, 1) (8, 1) (8, 2) (8, 3) (8, 4) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) +(5, 2) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) +(2, 5) (2, 4) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (7, 6) (7, 7) +(7, 9) (7, 8) (6, 8) (6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (4, 4) (3, 4) (3, 5) (3, 6) (3, 7) (3, 8) (3, 9) (4, 9) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(1, 3) (3, 2) +(6, 9) (4, 5) +(5, 1) (2, 6) +(1, 8) (1, 4) +(8, 9) (9, 3) +(7, 1) (9, 9) +(5, 2) (1, 1) +(2, 5) (7, 7) +(7, 9) (4, 9) diff --git a/submodules/flowfree/generated/10x10_9c_2_e3905cd9.txt b/submodules/flowfree/generated/10x10_9c_2_e3905cd9.txt new file mode 100644 index 0000000000000000000000000000000000000000..bdba903fd178673216f7e46cd50730569e3f8c91 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_2_e3905cd9.txt @@ -0,0 +1,69 @@ +""" +E..E..G... +........A. +.CB...I... +..C..H..D. +..G......F +.......... +.......... +.......I.. +..HFDA.... +B......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 1) (5, 8) +(2, 2) (0, 9) +(1, 2) (2, 3) +(4, 8) (8, 3) +(0, 0) (3, 0) +(9, 4) (3, 8) +(2, 4) (6, 0) +(5, 3) (2, 8) +(6, 2) (7, 7) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEGGGFFF +GGGGGFFFAF +GCBBFFIAAF +GCCBFHIADF +GGGBFHIADF +BBBBFHIADD +BFFFFHIAAD +BFHHHHIIAD +BFHFDAAAAD +BFFFDDDDDD +""" + +## Raw solver output: +9 10 10 +(8, 1) (8, 2) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) +(2, 2) (3, 2) (3, 3) (3, 4) (3, 5) (2, 5) (1, 5) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) +(1, 2) (1, 3) (2, 3) +(4, 8) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (8, 5) (8, 4) (8, 3) +(0, 0) (1, 0) (2, 0) (3, 0) +(9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (7, 1) (6, 1) (5, 1) (5, 2) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (3, 6) (2, 6) (1, 6) (1, 7) (1, 8) (1, 9) (2, 9) (3, 9) (3, 8) +(2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) +(5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (2, 8) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (6, 7) (7, 7) + +Touching forbidden +Nodes 187 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 1) (5, 8) +(2, 2) (0, 9) +(1, 2) (2, 3) +(4, 8) (8, 3) +(0, 0) (3, 0) +(9, 4) (3, 8) +(2, 4) (6, 0) +(5, 3) (2, 8) +(6, 2) (7, 7) diff --git a/submodules/flowfree/generated/10x10_9c_2_fd8c9afe.txt b/submodules/flowfree/generated/10x10_9c_2_fd8c9afe.txt new file mode 100644 index 0000000000000000000000000000000000000000..d28c041ac135914d80bab2db35e3e0019f742f32 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_2_fd8c9afe.txt @@ -0,0 +1,69 @@ +""" +..DG...F.F +.E........ +....D...H. +......GA.. +...C...B.. +..I....H.A +......B... +...I....E. +.C........ +.......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(7, 3) (9, 5) +(7, 4) (6, 6) +(1, 8) (3, 4) +(4, 2) (2, 0) +(1, 1) (8, 7) +(9, 0) (7, 0) +(3, 0) (6, 3) +(8, 2) (7, 5) +(2, 5) (3, 7) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDGGGGFFF +DEEEEEGAAA +DDDDDEGAHA +IIIIIEGAHA +ICCCIEBBHA +ICIIIEBHHA +ICEEEEBIII +ICEIIIIIEI +ICEEEEEEEI +IIIIIIIIII +""" + +## Raw solver output: +9 10 10 +(7, 3) (7, 2) (7, 1) (8, 1) (9, 1) (9, 2) (9, 3) (9, 4) (9, 5) +(7, 4) (6, 4) (6, 5) (6, 6) +(1, 8) (1, 7) (1, 6) (1, 5) (1, 4) (2, 4) (3, 4) +(4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (2, 7) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) +(9, 0) (8, 0) (7, 0) +(3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) +(8, 2) (8, 3) (8, 4) (8, 5) (7, 5) +(2, 5) (3, 5) (4, 5) (4, 4) (4, 3) (3, 3) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (8, 6) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) + +Touching forbidden +Nodes 216 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(7, 3) (9, 5) +(7, 4) (6, 6) +(1, 8) (3, 4) +(4, 2) (2, 0) +(1, 1) (8, 7) +(9, 0) (7, 0) +(3, 0) (6, 3) +(8, 2) (7, 5) +(2, 5) (3, 7) diff --git a/submodules/flowfree/generated/10x10_9c_3_30461201.txt b/submodules/flowfree/generated/10x10_9c_3_30461201.txt new file mode 100644 index 0000000000000000000000000000000000000000..5239368c93c3a8f5fc52e1c7c2cef893795fa9a1 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_3_30461201.txt @@ -0,0 +1,69 @@ +""" +E........E +..H...A... +....G...F. +.......... +...IG..... +.A........ +.....C.DB. +.......... +.FIH....C. +........BD +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(1, 5) (6, 1) +(8, 9) (8, 6) +(5, 6) (8, 8) +(7, 6) (9, 9) +(9, 0) (0, 0) +(1, 8) (8, 2) +(4, 4) (4, 2) +(2, 1) (3, 8) +(3, 4) (2, 8) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEEEEE +HHHAAAAGGG +HAAAGGGGFG +HAFFFFFFFG +HAFIGGGGGG +HAFIBBBDDD +HFFIBCBDBD +HFIIBCBBBD +HFIHBCCCCD +HHHHBBBBBD +""" + +## Raw solver output: +9 10 10 +(1, 5) (1, 4) (1, 3) (1, 2) (2, 2) (3, 2) (3, 1) (4, 1) (5, 1) (6, 1) +(8, 9) (7, 9) (6, 9) (5, 9) (4, 9) (4, 8) (4, 7) (4, 6) (4, 5) (5, 5) (6, 5) (6, 6) (6, 7) (7, 7) (8, 7) (8, 6) +(5, 6) (5, 7) (5, 8) (6, 8) (7, 8) (8, 8) +(7, 6) (7, 5) (8, 5) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) +(9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(1, 8) (1, 7) (1, 6) (2, 6) (2, 5) (2, 4) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (7, 3) (8, 3) (8, 2) +(4, 4) (5, 4) (6, 4) (7, 4) (8, 4) (9, 4) (9, 3) (9, 2) (9, 1) (8, 1) (7, 1) (7, 2) (6, 2) (5, 2) (4, 2) +(2, 1) (1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (3, 8) +(3, 4) (3, 5) (3, 6) (3, 7) (2, 7) (2, 8) + +Touching forbidden +Nodes 182 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(1, 5) (6, 1) +(8, 9) (8, 6) +(5, 6) (8, 8) +(7, 6) (9, 9) +(9, 0) (0, 0) +(1, 8) (8, 2) +(4, 4) (4, 2) +(2, 1) (3, 8) +(3, 4) (2, 8) diff --git a/submodules/flowfree/generated/10x10_9c_3_bf7c15fb.txt b/submodules/flowfree/generated/10x10_9c_3_bf7c15fb.txt new file mode 100644 index 0000000000000000000000000000000000000000..28d0447bd9abeb16091c4ae9ea7b1fa72a91249a --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_3_bf7c15fb.txt @@ -0,0 +1,69 @@ +""" +.......F.. +.....C..A. +..H.HG.... +.......... +......D.G. +..AE...... +.......... +.D..I.FE.. +.I......C. +....B.B... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 1) (2, 5) +(4, 9) (6, 9) +(8, 8) (5, 1) +(1, 7) (6, 4) +(3, 5) (7, 7) +(7, 0) (6, 7) +(8, 4) (5, 2) +(4, 2) (2, 2) +(1, 8) (4, 7) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAFFF +ACCCCCAAAF +ACHHHGGGGF +ACCCCCCCGF +ADDDDDDCGF +ADAEEEECCF +ADAAAAEECF +ADIIIAFECF +AIIAAAFFCF +AAAABBBFFF +""" + +## Raw solver output: +9 10 10 +(8, 1) (7, 1) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (3, 8) (4, 8) (5, 8) (5, 7) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) +(4, 9) (5, 9) (6, 9) +(8, 8) (8, 7) (8, 6) (8, 5) (7, 5) (7, 4) (7, 3) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) +(1, 7) (1, 6) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 6) (7, 6) (7, 7) +(7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) (7, 9) (7, 8) (6, 8) (6, 7) +(8, 4) (8, 3) (8, 2) (7, 2) (6, 2) (5, 2) +(4, 2) (3, 2) (2, 2) +(1, 8) (2, 8) (2, 7) (3, 7) (4, 7) + +Touching forbidden +Nodes 211 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 1) (2, 5) +(4, 9) (6, 9) +(8, 8) (5, 1) +(1, 7) (6, 4) +(3, 5) (7, 7) +(7, 0) (6, 7) +(8, 4) (5, 2) +(4, 2) (2, 2) +(1, 8) (4, 7) diff --git a/submodules/flowfree/generated/10x10_9c_4_2e90136f.txt b/submodules/flowfree/generated/10x10_9c_4_2e90136f.txt new file mode 100644 index 0000000000000000000000000000000000000000..16f3f6b29abe2718f1e972ebddfd560fa3ca9bcd --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_4_2e90136f.txt @@ -0,0 +1,69 @@ +""" +IC........ +.G......B. +..IA...HC. +.......... +.FD....... +.......G.. +.......A.. +.......... +.F......D. +BE....EH.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(3, 2) (7, 6) +(8, 1) (0, 9) +(1, 0) (8, 2) +(2, 4) (8, 8) +(6, 9) (1, 9) +(1, 4) (1, 8) +(7, 5) (1, 1) +(7, 9) (7, 2) +(0, 0) (2, 2) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ICCCCCCCCC +IGGGGGBBBC +IIIAAGBHCC +BBBBAGBHHH +BFDBAGBBBH +BFDBAGGGBH +BFDBAAAABH +BFDBBBBBBH +BFDDDDDDDH +BEEEEEEHHH +""" + +## Raw solver output: +9 10 10 +(3, 2) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (6, 6) (7, 6) +(8, 1) (7, 1) (6, 1) (6, 2) (6, 3) (6, 4) (7, 4) (8, 4) (8, 5) (8, 6) (8, 7) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) +(1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (8, 2) +(2, 4) (2, 5) (2, 6) (2, 7) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) +(6, 9) (5, 9) (4, 9) (3, 9) (2, 9) (1, 9) +(1, 4) (1, 5) (1, 6) (1, 7) (1, 8) +(7, 5) (6, 5) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) +(7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (9, 4) (9, 3) (8, 3) (7, 3) (7, 2) +(0, 0) (0, 1) (0, 2) (1, 2) (2, 2) + +Touching forbidden +Nodes 186 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(3, 2) (7, 6) +(8, 1) (0, 9) +(1, 0) (8, 2) +(2, 4) (8, 8) +(6, 9) (1, 9) +(1, 4) (1, 8) +(7, 5) (1, 1) +(7, 9) (7, 2) +(0, 0) (2, 2) diff --git a/submodules/flowfree/generated/10x10_9c_4_ee625044.txt b/submodules/flowfree/generated/10x10_9c_4_ee625044.txt new file mode 100644 index 0000000000000000000000000000000000000000..4f82e13ebb06eebe4a4e2f9163951d2bc0ca672b --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_4_ee625044.txt @@ -0,0 +1,69 @@ +""" +.....I..C. +......D..C +..H....... +.F......A. +.......... +.EG.B..... +.H....GD.. +.B.....F.. +....E..... +A.....I... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(0, 9) (8, 3) +(4, 5) (1, 7) +(8, 0) (9, 1) +(7, 6) (6, 1) +(4, 8) (1, 5) +(1, 3) (7, 7) +(2, 5) (6, 6) +(1, 6) (2, 2) +(5, 0) (6, 9) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGGGIIICC +GFFFGGDIIC +GFHFFGDDII +GFHHFGGDAI +GGGHFFGDAI +EEGHBFGDAI +EHHHBFGDAI +EBBBBFFFAI +EEEEEAAAAI +AAAAAAIIII +""" + +## Raw solver output: +9 10 10 +(0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) +(4, 5) (4, 6) (4, 7) (3, 7) (2, 7) (1, 7) +(8, 0) (9, 0) (9, 1) +(7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (6, 1) +(4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (1, 5) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (4, 2) (4, 3) (4, 4) (5, 4) (5, 5) (5, 6) (5, 7) (6, 7) (7, 7) +(2, 5) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (5, 1) (5, 2) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) +(1, 6) (2, 6) (3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) +(5, 0) (6, 0) (7, 0) (7, 1) (8, 1) (8, 2) (9, 2) (9, 3) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) (7, 9) (6, 9) + +Touching forbidden +Nodes 133 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(0, 9) (8, 3) +(4, 5) (1, 7) +(8, 0) (9, 1) +(7, 6) (6, 1) +(4, 8) (1, 5) +(1, 3) (7, 7) +(2, 5) (6, 6) +(1, 6) (2, 2) +(5, 0) (6, 9) diff --git a/submodules/flowfree/generated/10x10_9c_5_28224532.txt b/submodules/flowfree/generated/10x10_9c_5_28224532.txt new file mode 100644 index 0000000000000000000000000000000000000000..a7d0ea2981be7c83250bce1f69522b120a54b0c1 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_5_28224532.txt @@ -0,0 +1,69 @@ +""" +......C... +.HD.....E. +..I..FA..D +.......... +.....B.... +..I....G.. +..GF...... +.....HC..E +.......... +........BA +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(9, 9) (6, 2) +(8, 9) (5, 4) +(6, 0) (6, 7) +(2, 1) (9, 2) +(8, 1) (9, 7) +(3, 6) (5, 2) +(7, 5) (2, 6) +(5, 7) (1, 1) +(2, 5) (2, 2) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCDDD +CHDDDDDDED +CHIFFFAAED +CHIFGGGAEE +CHIFGBGAAE +CHIFGBGGAE +CHGFGBBBAE +CHGGGHCBAE +CHHHHHCBAA +CCCCCCCBBA +""" + +## Raw solver output: +9 10 10 +(9, 9) (9, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (7, 4) (7, 3) (7, 2) (6, 2) +(8, 9) (7, 9) (7, 8) (7, 7) (7, 6) (6, 6) (5, 6) (5, 5) (5, 4) +(6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) (4, 9) (5, 9) (6, 9) (6, 8) (6, 7) +(2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) +(8, 1) (8, 2) (8, 3) (9, 3) (9, 4) (9, 5) (9, 6) (9, 7) +(3, 6) (3, 5) (3, 4) (3, 3) (3, 2) (4, 2) (5, 2) +(7, 5) (6, 5) (6, 4) (6, 3) (5, 3) (4, 3) (4, 4) (4, 5) (4, 6) (4, 7) (3, 7) (2, 7) (2, 6) +(5, 7) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(2, 5) (2, 4) (2, 3) (2, 2) + +Touching forbidden +Nodes 172 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(9, 9) (6, 2) +(8, 9) (5, 4) +(6, 0) (6, 7) +(2, 1) (9, 2) +(8, 1) (9, 7) +(3, 6) (5, 2) +(7, 5) (2, 6) +(5, 7) (1, 1) +(2, 5) (2, 2) diff --git a/submodules/flowfree/generated/10x10_9c_5_ce9aa220.txt b/submodules/flowfree/generated/10x10_9c_5_ce9aa220.txt new file mode 100644 index 0000000000000000000000000000000000000000..b2b7f9cdf8258d84f8e116517cbd55b52129ab7f --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_5_ce9aa220.txt @@ -0,0 +1,69 @@ +""" +.H........ +.D........ +....BI.IH. +.....E.... +........DE +.....G.... +B..A...... +F....G..A. +.....C.... +...F....C. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 7) (3, 6) +(0, 6) (4, 2) +(5, 8) (8, 9) +(8, 4) (1, 1) +(5, 3) (9, 4) +(0, 7) (3, 9) +(5, 7) (5, 5) +(1, 0) (8, 2) +(7, 2) (5, 2) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHDDDDDDDD +HDDHHHHHHD +HHHHBIIIHD +BBBBBEEEDD +BAAAAAAEDE +BAGGGGAEEE +BAGAAAACCC +FAGGGGCCAC +FAAAACCAAC +FFFFAAAACC +""" + +## Raw solver output: +9 10 10 +(8, 7) (8, 8) (7, 8) (7, 9) (6, 9) (5, 9) (4, 9) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) +(0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(5, 8) (6, 8) (6, 7) (7, 7) (7, 6) (8, 6) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) +(8, 4) (8, 3) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (2, 1) (1, 1) +(5, 3) (6, 3) (7, 3) (7, 4) (7, 5) (8, 5) (9, 5) (9, 4) +(0, 7) (0, 8) (0, 9) (1, 9) (2, 9) (3, 9) +(5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (3, 2) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 2) +(7, 2) (6, 2) (5, 2) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 7) (3, 6) +(0, 6) (4, 2) +(5, 8) (8, 9) +(8, 4) (1, 1) +(5, 3) (9, 4) +(0, 7) (3, 9) +(5, 7) (5, 5) +(1, 0) (8, 2) +(7, 2) (5, 2) diff --git a/submodules/flowfree/generated/10x10_9c_6_0f9bfafe.txt b/submodules/flowfree/generated/10x10_9c_6_0f9bfafe.txt new file mode 100644 index 0000000000000000000000000000000000000000..ffe39c3d46f37c9eec44dfeba4e6d4774ff55ac1 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_6_0f9bfafe.txt @@ -0,0 +1,69 @@ +""" +....G..... +.C......D. +........A. +I.D.A...B. +.......... +..B..F.F.. +IC........ +...H...H.. +.E..E..... +......G... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(4, 3) (8, 2) +(2, 5) (8, 3) +(1, 1) (1, 6) +(8, 1) (2, 3) +(4, 8) (1, 8) +(5, 5) (7, 5) +(6, 9) (4, 0) +(3, 7) (7, 7) +(0, 6) (0, 3) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDGGGGGG +DCCDDDDDDG +DDCCAAAAAG +IDDCABBBBG +ICCCBBFFFG +ICBBBFFFFG +ICFFFFFFFG +FFFHHHHHFG +FEEEEFFFFG +FFFFFFGGGG +""" + +## Raw solver output: +9 10 10 +(4, 3) (4, 2) (5, 2) (6, 2) (7, 2) (8, 2) +(2, 5) (3, 5) (4, 5) (4, 4) (5, 4) (5, 3) (6, 3) (7, 3) (8, 3) +(1, 1) (2, 1) (2, 2) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (1, 5) (1, 6) +(8, 1) (7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (2, 3) +(4, 8) (3, 8) (2, 8) (1, 8) +(5, 5) (6, 5) (6, 4) (7, 4) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (5, 9) (4, 9) (3, 9) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) (1, 7) (2, 7) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) +(6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) +(3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(0, 6) (0, 5) (0, 4) (0, 3) + +Touching forbidden +Nodes 170 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(4, 3) (8, 2) +(2, 5) (8, 3) +(1, 1) (1, 6) +(8, 1) (2, 3) +(4, 8) (1, 8) +(5, 5) (7, 5) +(6, 9) (4, 0) +(3, 7) (7, 7) +(0, 6) (0, 3) diff --git a/submodules/flowfree/generated/10x10_9c_6_86268115.txt b/submodules/flowfree/generated/10x10_9c_6_86268115.txt new file mode 100644 index 0000000000000000000000000000000000000000..35dd64fc487383d83b6b312b6856a3747533e8c0 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_6_86268115.txt @@ -0,0 +1,69 @@ +""" +...A...... +FI........ +D......C.. +..I...E... +H....C.G.. +.D.G...A.F +.B.E...... +.......... +........H. +.........B +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(7, 5) (3, 0) +(1, 6) (9, 9) +(5, 4) (7, 2) +(0, 2) (1, 5) +(6, 3) (3, 6) +(9, 5) (0, 1) +(3, 5) (7, 4) +(8, 8) (0, 4) +(2, 3) (1, 1) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAAAAAA +FIFFGGGGGA +DIIFGCCCGA +DDIFGCEGGA +HDFFGCEGAA +HDFGGEEAAF +HBFEEEFFFF +HBFFFFFBBB +HBBBBBBBHB +HHHHHHHHHB +""" + +## Raw solver output: +9 10 10 +(7, 5) (8, 5) (8, 4) (9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) +(1, 6) (1, 7) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (8, 7) (9, 7) (9, 8) (9, 9) +(5, 4) (5, 3) (5, 2) (6, 2) (7, 2) +(0, 2) (0, 3) (1, 3) (1, 4) (1, 5) +(6, 3) (6, 4) (6, 5) (5, 5) (5, 6) (4, 6) (3, 6) +(9, 5) (9, 6) (8, 6) (7, 6) (6, 6) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (2, 5) (2, 4) (3, 4) (3, 3) (3, 2) (3, 1) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) +(3, 5) (4, 5) (4, 4) (4, 3) (4, 2) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (7, 3) (7, 4) +(8, 8) (8, 9) (7, 9) (6, 9) (5, 9) (4, 9) (3, 9) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) +(2, 3) (2, 2) (1, 2) (1, 1) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(7, 5) (3, 0) +(1, 6) (9, 9) +(5, 4) (7, 2) +(0, 2) (1, 5) +(6, 3) (3, 6) +(9, 5) (0, 1) +(3, 5) (7, 4) +(8, 8) (0, 4) +(2, 3) (1, 1) diff --git a/submodules/flowfree/generated/10x10_9c_7_6588d764.txt b/submodules/flowfree/generated/10x10_9c_7_6588d764.txt new file mode 100644 index 0000000000000000000000000000000000000000..cacf792b368f84f6bf21d3e4ac72301f628d95eb --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_7_6588d764.txt @@ -0,0 +1,69 @@ +""" +I.HA...... +....EB.... +.......... +..A....... +.....GF... +..D....... +..I.E..... +........B. +.D.CF.G.H. +....C..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(2, 3) (3, 0) +(8, 7) (5, 1) +(3, 8) (4, 9) +(2, 5) (1, 8) +(4, 1) (4, 6) +(6, 4) (4, 8) +(6, 8) (5, 4) +(8, 8) (2, 0) +(2, 6) (0, 0) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +IHHAEEEEEE +IHAAEBBBBE +IHAHHHHHBE +IHAHFFFHBE +IHHHFGFHBE +IDDFFGGHBE +IDIFEEGHBE +IDIFFEGHBE +IDICFEGHHE +IIICCEEEEE +""" + +## Raw solver output: +9 10 10 +(2, 3) (2, 2) (2, 1) (3, 1) (3, 0) +(8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (7, 1) (6, 1) (5, 1) +(3, 8) (3, 9) (4, 9) +(2, 5) (1, 5) (1, 6) (1, 7) (1, 8) +(4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) (7, 9) (6, 9) (5, 9) (5, 8) (5, 7) (5, 6) (4, 6) +(6, 4) (6, 3) (5, 3) (4, 3) (4, 4) (4, 5) (3, 5) (3, 6) (3, 7) (4, 7) (4, 8) +(6, 8) (6, 7) (6, 6) (6, 5) (5, 5) (5, 4) +(8, 8) (7, 8) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (4, 2) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(2, 6) (2, 7) (2, 8) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) + +Touching forbidden +Nodes 103 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(2, 3) (3, 0) +(8, 7) (5, 1) +(3, 8) (4, 9) +(2, 5) (1, 8) +(4, 1) (4, 6) +(6, 4) (4, 8) +(6, 8) (5, 4) +(8, 8) (2, 0) +(2, 6) (0, 0) diff --git a/submodules/flowfree/generated/10x10_9c_7_d35070f8.txt b/submodules/flowfree/generated/10x10_9c_7_d35070f8.txt new file mode 100644 index 0000000000000000000000000000000000000000..ad8c1139f2f5b08713068dbc0a46f8cee7dc74df --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_7_d35070f8.txt @@ -0,0 +1,69 @@ +""" +CB.......D +......I..B +..F.....D. +.E.A...... +.H.F...... +........G. +...EI..... +....AH.... +.......... +.......GC. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(3, 3) (4, 7) +(1, 0) (9, 1) +(8, 9) (0, 0) +(9, 0) (8, 2) +(1, 3) (3, 6) +(2, 2) (3, 4) +(8, 5) (7, 9) +(5, 7) (1, 4) +(6, 1) (4, 6) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CBBBBBBBDD +CEEEEEIBDB +CEFFFEIBDB +CEAAFEIBBB +CHAFFEICCC +CHAEEEICGC +CHAEIIICGC +CHAAAHCCGC +CHHHHHCGGC +CCCCCCCGCC +""" + +## Raw solver output: +9 10 10 +(3, 3) (2, 3) (2, 4) (2, 5) (2, 6) (2, 7) (3, 7) (4, 7) +(1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (8, 3) (9, 3) (9, 2) (9, 1) +(8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (9, 4) (8, 4) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (6, 8) (6, 9) (5, 9) (4, 9) (3, 9) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(9, 0) (8, 0) (8, 1) (8, 2) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (3, 6) +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (3, 4) +(8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (7, 9) +(5, 7) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) +(6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) + +Touching forbidden +Nodes 106 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(3, 3) (4, 7) +(1, 0) (9, 1) +(8, 9) (0, 0) +(9, 0) (8, 2) +(1, 3) (3, 6) +(2, 2) (3, 4) +(8, 5) (7, 9) +(5, 7) (1, 4) +(6, 1) (4, 6) diff --git a/submodules/flowfree/generated/10x10_9c_8_84b82713.txt b/submodules/flowfree/generated/10x10_9c_8_84b82713.txt new file mode 100644 index 0000000000000000000000000000000000000000..64a3d588875526df8f925519b1ab579967543bd6 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_8_84b82713.txt @@ -0,0 +1,69 @@ +""" +.......B.B +.........A +.DC....... +......F... +......H.I. +.G...F.DA. +.......... +.......I.. +...E...C.. +E...G....H +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(8, 5) (9, 1) +(7, 0) (9, 0) +(2, 2) (7, 8) +(7, 5) (1, 2) +(0, 9) (3, 8) +(5, 5) (6, 3) +(1, 5) (4, 9) +(6, 4) (9, 9) +(7, 7) (8, 4) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +IIIIIIIBBB +IDDDDDIIIA +IDCCCDDDIA +IIIICFFDIA +EEEICFHDIA +EGEICFHDAA +EGEICCHHHH +EGEIICCIIH +EGEEIICCIH +EGGGGIIIIH +""" + +## Raw solver output: +9 10 10 +(8, 5) (9, 5) (9, 4) (9, 3) (9, 2) (9, 1) +(7, 0) (8, 0) (9, 0) +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (5, 7) (6, 7) (6, 8) (7, 8) +(7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (2, 5) (2, 6) (2, 7) (2, 8) (3, 8) +(5, 5) (5, 4) (5, 3) (6, 3) +(1, 5) (1, 6) (1, 7) (1, 8) (1, 9) (2, 9) (3, 9) (4, 9) +(6, 4) (6, 5) (6, 6) (7, 6) (8, 6) (9, 6) (9, 7) (9, 8) (9, 9) +(7, 7) (8, 7) (8, 8) (8, 9) (7, 9) (6, 9) (5, 9) (5, 8) (4, 8) (4, 7) (3, 7) (3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (8, 4) + +Touching forbidden +Nodes 166 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(8, 5) (9, 1) +(7, 0) (9, 0) +(2, 2) (7, 8) +(7, 5) (1, 2) +(0, 9) (3, 8) +(5, 5) (6, 3) +(1, 5) (4, 9) +(6, 4) (9, 9) +(7, 7) (8, 4) diff --git a/submodules/flowfree/generated/10x10_9c_8_c7fe0b9d.txt b/submodules/flowfree/generated/10x10_9c_8_c7fe0b9d.txt new file mode 100644 index 0000000000000000000000000000000000000000..2acf3663c9101823ea2b2d1e07897a467b073af8 --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_8_c7fe0b9d.txt @@ -0,0 +1,69 @@ +""" +......I... +.CHG....E. +.......E.. +.....A.... +....A.BH.. +.......... +.......B.. +........F. +...DG..... +ICF......D +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(4, 4) (5, 3) +(6, 4) (7, 6) +(1, 9) (1, 1) +(9, 9) (3, 8) +(7, 2) (8, 1) +(8, 7) (2, 9) +(4, 8) (3, 1) +(2, 1) (7, 4) +(0, 9) (6, 0) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +IIIIIIIGGG +ICHGGGGGEG +ICHBBBBEEG +ICHBAABBBG +ICHBABBHBG +ICHBBBHHBG +ICHHHHHBBG +ICFFFFFFFG +ICFDGGGGGG +ICFDDDDDDD +""" + +## Raw solver output: +9 10 10 +(4, 4) (4, 3) (5, 3) +(6, 4) (5, 4) (5, 5) (4, 5) (3, 5) (3, 4) (3, 3) (3, 2) (4, 2) (5, 2) (6, 2) (6, 3) (7, 3) (8, 3) (8, 4) (8, 5) (8, 6) (7, 6) +(1, 9) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(9, 9) (8, 9) (7, 9) (6, 9) (5, 9) (4, 9) (3, 9) (3, 8) +(7, 2) (8, 2) (8, 1) +(8, 7) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 8) (2, 9) +(4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (9, 8) (9, 7) (9, 6) (9, 5) (9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (7, 1) (6, 1) (5, 1) (4, 1) (3, 1) +(2, 1) (2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (7, 5) (7, 4) +(0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) + +Touching forbidden +Nodes 285 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(4, 4) (5, 3) +(6, 4) (7, 6) +(1, 9) (1, 1) +(9, 9) (3, 8) +(7, 2) (8, 1) +(8, 7) (2, 9) +(4, 8) (3, 1) +(2, 1) (7, 4) +(0, 9) (6, 0) diff --git a/submodules/flowfree/generated/10x10_9c_9_61ffb2de.txt b/submodules/flowfree/generated/10x10_9c_9_61ffb2de.txt new file mode 100644 index 0000000000000000000000000000000000000000..49e23fa30466ed9548b57e9c313d884c299ce65a --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_9_61ffb2de.txt @@ -0,0 +1,69 @@ +""" +.F...B.... +.A.H.H.I.. +.......... +F.......I. +...DAD...C +.G.....E.. +...B....G. +.......... +.......... +.....EC... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(1, 1) (4, 4) +(5, 0) (3, 6) +(6, 9) (9, 4) +(3, 4) (5, 4) +(5, 9) (7, 5) +(1, 0) (0, 3) +(1, 5) (8, 6) +(5, 1) (3, 1) +(7, 1) (8, 3) + + param line: 9 10 10 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBBBCCCC +FABHHHCIIC +FABBBBCCIC +FAAAABBCIC +EEEDADBCCC +EGEDDDBECC +EGEBBBBEGC +EGEEEEEEGC +EGGGGGGGGC +EEEEEECCCC +""" + +## Raw solver output: +9 10 10 +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (4, 3) (4, 4) +(5, 0) (4, 0) (3, 0) (2, 0) (2, 1) (2, 2) (3, 2) (4, 2) (5, 2) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) +(6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (8, 5) (8, 4) (7, 4) (7, 3) (7, 2) (6, 2) (6, 1) (6, 0) (7, 0) (8, 0) (9, 0) (9, 1) (9, 2) (9, 3) (9, 4) +(3, 4) (3, 5) (4, 5) (5, 5) (5, 4) +(5, 9) (4, 9) (3, 9) (2, 9) (1, 9) (0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (2, 5) (2, 6) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(1, 5) (1, 6) (1, 7) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) +(5, 1) (4, 1) (3, 1) +(7, 1) (8, 1) (8, 2) (8, 3) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(1, 1) (4, 4) +(5, 0) (3, 6) +(6, 9) (9, 4) +(3, 4) (5, 4) +(5, 9) (7, 5) +(1, 0) (0, 3) +(1, 5) (8, 6) +(5, 1) (3, 1) +(7, 1) (8, 3) diff --git a/submodules/flowfree/generated/10x10_9c_9_cd48935d.txt b/submodules/flowfree/generated/10x10_9c_9_cd48935d.txt new file mode 100644 index 0000000000000000000000000000000000000000..ce7146cdd34f13bcff20368830c4f8c1270cc0cb --- /dev/null +++ b/submodules/flowfree/generated/10x10_9c_9_cd48935d.txt @@ -0,0 +1,69 @@ +""" +......H... +CE......H. +I......... +..C.F..... +..B....F.. +.......... +..B....... +I.E....D.. +..A..DG... +AG........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 10 10 +(2, 8) (0, 9) +(2, 4) (2, 6) +(2, 3) (0, 1) +(7, 7) (5, 8) +(1, 1) (2, 7) +(7, 4) (4, 3) +(1, 9) (6, 8) +(8, 1) (6, 0) +(0, 7) (0, 2) + + param line: 9 10 10 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCHHHHFFF +CECHFFFFHF +IECHFHHHHF +IECHFHGGGF +IEBHHHGFGF +IEBGGGGFGF +IEBGFFFFGF +IEEGFDDDGF +AAAGFDGGGF +AGGGFFFFFF +""" + +## Raw solver output: +9 10 10 +(2, 8) (1, 8) (0, 8) (0, 9) +(2, 4) (2, 5) (2, 6) +(2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) +(7, 7) (6, 7) (5, 7) (5, 8) +(1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) +(7, 4) (7, 5) (7, 6) (6, 6) (5, 6) (4, 6) (4, 7) (4, 8) (4, 9) (5, 9) (6, 9) (7, 9) (8, 9) (9, 9) (9, 8) (9, 7) (9, 6) (9, 5) (9, 4) (9, 3) (9, 2) (9, 1) (9, 0) (8, 0) (7, 0) (7, 1) (6, 1) (5, 1) (4, 1) (4, 2) (4, 3) +(1, 9) (2, 9) (3, 9) (3, 8) (3, 7) (3, 6) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (7, 3) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) +(8, 1) (8, 2) (7, 2) (6, 2) (5, 2) (5, 3) (5, 4) (4, 4) (3, 4) (3, 3) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) (6, 0) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 244 +Solutions 1 + +## Solver input (raw puzzle block): +9 10 10 +(2, 8) (0, 9) +(2, 4) (2, 6) +(2, 3) (0, 1) +(7, 7) (5, 8) +(1, 1) (2, 7) +(7, 4) (4, 3) +(1, 9) (6, 8) +(8, 1) (6, 0) +(0, 7) (0, 2) diff --git a/submodules/flowfree/generated/11x11_10c_1_2832e7ee.txt b/submodules/flowfree/generated/11x11_10c_1_2832e7ee.txt new file mode 100644 index 0000000000000000000000000000000000000000..69bcb47a9c8e03793df3e27618980488cf5a1182 --- /dev/null +++ b/submodules/flowfree/generated/11x11_10c_1_2832e7ee.txt @@ -0,0 +1,74 @@ +""" +C....F..... +...J...F... +GH......E.. +........... +.D.J....... +...B....... +....IA.A... +....B...... +....C.E.I.. +..D.GH..... +........... +""" + +# ---- raw puzzle block (for reproducibility) ---- +10 11 11 +(7, 6) (5, 6) +(4, 7) (3, 5) +(0, 0) (4, 8) +(2, 9) (1, 4) +(8, 2) (6, 8) +(5, 0) (7, 1) +(4, 9) (0, 2) +(5, 9) (1, 2) +(4, 6) (8, 8) +(3, 1) (3, 4) + + param line: 10 11 11 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCFEEEEE +GGGJCFEFFFE +GHGJCFEEEFE +HHGJCFFFFFE +HDGJCCCCCCE +HDGBIIIIICE +HDGBIAAAICE +HDGBBCCCICE +HDGGCCECICE +HDDGGHECCCE +HHHHHHEEEEE +""" + +## Raw solver output: +10 11 11 +(7, 6) (6, 6) (5, 6) +(4, 7) (3, 7) (3, 6) (3, 5) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (5, 4) (6, 4) (7, 4) (8, 4) (9, 4) (9, 5) (9, 6) (9, 7) (9, 8) (9, 9) (8, 9) (7, 9) (7, 8) (7, 7) (6, 7) (5, 7) (5, 8) (4, 8) +(2, 9) (1, 9) (1, 8) (1, 7) (1, 6) (1, 5) (1, 4) +(8, 2) (7, 2) (6, 2) (6, 1) (6, 0) (7, 0) (8, 0) (9, 0) (10, 0) (10, 1) (10, 2) (10, 3) (10, 4) (10, 5) (10, 6) (10, 7) (10, 8) (10, 9) (10, 10) (9, 10) (8, 10) (7, 10) (6, 10) (6, 9) (6, 8) +(5, 0) (5, 1) (5, 2) (5, 3) (6, 3) (7, 3) (8, 3) (9, 3) (9, 2) (9, 1) (8, 1) (7, 1) +(4, 9) (3, 9) (3, 8) (2, 8) (2, 7) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) (2, 1) (1, 1) (0, 1) (0, 2) +(5, 9) (5, 10) (4, 10) (3, 10) (2, 10) (1, 10) (0, 10) (0, 9) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (1, 2) +(4, 6) (4, 5) (5, 5) (6, 5) (7, 5) (8, 5) (8, 6) (8, 7) (8, 8) +(3, 1) (3, 2) (3, 3) (3, 4) + +Touching forbidden +Nodes 183 +Solutions 1 + +## Solver input (raw puzzle block): +10 11 11 +(7, 6) (5, 6) +(4, 7) (3, 5) +(0, 0) (4, 8) +(2, 9) (1, 4) +(8, 2) (6, 8) +(5, 0) (7, 1) +(4, 9) (0, 2) +(5, 9) (1, 2) +(4, 6) (8, 8) +(3, 1) (3, 4) diff --git a/submodules/flowfree/generated/5x5_3c_10_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_10_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_10_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_10_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_10_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_10_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_10_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_10_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_10_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_1_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_1_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_1_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_1_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_1_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_1_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_1_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_1_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_1_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_2_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_2_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_2_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_2_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_2_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_2_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_2_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_2_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_2_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_3_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_3_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_3_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_3_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_3_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_3_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_3_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_3_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_3_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_4_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_4_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_4_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_4_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_4_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_4_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_4_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_4_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_4_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_5_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_5_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_5_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_5_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_5_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_5_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_5_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_5_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_5_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_6_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_6_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_6_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_6_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_6_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_6_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_6_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_6_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_6_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_7_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_7_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_7_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_7_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_7_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_7_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_7_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_7_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_7_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_8_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_8_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_8_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_8_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_8_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_8_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_8_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_8_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_8_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_3c_9_3b79ecca.txt b/submodules/flowfree/generated/5x5_3c_9_3b79ecca.txt new file mode 100644 index 0000000000000000000000000000000000000000..b68876e4e04f56206a0466bb63cee3b3c38e677e --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_9_3b79ecca.txt @@ -0,0 +1,41 @@ +""" +..... +B..C. +...A. +.A.B. +....C +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) + + param line: 3 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BCCCB +CCAAB +CAABB +CCCCC +""" + +## Raw solver output: +3 5 5 +(3, 2) (2, 2) (2, 3) (1, 3) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(3, 2) (1, 3) +(0, 1) (3, 3) +(4, 4) (3, 1) diff --git a/submodules/flowfree/generated/5x5_3c_9_3b862eec.txt b/submodules/flowfree/generated/5x5_3c_9_3b862eec.txt new file mode 100644 index 0000000000000000000000000000000000000000..19316aa33c4d9b25adb5efc581a0144818025580 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_9_3b862eec.txt @@ -0,0 +1,41 @@ +""" +A.... +.B.B. +...C. +..C.. +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) + + param line: 3 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +ABBBB +ABBCB +ABCCB +ABBBB +""" + +## Raw solver output: +3 5 5 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 33 +Solutions 1 + +## Solver input (raw puzzle block): +3 5 5 +(0, 4) (0, 0) +(3, 1) (1, 1) +(2, 3) (3, 2) diff --git a/submodules/flowfree/generated/5x5_3c_9_87fc29c5.txt b/submodules/flowfree/generated/5x5_3c_9_87fc29c5.txt new file mode 100644 index 0000000000000000000000000000000000000000..f5f300ae5e02607c2f5bc332beeaf95e23ee8e89 --- /dev/null +++ b/submodules/flowfree/generated/5x5_3c_9_87fc29c5.txt @@ -0,0 +1,39 @@ +""" +...A. +.C.B. +..B.. +..C.. +....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBAA +BCBBA +BCBBA +BCCBA +BBBBA +""" + +## Raw solver output: +3 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) +(1, 1) (1, 2) (1, 3) (2, 3) + +Touching forbidden +Nodes 35 +Solutions 2 + +## Solver input (raw puzzle block): +3 5 5 +(4, 4) (3, 0) +(3, 1) (2, 2) +(1, 1) (2, 3) diff --git a/submodules/flowfree/generated/5x5_4c_10_707b086f.txt b/submodules/flowfree/generated/5x5_4c_10_707b086f.txt new file mode 100644 index 0000000000000000000000000000000000000000..99f2a047af6f40881d1267e8a7e889aaadfa1ce0 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_10_707b086f.txt @@ -0,0 +1,44 @@ +""" +D.... +C.... +B.... +.ABC. +AD... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(0, 4) (1, 3) +(0, 2) (2, 3) +(3, 3) (0, 1) +(0, 0) (1, 4) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDD +CCCCD +BBBCD +AABCD +ADDDD +""" + +## Raw solver output: +4 5 5 +(0, 4) (0, 3) (1, 3) +(0, 2) (1, 2) (2, 2) (2, 3) +(3, 3) (3, 2) (3, 1) (2, 1) (1, 1) (0, 1) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(0, 4) (1, 3) +(0, 2) (2, 3) +(3, 3) (0, 1) +(0, 0) (1, 4) diff --git a/submodules/flowfree/generated/5x5_4c_10_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_10_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_10_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_1_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_1_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_1_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_1_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_1_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_1_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_2_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_2_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_2_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_2_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_2_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_2_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_3_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_3_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_3_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_3_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_3_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_3_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_4_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_4_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_4_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_4_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_4_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_4_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_5_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_5_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_5_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_5_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_5_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_5_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_6_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_6_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_6_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_6_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_6_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_6_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_7_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_7_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_7_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_7_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_7_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_7_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_8_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_8_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_8_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_8_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_8_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_8_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_4c_9_812f5e6a.txt b/submodules/flowfree/generated/5x5_4c_9_812f5e6a.txt new file mode 100644 index 0000000000000000000000000000000000000000..3229524f2d45457dc221b1e62a4580984487937c --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_9_812f5e6a.txt @@ -0,0 +1,44 @@ +""" +AB... +...C. +DA... +.C.BD +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) + + param line: 4 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBBB +AACCB +DACBB +DCCBD +DDDDD +""" + +## Raw solver output: +4 5 5 +(1, 2) (1, 1) (0, 1) (0, 0) +(3, 3) (3, 2) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(1, 2) (0, 0) +(3, 3) (1, 0) +(1, 3) (3, 1) +(4, 3) (0, 2) diff --git a/submodules/flowfree/generated/5x5_4c_9_904e33b2.txt b/submodules/flowfree/generated/5x5_4c_9_904e33b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0bf853f2b9a59c8b26365adfbaf0fe33ee49c9b5 --- /dev/null +++ b/submodules/flowfree/generated/5x5_4c_9_904e33b2.txt @@ -0,0 +1,44 @@ +""" +..... +.D.AB +B.ADC +C.... +..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) + + param line: 4 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBB +BDAAB +BDADC +CDDDC +CCCCC +""" + +## Raw solver output: +4 5 5 +(3, 1) (2, 1) (2, 2) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +4 5 5 +(3, 1) (2, 2) +(4, 1) (0, 2) +(4, 2) (0, 3) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/5x5_5c_10_22075c83.txt b/submodules/flowfree/generated/5x5_5c_10_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_10_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_10_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_10_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_10_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_10_a482332b.txt b/submodules/flowfree/generated/5x5_5c_10_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_10_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_1_22075c83.txt b/submodules/flowfree/generated/5x5_5c_1_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_1_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_1_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_1_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_1_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_1_a482332b.txt b/submodules/flowfree/generated/5x5_5c_1_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_1_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_2_22075c83.txt b/submodules/flowfree/generated/5x5_5c_2_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_2_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_2_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_2_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_2_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_2_a482332b.txt b/submodules/flowfree/generated/5x5_5c_2_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_2_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_3_22075c83.txt b/submodules/flowfree/generated/5x5_5c_3_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_3_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_3_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_3_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_3_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_3_a482332b.txt b/submodules/flowfree/generated/5x5_5c_3_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_3_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_4_22075c83.txt b/submodules/flowfree/generated/5x5_5c_4_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_4_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_4_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_4_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_4_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_4_a482332b.txt b/submodules/flowfree/generated/5x5_5c_4_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_4_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_5_22075c83.txt b/submodules/flowfree/generated/5x5_5c_5_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_5_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_5_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_5_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_5_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_5_a482332b.txt b/submodules/flowfree/generated/5x5_5c_5_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_5_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_6_22075c83.txt b/submodules/flowfree/generated/5x5_5c_6_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_6_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_6_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_6_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_6_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_6_a482332b.txt b/submodules/flowfree/generated/5x5_5c_6_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_6_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_7_22075c83.txt b/submodules/flowfree/generated/5x5_5c_7_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_7_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_7_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_7_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_7_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_7_a482332b.txt b/submodules/flowfree/generated/5x5_5c_7_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_7_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_8_22075c83.txt b/submodules/flowfree/generated/5x5_5c_8_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_8_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_8_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_8_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_8_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_8_a482332b.txt b/submodules/flowfree/generated/5x5_5c_8_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_8_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/5x5_5c_9_22075c83.txt b/submodules/flowfree/generated/5x5_5c_9_22075c83.txt new file mode 100644 index 0000000000000000000000000000000000000000..8d3a46cfd867ae18160fdecfad0322e7f3f52f58 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_9_22075c83.txt @@ -0,0 +1,47 @@ +""" +C...C +..EDA +..... +.DEBA +....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) + + param line: 5 5 5 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCC +EEEDA +EDDDA +EDEBA +EEEBB +""" + +## Raw solver output: +5 5 5 +(4, 3) (4, 2) (4, 1) +(3, 3) (3, 4) (4, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (3, 1) +(2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 3) (4, 1) +(3, 3) (4, 4) +(0, 0) (4, 0) +(1, 3) (3, 1) +(2, 3) (2, 1) diff --git a/submodules/flowfree/generated/5x5_5c_9_4f5ec3ca.txt b/submodules/flowfree/generated/5x5_5c_9_4f5ec3ca.txt new file mode 100644 index 0000000000000000000000000000000000000000..65e7e8453841180a3154fd8b1d6999aef67208f7 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_9_4f5ec3ca.txt @@ -0,0 +1,47 @@ +""" +DECB. +..... +..E.B +DC..A +A.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) + + param line: 5 5 5 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DECBB +DECCB +DEECB +DCCCA +AAAAA +""" + +## Raw solver output: +5 5 5 +(0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) +(4, 2) (4, 1) (4, 0) (3, 0) +(2, 0) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (1, 3) +(0, 3) (0, 2) (0, 1) (0, 0) +(1, 0) (1, 1) (1, 2) (2, 2) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(0, 4) (4, 3) +(4, 2) (3, 0) +(2, 0) (1, 3) +(0, 3) (0, 0) +(1, 0) (2, 2) diff --git a/submodules/flowfree/generated/5x5_5c_9_a482332b.txt b/submodules/flowfree/generated/5x5_5c_9_a482332b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c47ed559e64c1e865aac4ba97b8886fcff659b25 --- /dev/null +++ b/submodules/flowfree/generated/5x5_5c_9_a482332b.txt @@ -0,0 +1,45 @@ +""" +E.DA. +C..B. +..... +..D.. +C.EBA +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDAA +CEDBA +CEDBA +CEDBA +CEEBA +""" + +## Raw solver output: +5 5 5 +(4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) +(3, 1) (3, 2) (3, 3) (3, 4) +(0, 1) (0, 2) (0, 3) (0, 4) +(2, 3) (2, 2) (2, 1) (2, 0) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) + +Touching forbidden +Nodes 26 +Solutions 1 + +## Solver input (raw puzzle block): +5 5 5 +(4, 4) (3, 0) +(3, 1) (3, 4) +(0, 1) (0, 4) +(2, 3) (2, 0) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/6x6_4c_10_7e2f1ba3.txt b/submodules/flowfree/generated/6x6_4c_10_7e2f1ba3.txt new file mode 100644 index 0000000000000000000000000000000000000000..3f4758d8e81cc3e6549cad51a87c5e6109b87136 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_10_7e2f1ba3.txt @@ -0,0 +1,46 @@ +""" +D..... +..A.A. +...... +....BC +.D..C. +.....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(2, 1) (4, 1) +(4, 3) (5, 5) +(4, 4) (5, 3) +(0, 0) (1, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB +""" + +## Raw solver output: +4 6 6 +(2, 1) (3, 1) (4, 1) +(4, 3) (3, 3) (3, 4) (3, 5) (4, 5) (5, 5) +(4, 4) (5, 4) (5, 3) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(2, 1) (4, 1) +(4, 3) (5, 5) +(4, 4) (5, 3) +(0, 0) (1, 4) diff --git a/submodules/flowfree/generated/6x6_4c_10_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_10_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_10_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_10_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_10_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_10_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_1_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_1_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_1_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_1_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_1_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_1_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_1_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_1_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_1_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_2_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_2_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_2_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_2_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_2_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_2_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_2_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_2_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_2_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_3_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_3_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_3_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_3_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_3_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_3_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_3_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_3_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_3_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_4_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_4_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_4_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_4_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_4_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_4_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_4_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_4_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_4_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_5_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_5_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_5_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_5_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_5_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_5_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_5_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_5_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_5_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_6_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_6_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_6_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_6_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_6_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_6_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_6_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_6_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_6_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_7_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_7_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_7_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_7_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_7_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_7_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_7_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_7_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_7_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_8_145c5d4f.txt b/submodules/flowfree/generated/6x6_4c_8_145c5d4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..9553845bd0746e39f04089edf6d834dc60f8232d --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_8_145c5d4f.txt @@ -0,0 +1,46 @@ +""" +.....B +..AC.. +.....C +...D.. +.AB.D. +...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BAACCC +BABBBC +BABDBB +BABDDB +BBBBBB +""" + +## Raw solver output: +4 6 6 +(1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(5, 2) (5, 1) (4, 1) (3, 1) +(3, 3) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 4) (2, 1) +(5, 0) (2, 4) +(5, 2) (3, 1) +(3, 3) (4, 4) diff --git a/submodules/flowfree/generated/6x6_4c_8_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_8_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_8_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_8_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_8_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_8_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_4c_9_7e2f1ba3.txt b/submodules/flowfree/generated/6x6_4c_9_7e2f1ba3.txt new file mode 100644 index 0000000000000000000000000000000000000000..3f4758d8e81cc3e6549cad51a87c5e6109b87136 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_9_7e2f1ba3.txt @@ -0,0 +1,46 @@ +""" +D..... +..A.A. +...... +....BC +.D..C. +.....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(2, 1) (4, 1) +(4, 3) (5, 5) +(4, 4) (5, 3) +(0, 0) (1, 4) + + param line: 4 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DDAAAD +DDDDDD +DDDBBC +DDDBCC +DDDBBB +""" + +## Raw solver output: +4 6 6 +(2, 1) (3, 1) (4, 1) +(4, 3) (3, 3) (3, 4) (3, 5) (4, 5) (5, 5) +(4, 4) (5, 4) (5, 3) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(2, 1) (4, 1) +(4, 3) (5, 5) +(4, 4) (5, 3) +(0, 0) (1, 4) diff --git a/submodules/flowfree/generated/6x6_4c_9_a09192ab.txt b/submodules/flowfree/generated/6x6_4c_9_a09192ab.txt new file mode 100644 index 0000000000000000000000000000000000000000..cadc4ba9a97fa7f2a6e3a32f99071753815d05b2 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_9_a09192ab.txt @@ -0,0 +1,44 @@ +""" +C.B... +A..... +...A.. +.D.... +.C.B.. +.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBB +ACCCCB +AAAACB +DDCCCB +DCCBBB +DDDDDD +""" + +## Raw solver output: +4 6 6 +(3, 2) (2, 2) (1, 2) (0, 2) (0, 1) +(3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) +(0, 0) (1, 0) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (1, 3) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(3, 2) (0, 1) +(3, 4) (2, 0) +(0, 0) (1, 4) +(5, 5) (1, 3) diff --git a/submodules/flowfree/generated/6x6_4c_9_f296c06e.txt b/submodules/flowfree/generated/6x6_4c_9_f296c06e.txt new file mode 100644 index 0000000000000000000000000000000000000000..157e88865d9ccbdcbfd35717549ecf6486b114f5 --- /dev/null +++ b/submodules/flowfree/generated/6x6_4c_9_f296c06e.txt @@ -0,0 +1,46 @@ +""" +...... +...... +...B.D +...C.. +.....A +DA.B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) + + param line: 4 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDD +DAAAAD +DABBAD +DABCAA +DABCCA +DABBCC +""" + +## Raw solver output: +4 6 6 +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (5, 3) (5, 4) +(3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) +(5, 5) (4, 5) (4, 4) (3, 4) (3, 3) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +4 6 6 +(1, 5) (5, 4) +(3, 5) (3, 2) +(5, 5) (3, 3) +(0, 5) (5, 2) diff --git a/submodules/flowfree/generated/6x6_5c_10_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_10_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_10_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_10_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_10_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_10_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_1_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_1_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_1_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_1_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_1_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_1_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_2_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_2_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_2_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_2_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_2_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_2_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_3_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_3_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_3_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_3_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_3_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_3_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_4_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_4_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_4_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_4_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_4_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_4_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_5_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_5_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_5_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_5_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_5_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_5_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_6_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_6_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_6_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_6_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_6_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_6_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_7_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_7_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_7_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_7_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_7_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_7_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_8_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_8_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_8_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_8_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_8_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_8_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_5c_9_25f9a72a.txt b/submodules/flowfree/generated/6x6_5c_9_25f9a72a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c1f076261aea02b8216b6d8e8142d131e89aaed8 --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_9_25f9a72a.txt @@ -0,0 +1,49 @@ +""" +C.D... +....B. +...B.. +....E. +C.A..E +D....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) + + param line: 5 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDEEE +CDEEBE +CDEBBE +CDEEEE +CDAEEE +DDAAAA +""" + +## Raw solver output: +5 6 6 +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) +(3, 2) (4, 2) (4, 1) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(0, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (4, 3) + +Touching forbidden +Nodes 39 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(2, 4) (5, 5) +(3, 2) (4, 1) +(0, 4) (0, 0) +(0, 5) (2, 0) +(5, 4) (4, 3) diff --git a/submodules/flowfree/generated/6x6_5c_9_3ac21572.txt b/submodules/flowfree/generated/6x6_5c_9_3ac21572.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf310ad06a8810732dd5c2b96c6750b1fb30829f --- /dev/null +++ b/submodules/flowfree/generated/6x6_5c_9_3ac21572.txt @@ -0,0 +1,49 @@ +""" +...... +B..... +...A.. +.A.CE. +.D..B. +.ED..C +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) + + param line: 5 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBB +BEEEEB +EEAAEB +EAACEB +EDDCBB +EEDCCC +""" + +## Raw solver output: +5 6 6 +(1, 3) (2, 3) (2, 2) (3, 2) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(1, 4) (2, 4) (2, 5) +(4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +5 6 6 +(1, 3) (3, 2) +(4, 4) (0, 1) +(5, 5) (3, 3) +(1, 4) (2, 5) +(4, 3) (1, 5) diff --git a/submodules/flowfree/generated/6x6_6c_10_396060ff.txt b/submodules/flowfree/generated/6x6_6c_10_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_10_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_10_3a68d0e8.txt b/submodules/flowfree/generated/6x6_6c_10_3a68d0e8.txt new file mode 100644 index 0000000000000000000000000000000000000000..770010e5c8c574df2b86cf38b18c5a8d5e0fce35 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_10_3a68d0e8.txt @@ -0,0 +1,52 @@ +""" +BA...A +..E... +..D.F. +..F..D +..C.CE +B..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE +""" + +## Raw solver output: +6 6 6 +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) +(4, 4) (3, 4) (2, 4) +(5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) +(5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(4, 2) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 47 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) diff --git a/submodules/flowfree/generated/6x6_6c_10_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_10_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_10_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_1_35b6178f.txt b/submodules/flowfree/generated/6x6_6c_1_35b6178f.txt new file mode 100644 index 0000000000000000000000000000000000000000..0775e7e46c22001aba810905f01c42f6a31b474b --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_1_35b6178f.txt @@ -0,0 +1,50 @@ +""" +F.A.ED +....D. +..E..A +....C. +....FC +B....B +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 2) (2, 0) +(0, 5) (5, 5) +(5, 4) (4, 3) +(4, 1) (5, 0) +(4, 0) (2, 2) +(0, 0) (4, 4) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FAAEED +FAEEDD +FAEAAA +FAAACC +FFFFFC +BBBBBB +""" + +## Raw solver output: +6 6 6 +(5, 2) (4, 2) (3, 2) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) +(0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 4) (5, 3) (4, 3) +(4, 1) (5, 1) (5, 0) +(4, 0) (3, 0) (3, 1) (2, 1) (2, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 2) (2, 0) +(0, 5) (5, 5) +(5, 4) (4, 3) +(4, 1) (5, 0) +(4, 0) (2, 2) +(0, 0) (4, 4) diff --git a/submodules/flowfree/generated/6x6_6c_1_396060ff.txt b/submodules/flowfree/generated/6x6_6c_1_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_1_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_1_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_1_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_1_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_2_396060ff.txt b/submodules/flowfree/generated/6x6_6c_2_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_2_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_2_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_2_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_2_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_2_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_2_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_2_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_3_396060ff.txt b/submodules/flowfree/generated/6x6_6c_3_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_3_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_3_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_3_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_3_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_3_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_3_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_3_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_4_396060ff.txt b/submodules/flowfree/generated/6x6_6c_4_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_4_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_4_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_4_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_4_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_4_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_4_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_4_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_5_396060ff.txt b/submodules/flowfree/generated/6x6_6c_5_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_5_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_5_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_5_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_5_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_5_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_5_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_5_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_6_396060ff.txt b/submodules/flowfree/generated/6x6_6c_6_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_6_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_6_c60e480c.txt b/submodules/flowfree/generated/6x6_6c_6_c60e480c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2bd1f73bf1d8dc3bd6b6a118d44a1be7c533f55e --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_6_c60e480c.txt @@ -0,0 +1,52 @@ +""" +F.FA.. +...DB. +...... +.B..E. +.E.C.A +...D.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFAAA +DDDDBA +DBBBBA +DBEEEA +DEECCA +DDDDCC +""" + +## Raw solver output: +6 6 6 +(5, 4) (5, 3) (5, 2) (5, 1) (5, 0) (4, 0) (3, 0) +(1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) +(3, 4) (4, 4) (4, 5) (5, 5) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (1, 4) +(0, 0) (1, 0) (2, 0) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 4) (3, 0) +(1, 3) (4, 1) +(3, 4) (5, 5) +(3, 5) (3, 1) +(4, 3) (1, 4) +(0, 0) (2, 0) diff --git a/submodules/flowfree/generated/6x6_6c_6_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_6_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_6_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_7_396060ff.txt b/submodules/flowfree/generated/6x6_6c_7_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_7_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_7_3a68d0e8.txt b/submodules/flowfree/generated/6x6_6c_7_3a68d0e8.txt new file mode 100644 index 0000000000000000000000000000000000000000..770010e5c8c574df2b86cf38b18c5a8d5e0fce35 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_7_3a68d0e8.txt @@ -0,0 +1,52 @@ +""" +BA...A +..E... +..D.F. +..F..D +..C.CE +B..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE +""" + +## Raw solver output: +6 6 6 +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) +(4, 4) (3, 4) (2, 4) +(5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) +(5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(4, 2) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 47 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) diff --git a/submodules/flowfree/generated/6x6_6c_7_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_7_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_7_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_8_396060ff.txt b/submodules/flowfree/generated/6x6_6c_8_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_8_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_8_3a68d0e8.txt b/submodules/flowfree/generated/6x6_6c_8_3a68d0e8.txt new file mode 100644 index 0000000000000000000000000000000000000000..770010e5c8c574df2b86cf38b18c5a8d5e0fce35 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_8_3a68d0e8.txt @@ -0,0 +1,52 @@ +""" +BA...A +..E... +..D.F. +..F..D +..C.CE +B..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE +""" + +## Raw solver output: +6 6 6 +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) +(4, 4) (3, 4) (2, 4) +(5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) +(5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(4, 2) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 47 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) diff --git a/submodules/flowfree/generated/6x6_6c_8_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_8_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_8_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/6x6_6c_9_396060ff.txt b/submodules/flowfree/generated/6x6_6c_9_396060ff.txt new file mode 100644 index 0000000000000000000000000000000000000000..1b24bd3f6a441d141f5ddd5d378e62906d9a6698 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_9_396060ff.txt @@ -0,0 +1,52 @@ +""" +AEF... +....D. +...DC. +B..... +....C. +.BA.EF +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) + + param line: 6 6 6 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AEFFFF +AEEDDF +AAEDCF +BAEECF +BAAECF +BBAEEF +""" + +## Raw solver output: +6 6 6 +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 3) (0, 4) (0, 5) (1, 5) +(4, 4) (4, 3) (4, 2) +(3, 2) (3, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (1, 1) (1, 0) +(2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(0, 0) (2, 5) +(0, 3) (1, 5) +(4, 4) (4, 2) +(3, 2) (4, 1) +(4, 5) (1, 0) +(2, 0) (5, 5) diff --git a/submodules/flowfree/generated/6x6_6c_9_3a68d0e8.txt b/submodules/flowfree/generated/6x6_6c_9_3a68d0e8.txt new file mode 100644 index 0000000000000000000000000000000000000000..770010e5c8c574df2b86cf38b18c5a8d5e0fce35 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_9_3a68d0e8.txt @@ -0,0 +1,52 @@ +""" +BA...A +..E... +..D.F. +..F..D +..C.CE +B..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) + + param line: 6 6 6 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BAAAAA +BEEDDD +BEDDFD +BEFFFD +BECCCE +BEEEEE +""" + +## Raw solver output: +6 6 6 +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) +(4, 4) (3, 4) (2, 4) +(5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) +(5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(4, 2) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 47 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(5, 0) (1, 0) +(0, 0) (0, 5) +(4, 4) (2, 4) +(5, 3) (2, 2) +(5, 4) (2, 1) +(4, 2) (2, 3) diff --git a/submodules/flowfree/generated/6x6_6c_9_f86ee188.txt b/submodules/flowfree/generated/6x6_6c_9_f86ee188.txt new file mode 100644 index 0000000000000000000000000000000000000000..aa7d15a71c1669f10fb9ffb7ff1556e07a2c7b56 --- /dev/null +++ b/submodules/flowfree/generated/6x6_6c_9_f86ee188.txt @@ -0,0 +1,50 @@ +""" +BD...E +.ED.C. +....A. +...... +BAC... +F....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BDDEEE +BEDECC +BEEEAC +BAAAAC +BACCCC +FFFFFF +""" + +## Raw solver output: +6 6 6 +(1, 4) (1, 3) (2, 3) (3, 3) (4, 3) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(2, 4) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(1, 0) (2, 0) (2, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) + +Touching forbidden +Nodes 37 +Solutions 1 + +## Solver input (raw puzzle block): +6 6 6 +(1, 4) (4, 2) +(0, 0) (0, 4) +(2, 4) (4, 1) +(1, 0) (2, 1) +(1, 1) (5, 0) +(5, 5) (0, 5) diff --git a/submodules/flowfree/generated/7x7_5c_10_799f6348.txt b/submodules/flowfree/generated/7x7_5c_10_799f6348.txt new file mode 100644 index 0000000000000000000000000000000000000000..1550d45483fa90aba34bbc85e025e1b0ea08661b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_10_799f6348.txt @@ -0,0 +1,51 @@ +""" +C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 3) (4, 1) +(6, 6) (0, 5) +(0, 0) (1, 3) +(2, 1) (2, 4) +(4, 3) (3, 1) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB +""" + +## Raw solver output: +5 7 7 +(3, 3) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) +(2, 1) (2, 2) (2, 3) (2, 4) +(4, 3) (4, 2) (3, 2) (3, 1) + +Touching forbidden +Nodes 59 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 3) (4, 1) +(6, 6) (0, 5) +(0, 0) (1, 3) +(2, 1) (2, 4) +(4, 3) (3, 1) diff --git a/submodules/flowfree/generated/7x7_5c_10_9adff41d.txt b/submodules/flowfree/generated/7x7_5c_10_9adff41d.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf4882506253a000d90a23363db6745468d9895b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_10_9adff41d.txt @@ -0,0 +1,49 @@ +""" +C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) +(4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(4, 1) (3, 1) (2, 1) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) diff --git a/submodules/flowfree/generated/7x7_5c_10_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_10_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_10_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_1_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_1_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_1_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_1_629a2f5e.txt b/submodules/flowfree/generated/7x7_5c_1_629a2f5e.txt new file mode 100644 index 0000000000000000000000000000000000000000..120ae46140e8ac1404307deecc1c4552dfaffc89 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_1_629a2f5e.txt @@ -0,0 +1,51 @@ +""" +...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA +""" + +## Raw solver output: +5 7 7 +(5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(5, 5) (5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) +(1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_1_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_1_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_1_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_2_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_2_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_2_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_2_629a2f5e.txt b/submodules/flowfree/generated/7x7_5c_2_629a2f5e.txt new file mode 100644 index 0000000000000000000000000000000000000000..120ae46140e8ac1404307deecc1c4552dfaffc89 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_2_629a2f5e.txt @@ -0,0 +1,51 @@ +""" +...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA +""" + +## Raw solver output: +5 7 7 +(5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(5, 5) (5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) +(1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_2_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_2_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_2_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_3_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_3_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_3_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_3_629a2f5e.txt b/submodules/flowfree/generated/7x7_5c_3_629a2f5e.txt new file mode 100644 index 0000000000000000000000000000000000000000..120ae46140e8ac1404307deecc1c4552dfaffc89 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_3_629a2f5e.txt @@ -0,0 +1,51 @@ +""" +...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA +""" + +## Raw solver output: +5 7 7 +(5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(5, 5) (5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) +(1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_3_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_3_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_3_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_4_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_4_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_4_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_4_629a2f5e.txt b/submodules/flowfree/generated/7x7_5c_4_629a2f5e.txt new file mode 100644 index 0000000000000000000000000000000000000000..120ae46140e8ac1404307deecc1c4552dfaffc89 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_4_629a2f5e.txt @@ -0,0 +1,51 @@ +""" +...CD.. +.AB..A. +....D.. +....... +....... +.....B. +CE.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCDDD +CABAAAD +CABADDD +CABAAAA +CABBBBA +CAAAABA +CEEEAAA +""" + +## Raw solver output: +5 7 7 +(5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(5, 5) (5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) +(1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(5, 1) (1, 1) +(5, 5) (2, 1) +(3, 0) (0, 6) +(4, 0) (4, 2) +(1, 6) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_4_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_4_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_4_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_5_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_5_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_5_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_5_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_5_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_5_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_5_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_5_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_5_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_6_26f5cc22.txt b/submodules/flowfree/generated/7x7_5c_6_26f5cc22.txt new file mode 100644 index 0000000000000000000000000000000000000000..c91f8295cdf4114995d6b791ec5d5ac9f3314a9a --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_6_26f5cc22.txt @@ -0,0 +1,49 @@ +""" +DE.B... +.....C. +....C.. +....... +....B.. +...A.A. +.D.E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEBBAAA +DEBAACA +DEBACCA +DEBAAAA +DEBBBAA +DEEAAAA +DDEEAAA +""" + +## Raw solver output: +5 7 7 +(3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 5) (5, 5) +(4, 4) (3, 0) +(5, 1) (4, 2) +(0, 0) (1, 6) +(3, 6) (1, 0) diff --git a/submodules/flowfree/generated/7x7_5c_6_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_6_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_6_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_6_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_6_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_6_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_7_9adff41d.txt b/submodules/flowfree/generated/7x7_5c_7_9adff41d.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf4882506253a000d90a23363db6745468d9895b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_7_9adff41d.txt @@ -0,0 +1,49 @@ +""" +C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) +(4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(4, 1) (3, 1) (2, 1) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) diff --git a/submodules/flowfree/generated/7x7_5c_7_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_7_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_7_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_7_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_7_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_7_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_8_9adff41d.txt b/submodules/flowfree/generated/7x7_5c_8_9adff41d.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf4882506253a000d90a23363db6745468d9895b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_8_9adff41d.txt @@ -0,0 +1,49 @@ +""" +C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) +(4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(4, 1) (3, 1) (2, 1) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) diff --git a/submodules/flowfree/generated/7x7_5c_8_a2f64424.txt b/submodules/flowfree/generated/7x7_5c_8_a2f64424.txt new file mode 100644 index 0000000000000000000000000000000000000000..1f8497782f983417aa3d561e8a06cfa3dae15be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_8_a2f64424.txt @@ -0,0 +1,51 @@ +""" +E..B... +.A...A. +....C.. +..B.... +..E.... +....C.D +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBCCC +AAEBCAC +AEEBCAC +AEBBAAC +AEEAACC +AAAACCD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (5, 3) (5, 2) (5, 1) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) +(4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (5, 1) +(2, 3) (3, 0) +(4, 5) (4, 2) +(6, 5) (0, 6) +(2, 4) (0, 0) diff --git a/submodules/flowfree/generated/7x7_5c_8_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_8_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_8_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_5c_9_799f6348.txt b/submodules/flowfree/generated/7x7_5c_9_799f6348.txt new file mode 100644 index 0000000000000000000000000000000000000000..1550d45483fa90aba34bbc85e025e1b0ea08661b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_9_799f6348.txt @@ -0,0 +1,51 @@ +""" +C...... +..DEA.. +....... +.C.AE.. +..D.... +B...... +......B +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 3) (4, 1) +(6, 6) (0, 5) +(0, 0) (1, 3) +(2, 1) (2, 4) +(4, 3) (3, 1) + + param line: 5 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCC +CCDEAAC +CCDEEAC +CCDAEAC +CCDAAAC +BCCCCCC +BBBBBBB +""" + +## Raw solver output: +5 7 7 +(3, 3) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) +(2, 1) (2, 2) (2, 3) (2, 4) +(4, 3) (4, 2) (3, 2) (3, 1) + +Touching forbidden +Nodes 59 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 3) (4, 1) +(6, 6) (0, 5) +(0, 0) (1, 3) +(2, 1) (2, 4) +(4, 3) (3, 1) diff --git a/submodules/flowfree/generated/7x7_5c_9_9adff41d.txt b/submodules/flowfree/generated/7x7_5c_9_9adff41d.txt new file mode 100644 index 0000000000000000000000000000000000000000..cf4882506253a000d90a23363db6745468d9895b --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_9_9adff41d.txt @@ -0,0 +1,49 @@ +""" +C..AB.D +..E.E.. +..C.... +...A... +....... +B...... +D...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CAAABBD +CAEEEBD +CACCCBD +CAAACBD +CCCCCBD +BBBBBBD +DDDDDDD +""" + +## Raw solver output: +5 7 7 +(3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) +(4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(4, 1) (3, 1) (2, 1) + +Touching forbidden +Nodes 52 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(3, 0) (3, 3) +(4, 0) (0, 5) +(0, 0) (2, 2) +(6, 0) (0, 6) +(4, 1) (2, 1) diff --git a/submodules/flowfree/generated/7x7_5c_9_d45b6049.txt b/submodules/flowfree/generated/7x7_5c_9_d45b6049.txt new file mode 100644 index 0000000000000000000000000000000000000000..2c6a30df2dc3de596e01ff9bc0ae6538b3dba0a7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_5c_9_d45b6049.txt @@ -0,0 +1,51 @@ +""" +......D +.A..... +D....C. +..A.... +....... +.E...B. +.CBE... +""" + +# ---- raw puzzle block (for reproducibility) ---- +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) + + param line: 5 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DAAAAAA +DCCCCCA +CCAAAAA +CEEEEEE +CEBBBBE +CCBEEEE +""" + +## Raw solver output: +5 7 7 +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) +(5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +5 7 7 +(1, 1) (2, 3) +(2, 6) (5, 5) +(5, 2) (1, 6) +(0, 2) (6, 0) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/7x7_6c_10_2a5b24a6.txt b/submodules/flowfree/generated/7x7_6c_10_2a5b24a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..3dc06bf3a111c01e760f34184af9a2520c505064 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_10_2a5b24a6.txt @@ -0,0 +1,54 @@ +""" +D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF +""" + +## Raw solver output: +6 7 7 +(3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) +(1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) +(2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) +(0, 6) (1, 6) (2, 6) +(3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (4, 4) (4, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) diff --git a/submodules/flowfree/generated/7x7_6c_10_edc5ddf1.txt b/submodules/flowfree/generated/7x7_6c_10_edc5ddf1.txt new file mode 100644 index 0000000000000000000000000000000000000000..6681b8eba119fdb0c4fbac4e2abc305109170785 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_10_edc5ddf1.txt @@ -0,0 +1,54 @@ +""" +A...... +.....F. +.D..... +...D..A +FEBE..C +....B.. +......C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(0, 0) (6, 3) +(2, 4) (4, 5) +(6, 4) (6, 6) +(3, 3) (1, 2) +(1, 4) (3, 4) +(0, 4) (5, 1) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAA +BBBBBFA +BDDDBFA +BBBDBFA +FEBEBFC +FEEEBFC +FFFFFFC +""" + +## Raw solver output: +6 7 7 +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) +(2, 4) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (4, 2) (4, 3) (4, 4) (4, 5) +(6, 4) (6, 5) (6, 6) +(3, 3) (3, 2) (2, 2) (1, 2) +(1, 4) (1, 5) (2, 5) (3, 5) (3, 4) +(0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(0, 0) (6, 3) +(2, 4) (4, 5) +(6, 4) (6, 6) +(3, 3) (1, 2) +(1, 4) (3, 4) +(0, 4) (5, 1) diff --git a/submodules/flowfree/generated/7x7_6c_1_21b01e0e.txt b/submodules/flowfree/generated/7x7_6c_1_21b01e0e.txt new file mode 100644 index 0000000000000000000000000000000000000000..3eab32e3baa4741493438833e4e32f0e04ec2dce --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_1_21b01e0e.txt @@ -0,0 +1,54 @@ +""" +...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(0, 1) (3, 0) +(4, 2) (4, 5) +(5, 6) (0, 2) +(1, 4) (2, 2) +(2, 4) (6, 6) +(4, 0) (6, 4) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE +""" + +## Raw solver output: +6 7 7 +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(4, 2) (4, 3) (4, 4) (4, 5) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(1, 4) (1, 5) (2, 5) (3, 5) (3, 4) (3, 3) (3, 2) (2, 2) +(2, 4) (2, 3) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (6, 5) (6, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(0, 1) (3, 0) +(4, 2) (4, 5) +(5, 6) (0, 2) +(1, 4) (2, 2) +(2, 4) (6, 6) +(4, 0) (6, 4) diff --git a/submodules/flowfree/generated/7x7_6c_1_6ec3c337.txt b/submodules/flowfree/generated/7x7_6c_1_6ec3c337.txt new file mode 100644 index 0000000000000000000000000000000000000000..f0f3ec8980e8fae72782a34a33e90eff79e2430d --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_1_6ec3c337.txt @@ -0,0 +1,54 @@ +""" +...E... +.B..... +..D.... +..A..F. +..B..C. +.A..D.. +FC....E +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(2, 3) (1, 5) +(1, 1) (2, 4) +(5, 4) (1, 6) +(2, 2) (4, 5) +(6, 6) (3, 0) +(0, 6) (5, 3) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFEEEE +FBFFFFE +FBDDDFE +FBAADFE +FBBADCE +FAAADCE +FCCCCCE +""" + +## Raw solver output: +6 7 7 +(2, 3) (3, 3) (3, 4) (3, 5) (2, 5) (1, 5) +(1, 1) (1, 2) (1, 3) (1, 4) (2, 4) +(5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (4, 5) +(6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) +(0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(2, 3) (1, 5) +(1, 1) (2, 4) +(5, 4) (1, 6) +(2, 2) (4, 5) +(6, 6) (3, 0) +(0, 6) (5, 3) diff --git a/submodules/flowfree/generated/7x7_6c_2_21b01e0e.txt b/submodules/flowfree/generated/7x7_6c_2_21b01e0e.txt new file mode 100644 index 0000000000000000000000000000000000000000..3eab32e3baa4741493438833e4e32f0e04ec2dce --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_2_21b01e0e.txt @@ -0,0 +1,54 @@ +""" +...AF.. +A...... +C.D.B.. +....... +.DE...F +....B.. +.....CE +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(0, 1) (3, 0) +(4, 2) (4, 5) +(5, 6) (0, 2) +(1, 4) (2, 2) +(2, 4) (6, 6) +(4, 0) (6, 4) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAFFF +AEEEEEF +CEDDBEF +CEEDBEF +CDEDBEF +CDDDBEE +CCCCCCE +""" + +## Raw solver output: +6 7 7 +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(4, 2) (4, 3) (4, 4) (4, 5) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(1, 4) (1, 5) (2, 5) (3, 5) (3, 4) (3, 3) (3, 2) (2, 2) +(2, 4) (2, 3) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (6, 5) (6, 6) +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(0, 1) (3, 0) +(4, 2) (4, 5) +(5, 6) (0, 2) +(1, 4) (2, 2) +(2, 4) (6, 6) +(4, 0) (6, 4) diff --git a/submodules/flowfree/generated/7x7_6c_2_d5cc36f7.txt b/submodules/flowfree/generated/7x7_6c_2_d5cc36f7.txt new file mode 100644 index 0000000000000000000000000000000000000000..b3ff55fac9ad83055facf13e13b8a2b190ea7be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_2_d5cc36f7.txt @@ -0,0 +1,54 @@ +""" +B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(2, 3) (1, 4) +(1, 5) (0, 0) +(0, 2) (1, 1) +(3, 3) (6, 0) +(5, 3) (4, 5) +(6, 1) (4, 1) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB +""" + +## Raw solver output: +6 7 7 +(2, 3) (2, 4) (1, 4) +(1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) +(0, 2) (0, 1) (1, 1) +(3, 3) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) (6, 0) +(5, 3) (5, 4) (5, 5) (4, 5) +(6, 1) (5, 1) (4, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(2, 3) (1, 4) +(1, 5) (0, 0) +(0, 2) (1, 1) +(3, 3) (6, 0) +(5, 3) (4, 5) +(6, 1) (4, 1) diff --git a/submodules/flowfree/generated/7x7_6c_3_ad1343f0.txt b/submodules/flowfree/generated/7x7_6c_3_ad1343f0.txt new file mode 100644 index 0000000000000000000000000000000000000000..2344b29c12ddffd0c582e07974a0e3ce364ec6f9 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_3_ad1343f0.txt @@ -0,0 +1,54 @@ +""" +AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(0, 0) (0, 2) +(2, 5) (2, 1) +(5, 2) (1, 0) +(2, 4) (4, 0) +(3, 3) (0, 3) +(3, 5) (5, 5) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE +""" + +## Raw solver output: +6 7 7 +(0, 0) (0, 1) (0, 2) +(2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 2) (5, 1) (4, 1) (3, 1) (3, 0) (2, 0) (1, 0) +(2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 3) (5, 3) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) +(3, 3) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) +(3, 5) (4, 5) (5, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(0, 0) (0, 2) +(2, 5) (2, 1) +(5, 2) (1, 0) +(2, 4) (4, 0) +(3, 3) (0, 3) +(3, 5) (5, 5) diff --git a/submodules/flowfree/generated/7x7_6c_3_d5cc36f7.txt b/submodules/flowfree/generated/7x7_6c_3_d5cc36f7.txt new file mode 100644 index 0000000000000000000000000000000000000000..b3ff55fac9ad83055facf13e13b8a2b190ea7be4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_3_d5cc36f7.txt @@ -0,0 +1,54 @@ +""" +B.....D +.C..F.F +C...... +..AD.E. +.A..... +.B..E.. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(2, 3) (1, 4) +(1, 5) (0, 0) +(0, 2) (1, 1) +(3, 3) (6, 0) +(5, 3) (4, 5) +(6, 1) (4, 1) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBDDDD +CCBDFFF +CBBDBBB +BBADBEB +BAABBEB +BBBBEEB +BBBBBBB +""" + +## Raw solver output: +6 7 7 +(2, 3) (2, 4) (1, 4) +(1, 5) (2, 5) (3, 5) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (1, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) +(0, 2) (0, 1) (1, 1) +(3, 3) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) (6, 0) +(5, 3) (5, 4) (5, 5) (4, 5) +(6, 1) (5, 1) (4, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(2, 3) (1, 4) +(1, 5) (0, 0) +(0, 2) (1, 1) +(3, 3) (6, 0) +(5, 3) (4, 5) +(6, 1) (4, 1) diff --git a/submodules/flowfree/generated/7x7_6c_4_13d5d5cf.txt b/submodules/flowfree/generated/7x7_6c_4_13d5d5cf.txt new file mode 100644 index 0000000000000000000000000000000000000000..64a6f9d0ad1da4b3d6cef26a4dd809257b4bfa02 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_4_13d5d5cf.txt @@ -0,0 +1,54 @@ +""" +......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA +""" + +## Raw solver output: +6 7 7 +(1, 4) (1, 5) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(2, 2) (3, 2) (3, 3) (4, 3) (5, 3) +(5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) +(5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_6c_4_ad1343f0.txt b/submodules/flowfree/generated/7x7_6c_4_ad1343f0.txt new file mode 100644 index 0000000000000000000000000000000000000000..2344b29c12ddffd0c582e07974a0e3ce364ec6f9 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_4_ad1343f0.txt @@ -0,0 +1,54 @@ +""" +AC..D.. +..B.... +A....C. +E..E... +..D.... +..BF.F. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(0, 0) (0, 2) +(2, 5) (2, 1) +(5, 2) (1, 0) +(2, 4) (4, 0) +(3, 3) (0, 3) +(3, 5) (5, 5) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ACCCDDD +ABBCCCD +ABDDDCD +EBDEDDD +EBDEEEE +EBBFFFE +EEEEEEE +""" + +## Raw solver output: +6 7 7 +(0, 0) (0, 1) (0, 2) +(2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(5, 2) (5, 1) (4, 1) (3, 1) (3, 0) (2, 0) (1, 0) +(2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 3) (5, 3) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) +(3, 3) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) +(3, 5) (4, 5) (5, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(0, 0) (0, 2) +(2, 5) (2, 1) +(5, 2) (1, 0) +(2, 4) (4, 0) +(3, 3) (0, 3) +(3, 5) (5, 5) diff --git a/submodules/flowfree/generated/7x7_6c_5_13d5d5cf.txt b/submodules/flowfree/generated/7x7_6c_5_13d5d5cf.txt new file mode 100644 index 0000000000000000000000000000000000000000..64a6f9d0ad1da4b3d6cef26a4dd809257b4bfa02 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_5_13d5d5cf.txt @@ -0,0 +1,54 @@ +""" +......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA +""" + +## Raw solver output: +6 7 7 +(1, 4) (1, 5) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(2, 2) (3, 2) (3, 3) (4, 3) (5, 3) +(5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) +(5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_6c_5_220f13d1.txt b/submodules/flowfree/generated/7x7_6c_5_220f13d1.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ed40bb55661c611e27abd27d80a21f126581135 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_5_220f13d1.txt @@ -0,0 +1,54 @@ +""" +.F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA +""" + +## Raw solver output: +6 7 7 +(6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) +(0, 5) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (5, 1) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) diff --git a/submodules/flowfree/generated/7x7_6c_6_13d5d5cf.txt b/submodules/flowfree/generated/7x7_6c_6_13d5d5cf.txt new file mode 100644 index 0000000000000000000000000000000000000000..64a6f9d0ad1da4b3d6cef26a4dd809257b4bfa02 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_6_13d5d5cf.txt @@ -0,0 +1,54 @@ +""" +......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA +""" + +## Raw solver output: +6 7 7 +(1, 4) (1, 5) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(2, 2) (3, 2) (3, 3) (4, 3) (5, 3) +(5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) +(5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_6c_6_220f13d1.txt b/submodules/flowfree/generated/7x7_6c_6_220f13d1.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ed40bb55661c611e27abd27d80a21f126581135 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_6_220f13d1.txt @@ -0,0 +1,54 @@ +""" +.F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA +""" + +## Raw solver output: +6 7 7 +(6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) +(0, 5) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (5, 1) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) diff --git a/submodules/flowfree/generated/7x7_6c_7_13d5d5cf.txt b/submodules/flowfree/generated/7x7_6c_7_13d5d5cf.txt new file mode 100644 index 0000000000000000000000000000000000000000..64a6f9d0ad1da4b3d6cef26a4dd809257b4bfa02 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_7_13d5d5cf.txt @@ -0,0 +1,54 @@ +""" +......E +....... +DBC.BD. +.....C. +.A...F. +...E... +.F....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDE +DBBBBDE +DBCCBDE +FFFCCCE +FAFFFFE +FAAEEEE +FFAAAAA +""" + +## Raw solver output: +6 7 7 +(1, 4) (1, 5) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(2, 2) (3, 2) (3, 3) (4, 3) (5, 3) +(5, 2) (5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) +(5, 4) (4, 4) (3, 4) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(1, 4) (6, 6) +(4, 2) (1, 2) +(2, 2) (5, 3) +(5, 2) (0, 2) +(3, 5) (6, 0) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_6c_7_220f13d1.txt b/submodules/flowfree/generated/7x7_6c_7_220f13d1.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ed40bb55661c611e27abd27d80a21f126581135 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_7_220f13d1.txt @@ -0,0 +1,54 @@ +""" +.F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA +""" + +## Raw solver output: +6 7 7 +(6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) +(0, 5) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (5, 1) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) diff --git a/submodules/flowfree/generated/7x7_6c_8_220f13d1.txt b/submodules/flowfree/generated/7x7_6c_8_220f13d1.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ed40bb55661c611e27abd27d80a21f126581135 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_8_220f13d1.txt @@ -0,0 +1,54 @@ +""" +.F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA +""" + +## Raw solver output: +6 7 7 +(6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) +(0, 5) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (5, 1) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) diff --git a/submodules/flowfree/generated/7x7_6c_8_2a5b24a6.txt b/submodules/flowfree/generated/7x7_6c_8_2a5b24a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..3dc06bf3a111c01e760f34184af9a2520c505064 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_8_2a5b24a6.txt @@ -0,0 +1,54 @@ +""" +D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF +""" + +## Raw solver output: +6 7 7 +(3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) +(1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) +(2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) +(0, 6) (1, 6) (2, 6) +(3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (4, 4) (4, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) diff --git a/submodules/flowfree/generated/7x7_6c_9_220f13d1.txt b/submodules/flowfree/generated/7x7_6c_9_220f13d1.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ed40bb55661c611e27abd27d80a21f126581135 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_9_220f13d1.txt @@ -0,0 +1,54 @@ +""" +.F.B... +.B...C. +..F.... +....... +E.....A +C.E.... +D....DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) + + param line: 6 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFBBEEE +FBBEECE +FFFECCE +EEEECEE +ECCCCEA +CCEEEEA +DDDDDDA +""" + +## Raw solver output: +6 7 7 +(6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) +(0, 5) (1, 5) (1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (5, 1) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(6, 6) (6, 4) +(1, 1) (3, 0) +(0, 5) (5, 1) +(5, 6) (0, 6) +(0, 4) (2, 5) +(2, 2) (1, 0) diff --git a/submodules/flowfree/generated/7x7_6c_9_2a5b24a6.txt b/submodules/flowfree/generated/7x7_6c_9_2a5b24a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..3dc06bf3a111c01e760f34184af9a2520c505064 --- /dev/null +++ b/submodules/flowfree/generated/7x7_6c_9_2a5b24a6.txt @@ -0,0 +1,54 @@ +""" +D.....A +C..F... +...B... +....F.. +....... +.CD..B. +E.EA... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) + + param line: 6 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDAAAAA +CDAFFFF +CDABBBF +CDAAFBF +CDDAFBF +CCDAFBF +EEEAFFF +""" + +## Raw solver output: +6 7 7 +(3, 6) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) +(1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) +(2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (0, 0) +(0, 6) (1, 6) (2, 6) +(3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (4, 4) (4, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +6 7 7 +(3, 6) (6, 0) +(5, 5) (3, 2) +(1, 5) (0, 1) +(2, 5) (0, 0) +(0, 6) (2, 6) +(3, 1) (4, 3) diff --git a/submodules/flowfree/generated/7x7_7c_10_077103b2.txt b/submodules/flowfree/generated/7x7_7c_10_077103b2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0940a61c2baea89c8bc563077791cb09096a71eb --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_10_077103b2.txt @@ -0,0 +1,57 @@ +""" +..CD... +.E..... +CD...E. +G...... +..F...B +.A...A. +...G.FB +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(5, 5) (1, 5) +(6, 4) (6, 6) +(0, 2) (2, 0) +(3, 0) (1, 2) +(1, 1) (5, 2) +(2, 4) (5, 6) +(0, 3) (3, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCDDDD +CEEEEED +CDDDDED +GAAADDD +GAFAAAB +GAFFFAB +GGGGFFB +""" + +## Raw solver output: +7 7 7 +(5, 5) (5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (1, 3) (1, 4) (1, 5) +(6, 4) (6, 5) (6, 6) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (1, 2) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(2, 4) (2, 5) (3, 5) (4, 5) (4, 6) (5, 6) +(0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(5, 5) (1, 5) +(6, 4) (6, 6) +(0, 2) (2, 0) +(3, 0) (1, 2) +(1, 1) (5, 2) +(2, 4) (5, 6) +(0, 3) (3, 6) diff --git a/submodules/flowfree/generated/7x7_7c_10_0d9589a3.txt b/submodules/flowfree/generated/7x7_7c_10_0d9589a3.txt new file mode 100644 index 0000000000000000000000000000000000000000..3ead6fdf12be4bea4296d29017a622d7fe48f1c5 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_10_0d9589a3.txt @@ -0,0 +1,55 @@ +""" +..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(3, 3) (2, 1) +(6, 4) (3, 0) +(2, 4) (4, 2) +(1, 1) (1, 4) +(2, 0) (3, 6) +(6, 5) (3, 2) +(6, 6) (1, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG +""" + +## Raw solver output: +7 7 7 +(3, 3) (2, 3) (2, 2) (2, 1) +(6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) +(2, 4) (3, 4) (4, 4) (4, 3) (4, 2) +(1, 1) (1, 2) (1, 3) (1, 4) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) +(6, 5) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) +(6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(3, 3) (2, 1) +(6, 4) (3, 0) +(2, 4) (4, 2) +(1, 1) (1, 4) +(2, 0) (3, 6) +(6, 5) (3, 2) +(6, 6) (1, 5) diff --git a/submodules/flowfree/generated/7x7_7c_10_547f74fe.txt b/submodules/flowfree/generated/7x7_7c_10_547f74fe.txt new file mode 100644 index 0000000000000000000000000000000000000000..f53befbea3346127ffd903776704719f48dbee46 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_10_547f74fe.txt @@ -0,0 +1,57 @@ +""" +C.....A +..E...G +....... +.C.E... +...B.AG +BF..... +D....DF +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(6, 0) (5, 4) +(3, 4) (0, 5) +(0, 0) (1, 3) +(5, 6) (0, 6) +(2, 1) (3, 3) +(1, 5) (6, 6) +(6, 4) (6, 1) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CBBBBAA +CBEEBAG +CBBEBAG +CCBEBAG +BBBBBAG +BFFFFFF +DDDDDDF +""" + +## Raw solver output: +7 7 7 +(6, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) +(3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) (1, 2) (2, 2) (2, 3) (2, 4) (1, 4) (0, 4) (0, 5) +(0, 0) (0, 1) (0, 2) (0, 3) (1, 3) +(5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 1) (3, 1) (3, 2) (3, 3) +(1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 6) +(6, 4) (6, 3) (6, 2) (6, 1) + +Touching forbidden +Nodes 68 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(6, 0) (5, 4) +(3, 4) (0, 5) +(0, 0) (1, 3) +(5, 6) (0, 6) +(2, 1) (3, 3) +(1, 5) (6, 6) +(6, 4) (6, 1) diff --git a/submodules/flowfree/generated/7x7_7c_1_492d5742.txt b/submodules/flowfree/generated/7x7_7c_1_492d5742.txt new file mode 100644 index 0000000000000000000000000000000000000000..12bf1914f7ef1f8d0da1806bbd7b4b944903b38e --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_1_492d5742.txt @@ -0,0 +1,57 @@ +""" +......F +.B..C.C +..F.... +..G.... +.A..BA. +.E.E... +...GD.D +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(5, 4) (1, 4) +(4, 4) (1, 1) +(6, 1) (4, 1) +(6, 6) (4, 6) +(3, 5) (1, 5) +(2, 2) (6, 0) +(2, 3) (3, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFF +FBBBCCC +FFFBBBB +GGGAAAB +GAAABAB +GEEEBBB +GGGGDDD +""" + +## Raw solver output: +7 7 7 +(5, 4) (5, 3) (4, 3) (3, 3) (3, 4) (2, 4) (1, 4) +(4, 4) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (3, 1) (2, 1) (1, 1) +(6, 1) (5, 1) (4, 1) +(6, 6) (5, 6) (4, 6) +(3, 5) (2, 5) (1, 5) +(2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(5, 4) (1, 4) +(4, 4) (1, 1) +(6, 1) (4, 1) +(6, 6) (4, 6) +(3, 5) (1, 5) +(2, 2) (6, 0) +(2, 3) (3, 6) diff --git a/submodules/flowfree/generated/7x7_7c_1_9dd2760b.txt b/submodules/flowfree/generated/7x7_7c_1_9dd2760b.txt new file mode 100644 index 0000000000000000000000000000000000000000..b29550c4dafe9ef9088036d67ef650bfe16b717a --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_1_9dd2760b.txt @@ -0,0 +1,55 @@ +""" +....... +DBEA... +C.....D +.....AC +..GB.E. +.G..... +...F..F +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(3, 1) (5, 3) +(3, 4) (1, 1) +(6, 3) (0, 2) +(6, 2) (0, 1) +(5, 4) (2, 1) +(3, 6) (6, 6) +(1, 5) (2, 4) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDD +DBEAAAD +CBEEEAD +CBBBEAC +CGGBEEC +CGCCCCC +CCCFFFF +""" + +## Raw solver output: +7 7 7 +(3, 1) (4, 1) (5, 1) (5, 2) (5, 3) +(3, 4) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) +(6, 3) (6, 4) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(5, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (2, 1) +(3, 6) (4, 6) (5, 6) (6, 6) +(1, 5) (1, 4) (2, 4) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(3, 1) (5, 3) +(3, 4) (1, 1) +(6, 3) (0, 2) +(6, 2) (0, 1) +(5, 4) (2, 1) +(3, 6) (6, 6) +(1, 5) (2, 4) diff --git a/submodules/flowfree/generated/7x7_7c_1_d3be7e23.txt b/submodules/flowfree/generated/7x7_7c_1_d3be7e23.txt new file mode 100644 index 0000000000000000000000000000000000000000..422218deed5f751daa2050354c2b68a126f57925 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_1_d3be7e23.txt @@ -0,0 +1,57 @@ +""" +.C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(6, 1) (2, 3) +(0, 6) (6, 0) +(0, 5) (1, 0) +(4, 2) (3, 5) +(5, 5) (5, 2) +(6, 2) (4, 6) +(3, 6) (3, 3) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF +""" + +## Raw solver output: +7 7 7 +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) (2, 3) +(0, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(4, 2) (4, 3) (4, 4) (4, 5) (3, 5) +(5, 5) (5, 4) (5, 3) (5, 2) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) +(3, 6) (2, 6) (2, 5) (2, 4) (3, 4) (3, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(6, 1) (2, 3) +(0, 6) (6, 0) +(0, 5) (1, 0) +(4, 2) (3, 5) +(5, 5) (5, 2) +(6, 2) (4, 6) +(3, 6) (3, 3) diff --git a/submodules/flowfree/generated/7x7_7c_2_782c2792.txt b/submodules/flowfree/generated/7x7_7c_2_782c2792.txt new file mode 100644 index 0000000000000000000000000000000000000000..94e67b690bd10a46ebd26bf4c1f492bfa03e09d4 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_2_782c2792.txt @@ -0,0 +1,57 @@ +""" +....... +....ED. +B.G.... +..AFG.. +E...D.. +A....C. +F..C.B. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(2, 3) (0, 5) +(0, 2) (5, 6) +(3, 6) (5, 5) +(4, 4) (5, 1) +(4, 1) (0, 4) +(3, 3) (0, 6) +(4, 3) (2, 2) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBB +BEEEEDB +BEGGGDB +EEAFGDB +EAAFDDB +AAFFCCB +FFFCCBB +""" + +## Raw solver output: +7 7 7 +(2, 3) (2, 4) (1, 4) (1, 5) (0, 5) +(0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) +(3, 6) (4, 6) (4, 5) (5, 5) +(4, 4) (5, 4) (5, 3) (5, 2) (5, 1) +(4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (0, 3) (0, 4) +(3, 3) (3, 4) (3, 5) (2, 5) (2, 6) (1, 6) (0, 6) +(4, 3) (4, 2) (3, 2) (2, 2) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(2, 3) (0, 5) +(0, 2) (5, 6) +(3, 6) (5, 5) +(4, 4) (5, 1) +(4, 1) (0, 4) +(3, 3) (0, 6) +(4, 3) (2, 2) diff --git a/submodules/flowfree/generated/7x7_7c_2_a92aa206.txt b/submodules/flowfree/generated/7x7_7c_2_a92aa206.txt new file mode 100644 index 0000000000000000000000000000000000000000..8f451cac77479511c5a8182b2f12fed7c9136fca --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_2_a92aa206.txt @@ -0,0 +1,55 @@ +""" +FG..... +...FDEG +D...... +B.....E +A...A.C +....... +BC..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 4) (0, 4) +(0, 3) (0, 6) +(6, 4) (1, 6) +(4, 1) (0, 2) +(5, 1) (6, 3) +(0, 0) (3, 1) +(1, 0) (6, 1) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FGGGGGG +FFFFDEG +DDDDDEE +BBBBBBE +AAAAABC +BBBBBBC +BCCCCCC +""" + +## Raw solver output: +7 7 7 +(4, 4) (3, 4) (2, 4) (1, 4) (0, 4) +(0, 3) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 6) +(6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(4, 1) (4, 2) (3, 2) (2, 2) (1, 2) (0, 2) +(5, 1) (5, 2) (6, 2) (6, 3) +(0, 0) (0, 1) (1, 1) (2, 1) (3, 1) +(1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 4) (0, 4) +(0, 3) (0, 6) +(6, 4) (1, 6) +(4, 1) (0, 2) +(5, 1) (6, 3) +(0, 0) (3, 1) +(1, 0) (6, 1) diff --git a/submodules/flowfree/generated/7x7_7c_2_d3be7e23.txt b/submodules/flowfree/generated/7x7_7c_2_d3be7e23.txt new file mode 100644 index 0000000000000000000000000000000000000000..422218deed5f751daa2050354c2b68a126f57925 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_2_d3be7e23.txt @@ -0,0 +1,57 @@ +""" +.C....B +......A +....DEF +..AG... +....... +C..D.E. +B..GF.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(6, 1) (2, 3) +(0, 6) (6, 0) +(0, 5) (1, 0) +(4, 2) (3, 5) +(5, 5) (5, 2) +(6, 2) (4, 6) +(3, 6) (3, 3) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBBB +CBBAAAA +CBAADEF +CBAGDEF +CBGGDEF +CBGDDEF +BBGGFFF +""" + +## Raw solver output: +7 7 7 +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) (2, 3) +(0, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(4, 2) (4, 3) (4, 4) (4, 5) (3, 5) +(5, 5) (5, 4) (5, 3) (5, 2) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) +(3, 6) (2, 6) (2, 5) (2, 4) (3, 4) (3, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(6, 1) (2, 3) +(0, 6) (6, 0) +(0, 5) (1, 0) +(4, 2) (3, 5) +(5, 5) (5, 2) +(6, 2) (4, 6) +(3, 6) (3, 3) diff --git a/submodules/flowfree/generated/7x7_7c_3_9baf1145.txt b/submodules/flowfree/generated/7x7_7c_3_9baf1145.txt new file mode 100644 index 0000000000000000000000000000000000000000..e0d164f3dc0b58c4ee5129b59ebc7e7cbb759518 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_3_9baf1145.txt @@ -0,0 +1,57 @@ +""" +..C...D +..G.F.. +..A...D +......C +..GFA.. +E...... +.EB...B +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(2, 2) (4, 4) +(6, 6) (2, 6) +(6, 3) (2, 0) +(6, 0) (6, 2) +(0, 5) (1, 6) +(3, 4) (4, 1) +(2, 1) (2, 4) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCAAAD +CGGAFAD +CGAAFAD +CGGFFAC +CCGFAAC +ECCCCCC +EEBBBBB +""" + +## Raw solver output: +7 7 7 +(2, 2) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (5, 3) (5, 4) (4, 4) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) +(6, 3) (6, 4) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(6, 0) (6, 1) (6, 2) +(0, 5) (0, 6) (1, 6) +(3, 4) (3, 3) (4, 3) (4, 2) (4, 1) +(2, 1) (1, 1) (1, 2) (1, 3) (2, 3) (2, 4) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(2, 2) (4, 4) +(6, 6) (2, 6) +(6, 3) (2, 0) +(6, 0) (6, 2) +(0, 5) (1, 6) +(3, 4) (4, 1) +(2, 1) (2, 4) diff --git a/submodules/flowfree/generated/7x7_7c_3_ae0f223a.txt b/submodules/flowfree/generated/7x7_7c_3_ae0f223a.txt new file mode 100644 index 0000000000000000000000000000000000000000..5e11ce1513b7710d1c02f6c10d61db804ef6d09a --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_3_ae0f223a.txt @@ -0,0 +1,57 @@ +""" +.....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG +""" + +## Raw solver output: +7 7 7 +(4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (0, 3) +(0, 4) (0, 5) (0, 6) +(4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (2, 3) (2, 4) (3, 4) +(4, 4) (4, 3) (3, 3) (3, 2) (3, 1) (2, 1) (1, 1) +(5, 0) (5, 1) (5, 2) +(5, 3) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) + +Touching forbidden +Nodes 122 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) diff --git a/submodules/flowfree/generated/7x7_7c_3_f76c93f4.txt b/submodules/flowfree/generated/7x7_7c_3_f76c93f4.txt new file mode 100644 index 0000000000000000000000000000000000000000..6ea347e2fbcc99275296e05b8729350ce28b8fe3 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_3_f76c93f4.txt @@ -0,0 +1,55 @@ +""" +E...D.B +AE.B..F +.G.CF.. +..D...C +..A.... +.....G. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(0, 1) (2, 4) +(6, 0) (3, 1) +(3, 2) (6, 3) +(4, 0) (2, 3) +(0, 0) (1, 1) +(4, 2) (6, 1) +(1, 2) (5, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEDDDBB +AEDBBBF +AGDCFFF +AGDCCCC +AGAAAAA +AGGGGGA +AAAAAAA +""" + +## Raw solver output: +7 7 7 +(0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (5, 4) (4, 4) (3, 4) (2, 4) +(6, 0) (5, 0) (5, 1) (4, 1) (3, 1) +(3, 2) (3, 3) (4, 3) (5, 3) (6, 3) +(4, 0) (3, 0) (2, 0) (2, 1) (2, 2) (2, 3) +(0, 0) (1, 0) (1, 1) +(4, 2) (5, 2) (6, 2) (6, 1) +(1, 2) (1, 3) (1, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(0, 1) (2, 4) +(6, 0) (3, 1) +(3, 2) (6, 3) +(4, 0) (2, 3) +(0, 0) (1, 1) +(4, 2) (6, 1) +(1, 2) (5, 5) diff --git a/submodules/flowfree/generated/7x7_7c_4_331bf87b.txt b/submodules/flowfree/generated/7x7_7c_4_331bf87b.txt new file mode 100644 index 0000000000000000000000000000000000000000..c88640220ef24628eebb1d200bacd743036067b6 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_4_331bf87b.txt @@ -0,0 +1,55 @@ +""" +......E +.GAEF.F +....... +.CBG.D. +....... +.CB.D.. +....A.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 6) (2, 1) +(2, 3) (2, 5) +(1, 3) (1, 5) +(4, 5) (5, 3) +(3, 1) (6, 0) +(4, 1) (6, 1) +(1, 1) (3, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAEEEE +AGAEFFF +AGGGAAA +ACBGADA +ACBAADA +ACBADDA +AAAAAAA +""" + +## Raw solver output: +7 7 7 +(4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (4, 3) (4, 4) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) +(2, 3) (2, 4) (2, 5) +(1, 3) (1, 4) (1, 5) +(4, 5) (5, 5) (5, 4) (5, 3) +(3, 1) (3, 0) (4, 0) (5, 0) (6, 0) +(4, 1) (5, 1) (6, 1) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 6) (2, 1) +(2, 3) (2, 5) +(1, 3) (1, 5) +(4, 5) (5, 3) +(3, 1) (6, 0) +(4, 1) (6, 1) +(1, 1) (3, 3) diff --git a/submodules/flowfree/generated/7x7_7c_4_ae0f223a.txt b/submodules/flowfree/generated/7x7_7c_4_ae0f223a.txt new file mode 100644 index 0000000000000000000000000000000000000000..5e11ce1513b7710d1c02f6c10d61db804ef6d09a --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_4_ae0f223a.txt @@ -0,0 +1,57 @@ +""" +.....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG +""" + +## Raw solver output: +7 7 7 +(4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (0, 3) +(0, 4) (0, 5) (0, 6) +(4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (2, 3) (2, 4) (3, 4) +(4, 4) (4, 3) (3, 3) (3, 2) (3, 1) (2, 1) (1, 1) +(5, 0) (5, 1) (5, 2) +(5, 3) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) + +Touching forbidden +Nodes 122 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) diff --git a/submodules/flowfree/generated/7x7_7c_4_f29c58ac.txt b/submodules/flowfree/generated/7x7_7c_4_f29c58ac.txt new file mode 100644 index 0000000000000000000000000000000000000000..644bed04d94cd4347dd159afbc620934bd6c6ab2 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_4_f29c58ac.txt @@ -0,0 +1,57 @@ +""" +D.BE..E +..FAG.. +....C.. +....G.. +.B..... +.DF..C. +A...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(3, 1) (0, 6) +(2, 0) (1, 4) +(5, 5) (4, 2) +(0, 0) (1, 5) +(6, 0) (3, 0) +(2, 1) (2, 5) +(4, 3) (4, 1) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DBBEEEE +DBFAGGG +DBFACCG +DBFAGCG +DBFAGCG +DDFAGCG +AAAAGGG +""" + +## Raw solver output: +7 7 7 +(3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) (0, 6) +(2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) +(5, 5) (5, 4) (5, 3) (5, 2) (4, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) +(6, 0) (5, 0) (4, 0) (3, 0) +(2, 1) (2, 2) (2, 3) (2, 4) (2, 5) +(4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(3, 1) (0, 6) +(2, 0) (1, 4) +(5, 5) (4, 2) +(0, 0) (1, 5) +(6, 0) (3, 0) +(2, 1) (2, 5) +(4, 3) (4, 1) diff --git a/submodules/flowfree/generated/7x7_7c_5_8c30c948.txt b/submodules/flowfree/generated/7x7_7c_5_8c30c948.txt new file mode 100644 index 0000000000000000000000000000000000000000..c58b4da918c0d4cf6f5f046db4904b1cc468049a --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_5_8c30c948.txt @@ -0,0 +1,55 @@ +""" +.E....B +.A.FA.G +....F.. +.D..... +.....C. +..B.CE. +D.....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(1, 1) (4, 1) +(2, 5) (6, 0) +(4, 5) (5, 4) +(0, 6) (1, 3) +(1, 0) (5, 5) +(4, 2) (3, 1) +(6, 1) (6, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEAAABB +EAAFABG +EEEFFBG +DDEBBBG +DEEBCCG +DEBBCEG +DEEEEEG +""" + +## Raw solver output: +7 7 7 +(1, 1) (2, 1) (2, 0) (3, 0) (4, 0) (4, 1) +(2, 5) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) (5, 2) (5, 1) (5, 0) (6, 0) +(4, 5) (4, 4) (5, 4) +(0, 6) (0, 5) (0, 4) (0, 3) (1, 3) +(1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (2, 3) (2, 4) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (5, 5) +(4, 2) (3, 2) (3, 1) +(6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) + +Touching forbidden +Nodes 60 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(1, 1) (4, 1) +(2, 5) (6, 0) +(4, 5) (5, 4) +(0, 6) (1, 3) +(1, 0) (5, 5) +(4, 2) (3, 1) +(6, 1) (6, 6) diff --git a/submodules/flowfree/generated/7x7_7c_5_ae0f223a.txt b/submodules/flowfree/generated/7x7_7c_5_ae0f223a.txt new file mode 100644 index 0000000000000000000000000000000000000000..5e11ce1513b7710d1c02f6c10d61db804ef6d09a --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_5_ae0f223a.txt @@ -0,0 +1,57 @@ +""" +.....EG +.D..... +....CE. +A....F. +B..CD.. +....A.. +BF....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCEG +CDDDCEG +CCCDCEG +AACDDFG +BACCDFG +BAAAAFG +BFFFFFG +""" + +## Raw solver output: +7 7 7 +(4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (0, 3) +(0, 4) (0, 5) (0, 6) +(4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) (2, 3) (2, 4) (3, 4) +(4, 4) (4, 3) (3, 3) (3, 2) (3, 1) (2, 1) (1, 1) +(5, 0) (5, 1) (5, 2) +(5, 3) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) + +Touching forbidden +Nodes 122 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 5) (0, 3) +(0, 4) (0, 6) +(4, 2) (3, 4) +(4, 4) (1, 1) +(5, 0) (5, 2) +(5, 3) (1, 6) +(6, 0) (6, 6) diff --git a/submodules/flowfree/generated/7x7_7c_5_c7b7fb36.txt b/submodules/flowfree/generated/7x7_7c_5_c7b7fb36.txt new file mode 100644 index 0000000000000000000000000000000000000000..60e668b553c097660d83c67cc3a2edeb1ac45299 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_5_c7b7fb36.txt @@ -0,0 +1,57 @@ +""" +.....D. +...C.F. +.C..... +.D.BF.G +..B...A +E....G. +....EA. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(5, 6) (6, 4) +(2, 4) (3, 3) +(1, 2) (3, 1) +(5, 0) (1, 3) +(4, 6) (0, 5) +(5, 1) (4, 3) +(6, 3) (5, 5) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFDD +FCCCFFD +FCDDDDD +FDDBFGG +FFBBFGA +EFFFFGA +EEEEEAA +""" + +## Raw solver output: +7 7 7 +(5, 6) (6, 6) (6, 5) (6, 4) +(2, 4) (3, 4) (3, 3) +(1, 2) (1, 1) (2, 1) (3, 1) +(5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (1, 3) +(4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) +(5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (1, 5) (2, 5) (3, 5) (4, 5) (4, 4) (4, 3) +(6, 3) (5, 3) (5, 4) (5, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(5, 6) (6, 4) +(2, 4) (3, 3) +(1, 2) (3, 1) +(5, 0) (1, 3) +(4, 6) (0, 5) +(5, 1) (4, 3) +(6, 3) (5, 5) diff --git a/submodules/flowfree/generated/7x7_7c_6_2c5e0644.txt b/submodules/flowfree/generated/7x7_7c_6_2c5e0644.txt new file mode 100644 index 0000000000000000000000000000000000000000..be455ebc702b3bdafe113c5c599d295822fc2613 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_6_2c5e0644.txt @@ -0,0 +1,57 @@ +""" +......C +....A.A +..F..BD +.E.BE.. +.CF.... +....... +DG....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(6, 1) (4, 1) +(3, 3) (5, 2) +(6, 0) (1, 4) +(6, 2) (0, 6) +(1, 3) (4, 3) +(2, 4) (2, 2) +(6, 6) (1, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCC +CEEEAAA +CEFEEBD +CEFBEBD +CCFBBBD +DDDDDDD +DGGGGGG +""" + +## Raw solver output: +7 7 7 +(6, 1) (5, 1) (4, 1) +(3, 3) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) +(6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) +(6, 2) (6, 3) (6, 4) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (0, 5) (0, 6) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (4, 2) (4, 3) +(2, 4) (2, 3) (2, 2) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(6, 1) (4, 1) +(3, 3) (5, 2) +(6, 0) (1, 4) +(6, 2) (0, 6) +(1, 3) (4, 3) +(2, 4) (2, 2) +(6, 6) (1, 6) diff --git a/submodules/flowfree/generated/7x7_7c_6_96ca9115.txt b/submodules/flowfree/generated/7x7_7c_6_96ca9115.txt new file mode 100644 index 0000000000000000000000000000000000000000..5177dba660e843260c2a6337ffe06e8bb4dcf7de --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_6_96ca9115.txt @@ -0,0 +1,57 @@ +""" +F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(1, 5) (2, 3) +(0, 2) (1, 1) +(2, 6) (6, 6) +(6, 0) (4, 4) +(2, 5) (3, 2) +(0, 0) (5, 2) +(5, 4) (1, 6) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC +""" + +## Raw solver output: +7 7 7 +(1, 5) (1, 4) (2, 4) (2, 3) +(0, 2) (0, 1) (1, 1) +(2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (5, 5) (4, 5) (4, 4) +(2, 5) (3, 5) (3, 4) (3, 3) (3, 2) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) +(5, 4) (5, 3) (4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(1, 5) (2, 3) +(0, 2) (1, 1) +(2, 6) (6, 6) +(6, 0) (4, 4) +(2, 5) (3, 2) +(0, 0) (5, 2) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_7c_6_ec4e7a56.txt b/submodules/flowfree/generated/7x7_7c_6_ec4e7a56.txt new file mode 100644 index 0000000000000000000000000000000000000000..ca4d643e011931ad78d0cca019e273e21ea9a25f --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_6_ec4e7a56.txt @@ -0,0 +1,55 @@ +""" +..F.EA. +.....F. +.....B. +.E.C... +....BD. +GC..D.A +......G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(5, 0) (6, 5) +(5, 2) (4, 4) +(1, 5) (3, 3) +(5, 4) (4, 5) +(4, 0) (1, 3) +(5, 1) (2, 0) +(0, 5) (6, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFEEAA +FEEEFFA +FEFFFBA +FEFCBBA +FFFCBDA +GCCCDDA +GGGGGGG +""" + +## Raw solver output: +7 7 7 +(5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) +(5, 2) (5, 3) (4, 3) (4, 4) +(1, 5) (2, 5) (3, 5) (3, 4) (3, 3) +(5, 4) (5, 5) (4, 5) +(4, 0) (3, 0) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) +(5, 1) (4, 1) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(5, 0) (6, 5) +(5, 2) (4, 4) +(1, 5) (3, 3) +(5, 4) (4, 5) +(4, 0) (1, 3) +(5, 1) (2, 0) +(0, 5) (6, 6) diff --git a/submodules/flowfree/generated/7x7_7c_7_96ca9115.txt b/submodules/flowfree/generated/7x7_7c_7_96ca9115.txt new file mode 100644 index 0000000000000000000000000000000000000000..5177dba660e843260c2a6337ffe06e8bb4dcf7de --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_7_96ca9115.txt @@ -0,0 +1,57 @@ +""" +F.....D +.B..... +B..E.F. +..A.... +....DG. +.AE.... +.GC...C +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(1, 5) (2, 3) +(0, 2) (1, 1) +(2, 6) (6, 6) +(6, 0) (4, 4) +(2, 5) (3, 2) +(0, 0) (5, 2) +(5, 4) (1, 6) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFD +BBGGGFD +BGGEGFD +GGAEGGD +GAAEDGD +GAEEDDD +GGCCCCC +""" + +## Raw solver output: +7 7 7 +(1, 5) (1, 4) (2, 4) (2, 3) +(0, 2) (0, 1) (1, 1) +(2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (5, 5) (4, 5) (4, 4) +(2, 5) (3, 5) (3, 4) (3, 3) (3, 2) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) +(5, 4) (5, 3) (4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(1, 5) (2, 3) +(0, 2) (1, 1) +(2, 6) (6, 6) +(6, 0) (4, 4) +(2, 5) (3, 2) +(0, 0) (5, 2) +(5, 4) (1, 6) diff --git a/submodules/flowfree/generated/7x7_7c_7_dae1eb3d.txt b/submodules/flowfree/generated/7x7_7c_7_dae1eb3d.txt new file mode 100644 index 0000000000000000000000000000000000000000..7f67fe808c0acc80dee068d78127c80b2b477f35 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_7_dae1eb3d.txt @@ -0,0 +1,57 @@ +""" +FD.D... +.....A. +F.B...C +G...C.B +....E.. +.E.A... +.G..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(5, 1) (3, 5) +(6, 3) (2, 2) +(4, 3) (6, 2) +(1, 0) (3, 0) +(1, 5) (4, 4) +(0, 0) (0, 2) +(0, 3) (1, 6) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FDDDCCC +FEEECAC +FEBECAC +GEBECAB +GEBEEAB +GEBAAAB +GGBBBBB +""" + +## Raw solver output: +7 7 7 +(5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) +(6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) +(4, 3) (4, 2) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) +(1, 0) (2, 0) (3, 0) +(1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) (4, 4) +(0, 0) (0, 1) (0, 2) +(0, 3) (0, 4) (0, 5) (0, 6) (1, 6) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(5, 1) (3, 5) +(6, 3) (2, 2) +(4, 3) (6, 2) +(1, 0) (3, 0) +(1, 5) (4, 4) +(0, 0) (0, 2) +(0, 3) (1, 6) diff --git a/submodules/flowfree/generated/7x7_7c_7_ef6fad8a.txt b/submodules/flowfree/generated/7x7_7c_7_ef6fad8a.txt new file mode 100644 index 0000000000000000000000000000000000000000..8e34462b8d64765388c025a612091737fe9768d3 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_7_ef6fad8a.txt @@ -0,0 +1,55 @@ +""" +E..E... +..C..F. +.A.GF.. +...D..G +B...A.. +......D +....B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 4) (1, 2) +(0, 4) (4, 6) +(6, 6) (2, 1) +(6, 5) (3, 3) +(0, 0) (3, 0) +(5, 1) (4, 2) +(3, 2) (6, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEGGG +CCCGGFG +CAAGFFG +CCADDDG +BCAAADD +BCCCCCD +BBBBBCC +""" + +## Raw solver output: +7 7 7 +(4, 4) (3, 4) (2, 4) (2, 3) (2, 2) (1, 2) +(0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) +(6, 6) (5, 6) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) +(6, 5) (6, 4) (5, 4) (5, 3) (4, 3) (3, 3) +(0, 0) (1, 0) (2, 0) (3, 0) +(5, 1) (5, 2) (4, 2) +(3, 2) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 4) (1, 2) +(0, 4) (4, 6) +(6, 6) (2, 1) +(6, 5) (3, 3) +(0, 0) (3, 0) +(5, 1) (4, 2) +(3, 2) (6, 3) diff --git a/submodules/flowfree/generated/7x7_7c_8_4aae6c86.txt b/submodules/flowfree/generated/7x7_7c_8_4aae6c86.txt new file mode 100644 index 0000000000000000000000000000000000000000..0ab39eedcade606565b5037bcea53d1ee887c9d7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_8_4aae6c86.txt @@ -0,0 +1,57 @@ +""" +E.EFG.D +....F.. +.C..G.. +..ADB.. +....A.. +...CB.. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 4) (2, 3) +(4, 3) (4, 5) +(3, 5) (1, 2) +(6, 0) (3, 3) +(0, 0) (2, 0) +(3, 0) (4, 1) +(4, 0) (4, 2) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEFGGD +DDDFFGD +DCDDGGD +DCADBBD +DCAAABD +DCCCBBD +DDDDDDD +""" + +## Raw solver output: +7 7 7 +(4, 4) (3, 4) (2, 4) (2, 3) +(4, 3) (5, 3) (5, 4) (5, 5) (4, 5) +(3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) +(6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (2, 2) (3, 2) (3, 3) +(0, 0) (1, 0) (2, 0) +(3, 0) (3, 1) (4, 1) +(4, 0) (5, 0) (5, 1) (5, 2) (4, 2) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 4) (2, 3) +(4, 3) (4, 5) +(3, 5) (1, 2) +(6, 0) (3, 3) +(0, 0) (2, 0) +(3, 0) (4, 1) +(4, 0) (4, 2) diff --git a/submodules/flowfree/generated/7x7_7c_8_63dec1fa.txt b/submodules/flowfree/generated/7x7_7c_8_63dec1fa.txt new file mode 100644 index 0000000000000000000000000000000000000000..75412276044b5b1803e0f7cfa51a16b373860618 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_8_63dec1fa.txt @@ -0,0 +1,55 @@ +""" +F....AE +....... +.A.GF.. +.C..... +.....C. +.B...B. +GD...DE +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(1, 2) (5, 0) +(5, 5) (1, 5) +(1, 3) (5, 4) +(1, 6) (5, 6) +(6, 6) (6, 0) +(0, 0) (4, 2) +(3, 2) (0, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFAE +GGGGFAE +GAAGFAE +GCAAAAE +GCCCCCE +GBBBBBE +GDDDDDE +""" + +## Raw solver output: +7 7 7 +(1, 2) (2, 2) (2, 3) (3, 3) (4, 3) (5, 3) (5, 2) (5, 1) (5, 0) +(5, 5) (4, 5) (3, 5) (2, 5) (1, 5) +(1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) +(1, 6) (2, 6) (3, 6) (4, 6) (5, 6) +(6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) +(3, 2) (3, 1) (2, 1) (1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(1, 2) (5, 0) +(5, 5) (1, 5) +(1, 3) (5, 4) +(1, 6) (5, 6) +(6, 6) (6, 0) +(0, 0) (4, 2) +(3, 2) (0, 6) diff --git a/submodules/flowfree/generated/7x7_7c_8_a7b3eb1c.txt b/submodules/flowfree/generated/7x7_7c_8_a7b3eb1c.txt new file mode 100644 index 0000000000000000000000000000000000000000..32dfbf617199bbc71a03c6309e7da887d0deaeb7 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_8_a7b3eb1c.txt @@ -0,0 +1,57 @@ +""" +......F +..B...G +.BD...A +.E.G.CF +...DA.. +....EC. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(6, 2) (4, 4) +(2, 1) (1, 2) +(5, 3) (5, 5) +(2, 2) (3, 4) +(4, 5) (1, 3) +(6, 0) (6, 3) +(6, 1) (3, 3) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFF +FBBGGGG +FBDGAAA +FEDGACF +FEDDACF +FEEEECF +FFFFFFF +""" + +## Raw solver output: +7 7 7 +(6, 2) (5, 2) (4, 2) (4, 3) (4, 4) +(2, 1) (1, 1) (1, 2) +(5, 3) (5, 4) (5, 5) +(2, 2) (2, 3) (2, 4) (3, 4) +(4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) +(6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (3, 3) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(6, 2) (4, 4) +(2, 1) (1, 2) +(5, 3) (5, 5) +(2, 2) (3, 4) +(4, 5) (1, 3) +(6, 0) (6, 3) +(6, 1) (3, 3) diff --git a/submodules/flowfree/generated/7x7_7c_9_0d9589a3.txt b/submodules/flowfree/generated/7x7_7c_9_0d9589a3.txt new file mode 100644 index 0000000000000000000000000000000000000000..3ead6fdf12be4bea4296d29017a622d7fe48f1c5 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_9_0d9589a3.txt @@ -0,0 +1,55 @@ +""" +..EB... +.DA.... +...FC.. +...A... +.DC...B +.G....F +...E..G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(3, 3) (2, 1) +(6, 4) (3, 0) +(2, 4) (4, 2) +(1, 1) (1, 4) +(2, 0) (3, 6) +(6, 5) (3, 2) +(6, 6) (1, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBBBB +EDAFFFB +EDAFCFB +EDAACFB +EDCCCFB +EGGGGFF +EEEEGGG +""" + +## Raw solver output: +7 7 7 +(3, 3) (2, 3) (2, 2) (2, 1) +(6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) +(2, 4) (3, 4) (4, 4) (4, 3) (4, 2) +(1, 1) (1, 2) (1, 3) (1, 4) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) +(6, 5) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) +(6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (1, 5) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(3, 3) (2, 1) +(6, 4) (3, 0) +(2, 4) (4, 2) +(1, 1) (1, 4) +(2, 0) (3, 6) +(6, 5) (3, 2) +(6, 6) (1, 5) diff --git a/submodules/flowfree/generated/7x7_7c_9_7e442b1b.txt b/submodules/flowfree/generated/7x7_7c_9_7e442b1b.txt new file mode 100644 index 0000000000000000000000000000000000000000..36396bc5e18241c6846cbf9a156da2f70474a021 --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_9_7e442b1b.txt @@ -0,0 +1,57 @@ +""" +...FA.. +.DC.B.. +..G.EB. +....... +..GFE.C +....DA. +....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(4, 0) (5, 5) +(4, 1) (5, 2) +(2, 1) (6, 4) +(4, 5) (1, 1) +(4, 4) (4, 2) +(3, 4) (3, 0) +(2, 4) (2, 2) + + param line: 7 7 7 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCFAAA +CDCFBBA +CDGFEBA +CDGFEAA +CDGFEAC +CDDDDAC +CCCCCCC +""" + +## Raw solver output: +7 7 7 +(4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) +(4, 1) (5, 1) (5, 2) +(2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) +(4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(4, 4) (4, 3) (4, 2) +(3, 4) (3, 3) (3, 2) (3, 1) (3, 0) +(2, 4) (2, 3) (2, 2) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(4, 0) (5, 5) +(4, 1) (5, 2) +(2, 1) (6, 4) +(4, 5) (1, 1) +(4, 4) (4, 2) +(3, 4) (3, 0) +(2, 4) (2, 2) diff --git a/submodules/flowfree/generated/7x7_7c_9_d249fa1f.txt b/submodules/flowfree/generated/7x7_7c_9_d249fa1f.txt new file mode 100644 index 0000000000000000000000000000000000000000..28118925d57ddcb76641c9b83caf0a38cc1aa2aa --- /dev/null +++ b/submodules/flowfree/generated/7x7_7c_9_d249fa1f.txt @@ -0,0 +1,57 @@ +""" +......G +G....FD +...A... +C...... +..C.... +AE..FE. +B.B...D +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 7 7 +(0, 5) (3, 2) +(2, 6) (0, 6) +(2, 4) (0, 3) +(6, 1) (6, 6) +(1, 5) (5, 5) +(5, 1) (4, 5) +(6, 0) (0, 1) + + param line: 7 7 7 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGGGGG +GCCCCFD +CCAACFD +CAACCFD +AACCFFD +AEEEFED +BBBEEED +""" + +## Raw solver output: +7 7 7 +(0, 5) (0, 4) (1, 4) (1, 3) (2, 3) (2, 2) (3, 2) +(2, 6) (1, 6) (0, 6) +(2, 4) (3, 4) (3, 3) (4, 3) (4, 2) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (0, 2) (0, 3) +(6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(1, 5) (2, 5) (3, 5) (3, 6) (4, 6) (5, 6) (5, 5) +(5, 1) (5, 2) (5, 3) (5, 4) (4, 4) (4, 5) +(6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) + +Touching forbidden +Nodes 50 +Solutions 1 + +## Solver input (raw puzzle block): +7 7 7 +(0, 5) (3, 2) +(2, 6) (0, 6) +(2, 4) (0, 3) +(6, 1) (6, 6) +(1, 5) (5, 5) +(5, 1) (4, 5) +(6, 0) (0, 1) diff --git a/submodules/flowfree/generated/8x8_6c_10_7d3b36a6.txt b/submodules/flowfree/generated/8x8_6c_10_7d3b36a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..c74a38209b25766899f822b29b20c3f681b68602 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_10_7d3b36a6.txt @@ -0,0 +1,54 @@ +""" +....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC +""" + +## Raw solver output: +6 8 8 +(4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) +(7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) +(5, 3) (4, 3) (4, 2) (3, 2) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(0, 5) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) diff --git a/submodules/flowfree/generated/8x8_6c_10_7f24b2e8.txt b/submodules/flowfree/generated/8x8_6c_10_7f24b2e8.txt new file mode 100644 index 0000000000000000000000000000000000000000..f22b0b9d8bea4e212d2d26abb5f3b7f9c9b219c3 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_10_7f24b2e8.txt @@ -0,0 +1,56 @@ +""" +.E...... +.A.BFC.. +.B...E.. +....F... +........ +.D.AC... +......D. +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 1) (3, 5) +(1, 2) (3, 1) +(4, 5) (5, 1) +(6, 6) (1, 5) +(1, 0) (5, 2) +(4, 3) (4, 1) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEAAAAAA +EAABFCCA +EBBBFECA +EEEEFECA +AAAEEECA +ADAACCCA +ADDDDDDA +AAAAAAAA +""" + +## Raw solver output: +6 8 8 +(1, 1) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (2, 5) (3, 5) +(1, 2) (2, 2) (3, 2) (3, 1) +(4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (1, 5) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (2, 3) (3, 3) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) +(4, 3) (4, 2) (4, 1) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(1, 1) (3, 5) +(1, 2) (3, 1) +(4, 5) (5, 1) +(6, 6) (1, 5) +(1, 0) (5, 2) +(4, 3) (4, 1) diff --git a/submodules/flowfree/generated/8x8_6c_10_ee06545b.txt b/submodules/flowfree/generated/8x8_6c_10_ee06545b.txt new file mode 100644 index 0000000000000000000000000000000000000000..e06b1f974fe942d066d0476cf30e276d850e0547 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_10_ee06545b.txt @@ -0,0 +1,56 @@ +""" +..BC...F +.E...... +....BE.. +........ +.FD..D.. +.......C +........ +A......A +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(0, 7) (7, 7) +(4, 2) (2, 0) +(3, 0) (7, 5) +(5, 4) (2, 4) +(1, 1) (5, 2) +(7, 0) (1, 4) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBCCCCF +BEEEEECF +BBBBBECF +CCCCCCCF +CFDDDDFF +CFFFFFFC +CCCCCCCC +AAAAAAAA +""" + +## Raw solver output: +6 8 8 +(0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) +(5, 4) (4, 4) (3, 4) (2, 4) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) + +Touching forbidden +Nodes 66 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(0, 7) (7, 7) +(4, 2) (2, 0) +(3, 0) (7, 5) +(5, 4) (2, 4) +(1, 1) (5, 2) +(7, 0) (1, 4) diff --git a/submodules/flowfree/generated/8x8_6c_1_14765f5e.txt b/submodules/flowfree/generated/8x8_6c_1_14765f5e.txt new file mode 100644 index 0000000000000000000000000000000000000000..66f04001c5485b980947f42d596a07c637ffbb4f --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_1_14765f5e.txt @@ -0,0 +1,56 @@ +""" +........ +.F.....C +.B.F.E.. +........ +D...A.E. +..B..... +...C..DA +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 4) (7, 6) +(1, 2) (2, 5) +(7, 1) (3, 6) +(0, 4) (6, 6) +(6, 4) (5, 2) +(1, 1) (3, 2) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CFFFDDDC +CBBFDEDD +CCBDDEED +DCBDAAED +DCBDDADD +DCCCDADA +DDDDDAAA +""" + +## Raw solver output: +6 8 8 +(4, 4) (5, 4) (5, 5) (5, 6) (5, 7) (6, 7) (7, 7) (7, 6) +(1, 2) (2, 2) (2, 3) (2, 4) (2, 5) +(7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) +(0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (3, 5) (3, 4) (3, 3) (4, 3) (4, 2) (4, 1) (5, 1) (6, 1) (6, 2) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (6, 6) +(6, 4) (6, 3) (5, 3) (5, 2) +(1, 1) (2, 1) (3, 1) (3, 2) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 4) (7, 6) +(1, 2) (2, 5) +(7, 1) (3, 6) +(0, 4) (6, 6) +(6, 4) (5, 2) +(1, 1) (3, 2) diff --git a/submodules/flowfree/generated/8x8_6c_1_60c183b5.txt b/submodules/flowfree/generated/8x8_6c_1_60c183b5.txt new file mode 100644 index 0000000000000000000000000000000000000000..8ad090acac50b431b43b35868621296da4f28237 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_1_60c183b5.txt @@ -0,0 +1,54 @@ +""" +.A...... +.B....D. +..F..... +.FD..... +...EB.A. +..C..... +.E...... +...C.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 0) (6, 4) +(1, 1) (4, 4) +(3, 7) (2, 5) +(6, 1) (2, 3) +(1, 6) (3, 4) +(1, 3) (2, 2) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AABBBBBB +ABBDDDDB +AFFDBBBB +AFDDBCCC +AEEEBCAC +AECCCCAC +AEAAAAAC +AAACCCCC +""" + +## Raw solver output: +6 8 8 +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) +(1, 1) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (6, 2) (5, 2) (4, 2) (4, 3) (4, 4) +(3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (2, 3) +(1, 6) (1, 5) (1, 4) (2, 4) (3, 4) +(1, 3) (1, 2) (2, 2) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(1, 0) (6, 4) +(1, 1) (4, 4) +(3, 7) (2, 5) +(6, 1) (2, 3) +(1, 6) (3, 4) +(1, 3) (2, 2) diff --git a/submodules/flowfree/generated/8x8_6c_1_70510986.txt b/submodules/flowfree/generated/8x8_6c_1_70510986.txt new file mode 100644 index 0000000000000000000000000000000000000000..ecd6e5265dea6e2cffaf35bab365edb058002805 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_1_70510986.txt @@ -0,0 +1,56 @@ +""" +.....BA. +.C..C.E. +......D. +..F..... +...D.... +...F.E.. +......A. +..B..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(6, 6) (6, 0) +(5, 0) (2, 7) +(1, 1) (4, 1) +(3, 4) (6, 2) +(6, 1) (5, 5) +(2, 3) (3, 5) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBAA +BCCCCEEA +BEEEEEDA +BEFDDDDA +BEFDAAAA +BEFFAEEE +BEEEAAAE +BBBEEEEE +""" + +## Raw solver output: +6 8 8 +(6, 6) (5, 6) (4, 6) (4, 5) (4, 4) (5, 4) (6, 4) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) +(1, 1) (2, 1) (3, 1) (4, 1) +(3, 4) (3, 3) (4, 3) (5, 3) (6, 3) (6, 2) +(6, 1) (5, 1) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (6, 5) (5, 5) +(2, 3) (2, 4) (2, 5) (3, 5) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(6, 6) (6, 0) +(5, 0) (2, 7) +(1, 1) (4, 1) +(3, 4) (6, 2) +(6, 1) (5, 5) +(2, 3) (3, 5) diff --git a/submodules/flowfree/generated/8x8_6c_2_5e9b9218.txt b/submodules/flowfree/generated/8x8_6c_2_5e9b9218.txt new file mode 100644 index 0000000000000000000000000000000000000000..9e88294fa675bb8a70ec756abe19837c40ec240d --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_2_5e9b9218.txt @@ -0,0 +1,54 @@ +""" +A......B +...C.... +.E...... +...F.... +........ +F......B +.DE..C.. +......DA +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(7, 7) (0, 0) +(7, 5) (7, 0) +(5, 6) (3, 1) +(1, 6) (6, 7) +(1, 2) (2, 6) +(3, 3) (0, 5) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAB +DDDCCCAB +DEDDDCAB +DEEFDCAB +DDEFDCAB +FDEFDCAB +FDEFDCAA +FFFFDDDA +""" + +## Raw solver output: +6 8 8 +(7, 7) (7, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) +(5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) +(1, 6) (1, 5) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (4, 7) (5, 7) (6, 7) +(1, 2) (1, 3) (2, 3) (2, 4) (2, 5) (2, 6) +(3, 3) (3, 4) (3, 5) (3, 6) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(7, 7) (0, 0) +(7, 5) (7, 0) +(5, 6) (3, 1) +(1, 6) (6, 7) +(1, 2) (2, 6) +(3, 3) (0, 5) diff --git a/submodules/flowfree/generated/8x8_6c_2_9769657e.txt b/submodules/flowfree/generated/8x8_6c_2_9769657e.txt new file mode 100644 index 0000000000000000000000000000000000000000..6b93553a4d4b02b6aefd13f18783aa92e4a6811e --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_2_9769657e.txt @@ -0,0 +1,56 @@ +""" +........ +.B..D.F. +....CD.. +..A..... +A.C.E... +........ +BF...... +E....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(2, 3) (0, 4) +(1, 1) (0, 6) +(2, 4) (4, 2) +(4, 1) (5, 2) +(0, 7) (4, 4) +(6, 1) (1, 6) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAEEEEE +ABAEDDFE +ABAECDFE +ABAECCFE +ABCEECFE +BBCCCCFE +BFFFFFFE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (0, 5) (0, 6) +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (4, 3) (4, 2) +(4, 1) (5, 1) (5, 2) +(0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (3, 1) (3, 2) (3, 3) (3, 4) (4, 4) +(6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(2, 3) (0, 4) +(1, 1) (0, 6) +(2, 4) (4, 2) +(4, 1) (5, 2) +(0, 7) (4, 4) +(6, 1) (1, 6) diff --git a/submodules/flowfree/generated/8x8_6c_2_dc1bb401.txt b/submodules/flowfree/generated/8x8_6c_2_dc1bb401.txt new file mode 100644 index 0000000000000000000000000000000000000000..3ab173749e8e40858aa9b11d8f34d55e8a7247b6 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_2_dc1bb401.txt @@ -0,0 +1,56 @@ +""" +.....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB +""" + +## Raw solver output: +6 8 8 +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 3) (4, 3) (4, 2) +(2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 7) +(6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) +(6, 3) (6, 2) (5, 2) (5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) +(4, 4) (4, 5) (5, 5) (6, 5) (7, 5) +(6, 1) (6, 0) (5, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) diff --git a/submodules/flowfree/generated/8x8_6c_3_271db818.txt b/submodules/flowfree/generated/8x8_6c_3_271db818.txt new file mode 100644 index 0000000000000000000000000000000000000000..ae53c16c4f172d7e56a72716cd5549447ee1a257 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_3_271db818.txt @@ -0,0 +1,54 @@ +""" +CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(1, 6) (1, 5) (1, 4) (1, 3) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 5) (3, 4) (4, 4) +(0, 0) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) +(7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) +(4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) diff --git a/submodules/flowfree/generated/8x8_6c_3_cade0083.txt b/submodules/flowfree/generated/8x8_6c_3_cade0083.txt new file mode 100644 index 0000000000000000000000000000000000000000..8e78ee9c9ebb89287d6d3a69c12e5abeed6ce79c --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_3_cade0083.txt @@ -0,0 +1,56 @@ +""" +A.BC.... +..E...E. +........ +...C.... +...F..D. +........ +.BA....F +.......D +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(2, 6) (0, 0) +(2, 0) (1, 6) +(3, 0) (3, 3) +(6, 4) (7, 7) +(2, 1) (6, 1) +(3, 4) (7, 6) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +ABBCCCCC +ABEEEEEC +ABDDDDDC +ABDCCCDC +ABDFFCDC +ABDDFCCC +ABADFFFF +AAADDDDD +""" + +## Raw solver output: +6 8 8 +(2, 6) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(2, 0) (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) +(3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (5, 5) (5, 4) (5, 3) (4, 3) (3, 3) +(6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(2, 1) (3, 1) (4, 1) (5, 1) (6, 1) +(3, 4) (4, 4) (4, 5) (4, 6) (5, 6) (6, 6) (7, 6) + +Touching forbidden +Nodes 152 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(2, 6) (0, 0) +(2, 0) (1, 6) +(3, 0) (3, 3) +(6, 4) (7, 7) +(2, 1) (6, 1) +(3, 4) (7, 6) diff --git a/submodules/flowfree/generated/8x8_6c_3_dc1bb401.txt b/submodules/flowfree/generated/8x8_6c_3_dc1bb401.txt new file mode 100644 index 0000000000000000000000000000000000000000..3ab173749e8e40858aa9b11d8f34d55e8a7247b6 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_3_dc1bb401.txt @@ -0,0 +1,56 @@ +""" +.....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB +""" + +## Raw solver output: +6 8 8 +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 3) (4, 3) (4, 2) +(2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 7) +(6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) +(6, 3) (6, 2) (5, 2) (5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) +(4, 4) (4, 5) (5, 5) (6, 5) (7, 5) +(6, 1) (6, 0) (5, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) diff --git a/submodules/flowfree/generated/8x8_6c_4_271db818.txt b/submodules/flowfree/generated/8x8_6c_4_271db818.txt new file mode 100644 index 0000000000000000000000000000000000000000..ae53c16c4f172d7e56a72716cd5549447ee1a257 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_4_271db818.txt @@ -0,0 +1,54 @@ +""" +CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(1, 6) (1, 5) (1, 4) (1, 3) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 5) (3, 4) (4, 4) +(0, 0) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) +(7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) +(4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) diff --git a/submodules/flowfree/generated/8x8_6c_4_5f121b29.txt b/submodules/flowfree/generated/8x8_6c_4_5f121b29.txt new file mode 100644 index 0000000000000000000000000000000000000000..6f9f955efe67b9cad54a845da2c2d0ebec28aff1 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_4_5f121b29.txt @@ -0,0 +1,56 @@ +""" +........ +......B. +.....C.. +.....A.E +F...D... +E.C.A.F. +....B.D. +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 5) (5, 3) +(4, 6) (6, 1) +(5, 2) (2, 5) +(6, 6) (4, 4) +(7, 3) (0, 5) +(0, 4) (6, 5) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFFF +FBBBBBBF +FBCCCCFF +FBCAAAFE +FBCADDFE +EBCAADFE +EBBBBDDE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(4, 5) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) +(4, 6) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) +(5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) +(6, 6) (5, 6) (5, 5) (5, 4) (4, 4) +(7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (6, 2) (6, 3) (6, 4) (6, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 5) (5, 3) +(4, 6) (6, 1) +(5, 2) (2, 5) +(6, 6) (4, 4) +(7, 3) (0, 5) +(0, 4) (6, 5) diff --git a/submodules/flowfree/generated/8x8_6c_4_dc1bb401.txt b/submodules/flowfree/generated/8x8_6c_4_dc1bb401.txt new file mode 100644 index 0000000000000000000000000000000000000000..3ab173749e8e40858aa9b11d8f34d55e8a7247b6 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_4_dc1bb401.txt @@ -0,0 +1,56 @@ +""" +.....F.A +......F. +..B.A... +......D. +...CE... +.......E +........ +.D....CB +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDFFA +DCCCDDFA +DCBCADDA +DCBCAADA +DCBCEAAA +DCBBEEEE +DCCBBBBB +DDCCCCCB +""" + +## Raw solver output: +6 8 8 +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 3) (4, 3) (4, 2) +(2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 7) +(6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) +(6, 3) (6, 2) (5, 2) (5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) +(4, 4) (4, 5) (5, 5) (6, 5) (7, 5) +(6, 1) (6, 0) (5, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(7, 0) (4, 2) +(2, 2) (7, 7) +(6, 7) (3, 4) +(6, 3) (1, 7) +(4, 4) (7, 5) +(6, 1) (5, 0) diff --git a/submodules/flowfree/generated/8x8_6c_5_176705c4.txt b/submodules/flowfree/generated/8x8_6c_5_176705c4.txt new file mode 100644 index 0000000000000000000000000000000000000000..4b2da54ed0a3373636bf129c1603d10168ef2d36 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_5_176705c4.txt @@ -0,0 +1,56 @@ +""" +........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 4) (1, 1) +(6, 6) (5, 7) +(2, 5) (7, 7) +(5, 2) (1, 4) +(2, 3) (1, 7) +(2, 7) (6, 4) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC +""" + +## Raw solver output: +6 8 8 +(5, 4) (5, 3) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) +(6, 6) (6, 7) (5, 7) +(2, 5) (2, 4) (3, 4) (3, 3) (3, 2) (2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) +(5, 2) (4, 2) (4, 3) (4, 4) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) +(2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) +(2, 7) (3, 7) (4, 7) (4, 6) (5, 6) (5, 5) (6, 5) (6, 4) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 4) (1, 1) +(6, 6) (5, 7) +(2, 5) (7, 7) +(5, 2) (1, 4) +(2, 3) (1, 7) +(2, 7) (6, 4) diff --git a/submodules/flowfree/generated/8x8_6c_5_271db818.txt b/submodules/flowfree/generated/8x8_6c_5_271db818.txt new file mode 100644 index 0000000000000000000000000000000000000000..ae53c16c4f172d7e56a72716cd5549447ee1a257 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_5_271db818.txt @@ -0,0 +1,54 @@ +""" +CD.....D +....C... +....E.B. +.A..F... +....B... +....E... +.AF..... +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CDDDDDDD +CCCCCEEE +EEEEEEBE +EAFFFEBE +EAFBBEBE +EAFBEEBE +EAFBBBBE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(1, 6) (1, 5) (1, 4) (1, 3) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 5) (3, 4) (4, 4) +(0, 0) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) +(7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) +(4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(1, 6) (1, 3) +(6, 2) (4, 4) +(0, 0) (4, 1) +(7, 0) (1, 0) +(4, 2) (4, 5) +(4, 3) (2, 6) diff --git a/submodules/flowfree/generated/8x8_6c_5_edf4c497.txt b/submodules/flowfree/generated/8x8_6c_5_edf4c497.txt new file mode 100644 index 0000000000000000000000000000000000000000..e9b30f199a9865b1f0afd7f0398c4f21f68a3702 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_5_edf4c497.txt @@ -0,0 +1,56 @@ +""" +CE...... +........ +.C.BD... +.B.AF... +........ +.A...... +.F.D.... +.......E +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(1, 5) (3, 3) +(1, 3) (3, 2) +(0, 0) (1, 2) +(4, 2) (3, 6) +(7, 7) (1, 0) +(1, 6) (4, 3) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CEEEEEEE +CCCCCCCE +CCBBDDCE +CBBAFDCE +CAAAFDCE +CAFFFDCE +CFFDDDCE +CCCCCCCE +""" + +## Raw solver output: +6 8 8 +(1, 5) (1, 4) (2, 4) (3, 4) (3, 3) +(1, 3) (2, 3) (2, 2) (3, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(4, 2) (5, 2) (5, 3) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) +(7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 6) (2, 6) (2, 5) (3, 5) (4, 5) (4, 4) (4, 3) + +Touching forbidden +Nodes 79 +Solutions 2 + +## Solver input (raw puzzle block): +6 8 8 +(1, 5) (3, 3) +(1, 3) (3, 2) +(0, 0) (1, 2) +(4, 2) (3, 6) +(7, 7) (1, 0) +(1, 6) (4, 3) diff --git a/submodules/flowfree/generated/8x8_6c_6_13c2982c.txt b/submodules/flowfree/generated/8x8_6c_6_13c2982c.txt new file mode 100644 index 0000000000000000000000000000000000000000..e286e95df45da0d86b773d592cba049dcd6c0937 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_6_13c2982c.txt @@ -0,0 +1,56 @@ +""" +........ +.D...A.. +..DC.... +B.F..FA. +..E..... +..C..... +......B. +E....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 1) (6, 3) +(6, 6) (0, 3) +(2, 5) (3, 2) +(2, 2) (1, 1) +(2, 4) (0, 7) +(5, 3) (2, 3) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCFFFF +CDDCFAAF +CCDCFFAF +BCFFFFAF +BCEEFFFF +BCCEEEEE +BBBBBBBE +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(5, 1) (6, 1) (6, 2) (6, 3) +(6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) +(2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (3, 1) (3, 2) +(2, 2) (2, 1) (1, 1) +(2, 4) (3, 4) (3, 5) (4, 5) (5, 5) (6, 5) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) +(5, 3) (5, 2) (4, 2) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (4, 4) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 81 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 1) (6, 3) +(6, 6) (0, 3) +(2, 5) (3, 2) +(2, 2) (1, 1) +(2, 4) (0, 7) +(5, 3) (2, 3) diff --git a/submodules/flowfree/generated/8x8_6c_6_176705c4.txt b/submodules/flowfree/generated/8x8_6c_6_176705c4.txt new file mode 100644 index 0000000000000000000000000000000000000000..4b2da54ed0a3373636bf129c1603d10168ef2d36 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_6_176705c4.txt @@ -0,0 +1,56 @@ +""" +........ +.A...... +.....D.. +..E..... +.D...AF. +..C..... +......B. +.EF..B.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 4) (1, 1) +(6, 6) (5, 7) +(2, 5) (7, 7) +(5, 2) (1, 4) +(2, 3) (1, 7) +(2, 7) (6, 4) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CAAAAAAC +CCCCDDAC +EEECDAAC +EDCCDAFC +EDCDDFFC +EDDDFFBC +EEFFFBBC +""" + +## Raw solver output: +6 8 8 +(5, 4) (5, 3) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) +(6, 6) (6, 7) (5, 7) +(2, 5) (2, 4) (3, 4) (3, 3) (3, 2) (2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) +(5, 2) (4, 2) (4, 3) (4, 4) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) +(2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) +(2, 7) (3, 7) (4, 7) (4, 6) (5, 6) (5, 5) (6, 5) (6, 4) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 4) (1, 1) +(6, 6) (5, 7) +(2, 5) (7, 7) +(5, 2) (1, 4) +(2, 3) (1, 7) +(2, 7) (6, 4) diff --git a/submodules/flowfree/generated/8x8_6c_6_fbde3bc8.txt b/submodules/flowfree/generated/8x8_6c_6_fbde3bc8.txt new file mode 100644 index 0000000000000000000000000000000000000000..2310fc61093ece4e48be145c7db3379e049e4f13 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_6_fbde3bc8.txt @@ -0,0 +1,54 @@ +""" +DC...... +........ +.....B.. +AF.B.... +F..A.... +C.....D. +E....... +.......E +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(3, 4) (0, 3) +(3, 3) (5, 2) +(0, 5) (1, 0) +(6, 5) (0, 0) +(0, 6) (7, 7) +(1, 3) (0, 4) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DCCCCCCC +DDDDDDDC +AAAAABDC +AFBBABDC +FFBAABDC +CCBBBBDC +ECCCCCCC +EEEEEEEE +""" + +## Raw solver output: +6 8 8 +(3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (1, 2) (0, 2) (0, 3) +(3, 3) (2, 3) (2, 4) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (5, 2) +(0, 5) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (0, 1) (0, 0) +(0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(1, 3) (1, 4) (0, 4) + +Touching forbidden +Nodes 77 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(3, 4) (0, 3) +(3, 3) (5, 2) +(0, 5) (1, 0) +(6, 5) (0, 0) +(0, 6) (7, 7) +(1, 3) (0, 4) diff --git a/submodules/flowfree/generated/8x8_6c_7_1786c3a8.txt b/submodules/flowfree/generated/8x8_6c_7_1786c3a8.txt new file mode 100644 index 0000000000000000000000000000000000000000..b5272841652c1f880a8d57995a7dc5e7b366ef7e --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_7_1786c3a8.txt @@ -0,0 +1,56 @@ +""" +........ +..F..E.D +C....D.. +A....... +....E... +........ +..CF..B. +A...B... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(0, 3) (0, 7) +(6, 6) (4, 7) +(2, 6) (0, 2) +(5, 2) (7, 1) +(5, 1) (4, 4) +(2, 1) (3, 6) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCDDDD +CFFCDEED +CFCCDDEE +AFCBBBBE +AFCBEEBE +AFCBBEBE +AFCFBEBE +AFFFBEEE +""" + +## Raw solver output: +6 8 8 +(0, 3) (0, 4) (0, 5) (0, 6) (0, 7) +(6, 6) (6, 5) (6, 4) (6, 3) (5, 3) (4, 3) (3, 3) (3, 4) (3, 5) (4, 5) (4, 6) (4, 7) +(2, 6) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (3, 1) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(5, 2) (4, 2) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) +(5, 1) (6, 1) (6, 2) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (4, 4) +(2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (3, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(0, 3) (0, 7) +(6, 6) (4, 7) +(2, 6) (0, 2) +(5, 2) (7, 1) +(5, 1) (4, 4) +(2, 1) (3, 6) diff --git a/submodules/flowfree/generated/8x8_6c_7_1f3b452b.txt b/submodules/flowfree/generated/8x8_6c_7_1f3b452b.txt new file mode 100644 index 0000000000000000000000000000000000000000..84329faab8eb96c8dda9ce6b1325334f7c58b3f4 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_7_1f3b452b.txt @@ -0,0 +1,54 @@ +""" +........ +.B..CF.. +......F. +..D.A... +..C....A +......BD +.E....E. +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 3) (7, 4) +(6, 5) (1, 1) +(4, 1) (2, 4) +(7, 5) (2, 3) +(1, 6) (6, 6) +(5, 1) (6, 2) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDCCCCC +DBDCCFFC +DBDCCCFC +DBDCACCC +DBCCAAAA +DBBBBBBD +DEEEEEED +DDDDDDDD +""" + +## Raw solver output: +6 8 8 +(4, 3) (4, 4) (5, 4) (6, 4) (7, 4) +(6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(4, 1) (4, 2) (5, 2) (5, 3) (6, 3) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (3, 1) (3, 2) (3, 3) (3, 4) (2, 4) +(7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) (2, 3) +(1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) +(5, 1) (6, 1) (6, 2) + +Touching forbidden +Nodes 140 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 3) (7, 4) +(6, 5) (1, 1) +(4, 1) (2, 4) +(7, 5) (2, 3) +(1, 6) (6, 6) +(5, 1) (6, 2) diff --git a/submodules/flowfree/generated/8x8_6c_7_82c77513.txt b/submodules/flowfree/generated/8x8_6c_7_82c77513.txt new file mode 100644 index 0000000000000000000000000000000000000000..b1af61322af902f186b880a27d82ef5980e50627 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_7_82c77513.txt @@ -0,0 +1,56 @@ +""" +........ +........ +..B..AD. +.D.F.... +.....E.. +..C..... +.B...A.. +.CE..F.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 6) (5, 2) +(2, 2) (1, 6) +(2, 5) (1, 7) +(1, 3) (6, 2) +(2, 7) (5, 4) +(5, 7) (3, 3) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFFF +FDDDDDDF +FDBBBADF +FDFFBAAF +FFFBBEAF +CCCBEEAF +CBBBEAAF +CCEEEFFF +""" + +## Raw solver output: +6 8 8 +(5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (5, 3) (5, 2) +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) +(2, 5) (1, 5) (0, 5) (0, 6) (0, 7) (1, 7) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) +(2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (5, 5) (5, 4) +(5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (2, 3) (3, 3) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 6) (5, 2) +(2, 2) (1, 6) +(2, 5) (1, 7) +(1, 3) (6, 2) +(2, 7) (5, 4) +(5, 7) (3, 3) diff --git a/submodules/flowfree/generated/8x8_6c_8_7d3b36a6.txt b/submodules/flowfree/generated/8x8_6c_8_7d3b36a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..c74a38209b25766899f822b29b20c3f681b68602 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_8_7d3b36a6.txt @@ -0,0 +1,54 @@ +""" +....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC +""" + +## Raw solver output: +6 8 8 +(4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) +(7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) +(5, 3) (4, 3) (4, 2) (3, 2) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(0, 5) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) diff --git a/submodules/flowfree/generated/8x8_6c_8_8b279246.txt b/submodules/flowfree/generated/8x8_6c_8_8b279246.txt new file mode 100644 index 0000000000000000000000000000000000000000..2cbc1a88637677e0b86ae1b1f7e791ae3d01fcfe --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_8_8b279246.txt @@ -0,0 +1,56 @@ +""" +......BC +.D.B.... +...A.... +..F...E. +.....A.. +...C.E.. +.D...... +.......F +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(3, 2) (5, 4) +(6, 0) (3, 1) +(7, 0) (3, 5) +(1, 6) (1, 1) +(5, 5) (6, 3) +(7, 7) (2, 3) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFBBBBC +FDFBCCCC +FDFACAAA +FDFACAEA +FDAACAEA +FDACCEEA +FDAAAAAA +FFFFFFFF +""" + +## Raw solver output: +6 8 8 +(3, 2) (3, 3) (3, 4) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (5, 3) (5, 4) +(6, 0) (5, 0) (4, 0) (3, 0) (3, 1) +(7, 0) (7, 1) (6, 1) (5, 1) (4, 1) (4, 2) (4, 3) (4, 4) (4, 5) (3, 5) +(1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(5, 5) (6, 5) (6, 4) (6, 3) +(7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) (2, 3) + +Touching forbidden +Nodes 152 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(3, 2) (5, 4) +(6, 0) (3, 1) +(7, 0) (3, 5) +(1, 6) (1, 1) +(5, 5) (6, 3) +(7, 7) (2, 3) diff --git a/submodules/flowfree/generated/8x8_6c_8_b948f6b0.txt b/submodules/flowfree/generated/8x8_6c_8_b948f6b0.txt new file mode 100644 index 0000000000000000000000000000000000000000..24acd43237e596c0568ad2ecd4ad2fee68b84e83 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_8_b948f6b0.txt @@ -0,0 +1,56 @@ +""" +.CB....B +..D..AF. +........ +.....A.. +........ +...E.E.. +......D. +C.....F. +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 1) (5, 3) +(2, 0) (7, 0) +(1, 0) (0, 7) +(6, 6) (2, 1) +(3, 5) (5, 5) +(6, 1) (6, 7) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCBBBBBB +CDDAAAFF +CDAAEEEF +CDAEEAEF +CDAEAAEF +CDAEAEEF +CDAAADDF +CDDDDDFF +""" + +## Raw solver output: +6 8 8 +(5, 1) (4, 1) (3, 1) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (4, 5) (4, 4) (5, 4) (5, 3) +(2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) +(6, 6) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(3, 5) (3, 4) (3, 3) (4, 3) (4, 2) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (5, 5) +(6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 1) (5, 3) +(2, 0) (7, 0) +(1, 0) (0, 7) +(6, 6) (2, 1) +(3, 5) (5, 5) +(6, 1) (6, 7) diff --git a/submodules/flowfree/generated/8x8_6c_9_4b7bece2.txt b/submodules/flowfree/generated/8x8_6c_9_4b7bece2.txt new file mode 100644 index 0000000000000000000000000000000000000000..792d2cf2bb5f49d2f7a590e9553c08e7e5fbc52a --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_9_4b7bece2.txt @@ -0,0 +1,56 @@ +""" +........ +.E....E. +CA....B. +...B.... +.F.D.... +..C..A.. +..FD.... +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(5, 5) (1, 2) +(6, 2) (3, 3) +(2, 5) (0, 2) +(3, 4) (3, 6) +(6, 1) (1, 1) +(2, 6) (1, 4) + + param line: 6 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CEEEEEEC +CAAAAABC +CCCBBABC +CFCDBABC +CFCDBABC +CFFDBBBC +CCCCCCCC +""" + +## Raw solver output: +6 8 8 +(5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) +(6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 5) (4, 4) (4, 3) (3, 3) +(2, 5) (2, 4) (2, 3) (1, 3) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(3, 4) (3, 5) (3, 6) +(6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) +(2, 6) (1, 6) (1, 5) (1, 4) + +Touching forbidden +Nodes 95 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(5, 5) (1, 2) +(6, 2) (3, 3) +(2, 5) (0, 2) +(3, 4) (3, 6) +(6, 1) (1, 1) +(2, 6) (1, 4) diff --git a/submodules/flowfree/generated/8x8_6c_9_7d3b36a6.txt b/submodules/flowfree/generated/8x8_6c_9_7d3b36a6.txt new file mode 100644 index 0000000000000000000000000000000000000000..c74a38209b25766899f822b29b20c3f681b68602 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_9_7d3b36a6.txt @@ -0,0 +1,54 @@ +""" +....AB.E +........ +..BD.E.. +.....D.. +A....... +F....... +C......F +.......C +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAABBE +AEEEEEBE +AEBDDEBE +AEBBDDBE +AEEBBBBE +FFEEEEEE +CFFFFFFF +CCCCCCCC +""" + +## Raw solver output: +6 8 8 +(4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (5, 4) (4, 4) (3, 4) (3, 3) (2, 3) (2, 2) +(7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) +(5, 3) (4, 3) (4, 2) (3, 2) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (5, 5) (4, 5) (3, 5) (2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(0, 5) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 0) (0, 4) +(5, 0) (2, 2) +(7, 7) (0, 6) +(5, 3) (3, 2) +(7, 0) (5, 2) +(0, 5) (7, 6) diff --git a/submodules/flowfree/generated/8x8_6c_9_fc59c90b.txt b/submodules/flowfree/generated/8x8_6c_9_fc59c90b.txt new file mode 100644 index 0000000000000000000000000000000000000000..b5b7c43e77f1b73c1bde70f6b81d9483358fb9a3 --- /dev/null +++ b/submodules/flowfree/generated/8x8_6c_9_fc59c90b.txt @@ -0,0 +1,56 @@ +""" +D....... +.E...... +.FA..C.. +........ +...B.... +......F. +..CBA.E. +D....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +6 8 8 +(4, 6) (2, 2) +(3, 6) (3, 4) +(5, 2) (2, 6) +(0, 0) (0, 7) +(6, 6) (1, 1) +(1, 2) (6, 5) + + param line: 6 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DEEEEEEE +DEAAAAAE +DFACCCAE +DFCCAAAE +DFCBAEEE +DFCBAEFF +DFCBAEEF +DFFFFFFF +""" + +## Raw solver output: +6 8 8 +(4, 6) (4, 5) (4, 4) (4, 3) (5, 3) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (2, 2) +(3, 6) (3, 5) (3, 4) +(5, 2) (4, 2) (3, 2) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) +(6, 6) (5, 6) (5, 5) (5, 4) (6, 4) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (6, 5) + +Touching forbidden +Nodes 88 +Solutions 1 + +## Solver input (raw puzzle block): +6 8 8 +(4, 6) (2, 2) +(3, 6) (3, 4) +(5, 2) (2, 6) +(0, 0) (0, 7) +(6, 6) (1, 1) +(1, 2) (6, 5) diff --git a/submodules/flowfree/generated/8x8_7c_10_a2d578a8.txt b/submodules/flowfree/generated/8x8_7c_10_a2d578a8.txt new file mode 100644 index 0000000000000000000000000000000000000000..3bd474b488a81857bbafea59a22343be7e06a014 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_10_a2d578a8.txt @@ -0,0 +1,59 @@ +""" +C......G +.......D +.G..EA.. +.ED..... +....BF.. +........ +........ +CFBA.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(3, 7) (5, 2) +(4, 4) (2, 7) +(0, 7) (0, 0) +(7, 1) (2, 3) +(4, 2) (1, 3) +(1, 7) (5, 4) +(1, 2) (7, 0) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CGGGGGGG +CGDDDDDD +CGDEEAAA +CEDEBBBA +CEEEBFBA +CFFFFFBA +CFBBBBBA +CFBAAAAA +""" + +## Raw solver output: +7 8 8 +(3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) +(4, 4) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (2, 7) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (2, 2) (2, 3) +(4, 2) (3, 2) (3, 3) (3, 4) (2, 4) (1, 4) (1, 3) +(1, 7) (1, 6) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) +(1, 2) (1, 1) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(3, 7) (5, 2) +(4, 4) (2, 7) +(0, 7) (0, 0) +(7, 1) (2, 3) +(4, 2) (1, 3) +(1, 7) (5, 4) +(1, 2) (7, 0) diff --git a/submodules/flowfree/generated/8x8_7c_10_db102e74.txt b/submodules/flowfree/generated/8x8_7c_10_db102e74.txt new file mode 100644 index 0000000000000000000000000000000000000000..318ec517b7ca3ac9b29337411081830fa68a2a96 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_10_db102e74.txt @@ -0,0 +1,59 @@ +""" +....BE.E +.FC..... +........ +......F. +........ +.D.A.G.. +...B.... +GD.AC... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(3, 5) (3, 7) +(3, 6) (4, 0) +(2, 1) (4, 7) +(1, 7) (1, 5) +(5, 0) (7, 0) +(6, 3) (1, 1) +(5, 5) (0, 7) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBEEE +BFCCCCCC +BFFFFFFC +BBBBBBFC +GGGGGBBC +GDAAGGBC +GDABBBBC +GDAACCCC +""" + +## Raw solver output: +7 8 8 +(3, 5) (2, 5) (2, 6) (2, 7) (3, 7) +(3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (5, 4) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) +(1, 7) (1, 6) (1, 5) +(5, 0) (6, 0) (7, 0) +(6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 1) +(5, 5) (4, 5) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(3, 5) (3, 7) +(3, 6) (4, 0) +(2, 1) (4, 7) +(1, 7) (1, 5) +(5, 0) (7, 0) +(6, 3) (1, 1) +(5, 5) (0, 7) diff --git a/submodules/flowfree/generated/8x8_7c_1_172e1fee.txt b/submodules/flowfree/generated/8x8_7c_1_172e1fee.txt new file mode 100644 index 0000000000000000000000000000000000000000..a497b9833a8f7f214cbd3abd7b6903d00d6707f9 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_1_172e1fee.txt @@ -0,0 +1,59 @@ +""" +...GA... +......E. +.B.....A +.E.F.... +......C. +FG...B.. +....C... +D.D..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(4, 0) (7, 2) +(1, 2) (5, 5) +(4, 6) (6, 4) +(2, 7) (0, 7) +(6, 1) (1, 3) +(0, 5) (3, 3) +(3, 0) (1, 5) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGGAAAA +GBBBBBEA +GBEEEBEA +GEEFEBEE +GGFFEBCE +FGFEEBCE +FFFECCCE +DDDEEEEE +""" + +## Raw solver output: +7 8 8 +(4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) +(1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) +(4, 6) (5, 6) (6, 6) (6, 5) (6, 4) +(2, 7) (1, 7) (0, 7) +(6, 1) (6, 2) (6, 3) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (3, 6) (3, 5) (4, 5) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (1, 3) +(0, 5) (0, 6) (1, 6) (2, 6) (2, 5) (2, 4) (3, 4) (3, 3) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (1, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(4, 0) (7, 2) +(1, 2) (5, 5) +(4, 6) (6, 4) +(2, 7) (0, 7) +(6, 1) (1, 3) +(0, 5) (3, 3) +(3, 0) (1, 5) diff --git a/submodules/flowfree/generated/8x8_7c_1_826ba2c7.txt b/submodules/flowfree/generated/8x8_7c_1_826ba2c7.txt new file mode 100644 index 0000000000000000000000000000000000000000..fe3a1bb7da57991796eba8d22153120ff0516fbd --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_1_826ba2c7.txt @@ -0,0 +1,59 @@ +""" +D...B... +..GD..F. +.....E.. +.....CE. +...CB... +........ +.F.A..A. +.G...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(6, 6) (3, 6) +(4, 4) (4, 0) +(5, 3) (3, 4) +(3, 1) (0, 0) +(6, 3) (5, 2) +(1, 6) (6, 1) +(2, 1) (1, 7) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDBBBB +GGGDFFFB +GFFFFEEB +GFCCCCEB +GFCCBBBB +GFCCCCCC +GFCAAAAC +GGCCCCCC +""" + +## Raw solver output: +7 8 8 +(6, 6) (5, 6) (4, 6) (3, 6) +(4, 4) (5, 4) (6, 4) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) +(5, 3) (4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (6, 5) (5, 5) (4, 5) (3, 5) (3, 4) +(3, 1) (3, 0) (2, 0) (1, 0) (0, 0) +(6, 3) (6, 2) (5, 2) +(1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (4, 1) (5, 1) (6, 1) +(2, 1) (1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) + +Touching forbidden +Nodes 94 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(6, 6) (3, 6) +(4, 4) (4, 0) +(5, 3) (3, 4) +(3, 1) (0, 0) +(6, 3) (5, 2) +(1, 6) (6, 1) +(2, 1) (1, 7) diff --git a/submodules/flowfree/generated/8x8_7c_2_50f367b4.txt b/submodules/flowfree/generated/8x8_7c_2_50f367b4.txt new file mode 100644 index 0000000000000000000000000000000000000000..7c9ef16ef928271951bc4d36c0bc77c1ec197b87 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_2_50f367b4.txt @@ -0,0 +1,59 @@ +""" +.C....AG +.A.E.... +..F.DB.. +D......G +...BE... +......F. +.C...... +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(6, 0) (1, 1) +(3, 4) (5, 2) +(1, 6) (1, 0) +(4, 2) (0, 3) +(3, 1) (4, 4) +(2, 2) (6, 5) +(7, 3) (7, 0) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCAAAAAG +CAAEDDDG +CCFEDBDG +DCFEEBDG +DCFBEBDD +DCFBBBFD +DCFFFFFD +DDDDDDDD +""" + +## Raw solver output: +7 8 8 +(6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (2, 1) (1, 1) +(3, 4) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (5, 2) +(1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) +(4, 2) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) +(3, 1) (3, 2) (3, 3) (4, 3) (4, 4) +(2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) +(7, 3) (7, 2) (7, 1) (7, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(6, 0) (1, 1) +(3, 4) (5, 2) +(1, 6) (1, 0) +(4, 2) (0, 3) +(3, 1) (4, 4) +(2, 2) (6, 5) +(7, 3) (7, 0) diff --git a/submodules/flowfree/generated/8x8_7c_2_82209848.txt b/submodules/flowfree/generated/8x8_7c_2_82209848.txt new file mode 100644 index 0000000000000000000000000000000000000000..ed45552ceab95c4aad487d306083564d645e6f43 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_2_82209848.txt @@ -0,0 +1,59 @@ +""" +.......E +.F...F.. +........ +..AD.G.. +.......C +.D..G.E. +.A....B. +BC...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(1, 6) (2, 3) +(0, 7) (6, 6) +(7, 4) (1, 7) +(3, 3) (1, 5) +(7, 0) (6, 5) +(1, 1) (5, 1) +(5, 3) (4, 5) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBBE +BFFFFFBE +BDDDBBBE +BDADBGEE +BDABBGEC +BDABGGEC +BAABBBBC +BCCCCCCC +""" + +## Raw solver output: +7 8 8 +(1, 6) (2, 6) (2, 5) (2, 4) (2, 3) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) (4, 3) (4, 4) (3, 4) (3, 5) (3, 6) (4, 6) (5, 6) (6, 6) +(7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) +(3, 3) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (1, 5) +(7, 0) (7, 1) (7, 2) (7, 3) (6, 3) (6, 4) (6, 5) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) +(5, 3) (5, 4) (5, 5) (4, 5) + +Touching forbidden +Nodes 94 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(1, 6) (2, 3) +(0, 7) (6, 6) +(7, 4) (1, 7) +(3, 3) (1, 5) +(7, 0) (6, 5) +(1, 1) (5, 1) +(5, 3) (4, 5) diff --git a/submodules/flowfree/generated/8x8_7c_3_18741047.txt b/submodules/flowfree/generated/8x8_7c_3_18741047.txt new file mode 100644 index 0000000000000000000000000000000000000000..9f33d2263273a6a59ab402d01ba61d1d8268ffbd --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_3_18741047.txt @@ -0,0 +1,59 @@ +""" +.....D.B +......BE +......F. +...G.C.. +....E..G +..C.A.A. +..F..... +.......D +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(4, 5) (6, 5) +(7, 0) (6, 1) +(5, 3) (2, 5) +(5, 0) (7, 7) +(4, 4) (7, 1) +(2, 6) (6, 2) +(7, 4) (3, 3) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDBB +DFFFFFBE +DFCCCFFE +DFCGCCEE +DFCGEEEG +DFCGAAAG +DFFGGGGG +DDDDDDDD +""" + +## Raw solver output: +7 8 8 +(4, 5) (5, 5) (6, 5) +(7, 0) (6, 0) (6, 1) +(5, 3) (4, 3) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(4, 4) (5, 4) (6, 4) (6, 3) (7, 3) (7, 2) (7, 1) +(2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (6, 2) +(7, 4) (7, 5) (7, 6) (6, 6) (5, 6) (4, 6) (3, 6) (3, 5) (3, 4) (3, 3) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(4, 5) (6, 5) +(7, 0) (6, 1) +(5, 3) (2, 5) +(5, 0) (7, 7) +(4, 4) (7, 1) +(2, 6) (6, 2) +(7, 4) (3, 3) diff --git a/submodules/flowfree/generated/8x8_7c_3_71726d93.txt b/submodules/flowfree/generated/8x8_7c_3_71726d93.txt new file mode 100644 index 0000000000000000000000000000000000000000..04bc39ed495787bd10a1daec1a89be4b591c6c53 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_3_71726d93.txt @@ -0,0 +1,59 @@ +""" +....D..G +.C...... +....C... +B.A..... +....F... +.E.E.D.. +.A.F.G.B +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(2, 3) (1, 6) +(7, 6) (0, 3) +(4, 2) (1, 1) +(5, 5) (4, 0) +(1, 5) (3, 5) +(4, 4) (3, 6) +(5, 6) (7, 0) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEDDDG +ECCEEEDG +EECCCEDG +BEAEEEDG +BEAEFDDG +BEAEFDGG +BAAFFGGB +BBBBBBBB +""" + +## Raw solver output: +7 8 8 +(2, 3) (2, 4) (2, 5) (2, 6) (1, 6) +(7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) +(4, 2) (3, 2) (2, 2) (2, 1) (1, 1) +(5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) +(1, 5) (1, 4) (1, 3) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (4, 3) (3, 3) (3, 4) (3, 5) +(4, 4) (4, 5) (4, 6) (3, 6) +(5, 6) (6, 6) (6, 5) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) + +Touching forbidden +Nodes 69 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(2, 3) (1, 6) +(7, 6) (0, 3) +(4, 2) (1, 1) +(5, 5) (4, 0) +(1, 5) (3, 5) +(4, 4) (3, 6) +(5, 6) (7, 0) diff --git a/submodules/flowfree/generated/8x8_7c_4_2a92f0be.txt b/submodules/flowfree/generated/8x8_7c_4_2a92f0be.txt new file mode 100644 index 0000000000000000000000000000000000000000..87baf74a57610c5f7c04e148db1d9c153e107e12 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_4_2a92f0be.txt @@ -0,0 +1,59 @@ +""" +D....BGE +F....... +.D..A... +.......F +C..E.A.. +..B..G.. +........ +.C...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(4, 2) (5, 4) +(5, 0) (2, 5) +(1, 7) (0, 4) +(1, 2) (0, 0) +(7, 0) (3, 4) +(7, 3) (0, 1) +(5, 5) (6, 0) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDBBBBGE +FDBGGGGE +FDBGAAEE +FFBGGAEF +CFBEGAEF +CFBEGGEF +CFFEEEEF +CCFFFFFF +""" + +## Raw solver output: +7 8 8 +(4, 2) (5, 2) (5, 3) (5, 4) +(5, 0) (4, 0) (3, 0) (2, 0) (2, 1) (2, 2) (2, 3) (2, 4) (2, 5) +(1, 7) (0, 7) (0, 6) (0, 5) (0, 4) +(1, 2) (1, 1) (1, 0) (0, 0) +(7, 0) (7, 1) (7, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 5) (3, 4) +(7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (0, 3) (0, 2) (0, 1) +(5, 5) (4, 5) (4, 4) (4, 3) (3, 3) (3, 2) (3, 1) (4, 1) (5, 1) (6, 1) (6, 0) + +Touching forbidden +Nodes 71 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(4, 2) (5, 4) +(5, 0) (2, 5) +(1, 7) (0, 4) +(1, 2) (0, 0) +(7, 0) (3, 4) +(7, 3) (0, 1) +(5, 5) (6, 0) diff --git a/submodules/flowfree/generated/8x8_7c_4_a3784e4f.txt b/submodules/flowfree/generated/8x8_7c_4_a3784e4f.txt new file mode 100644 index 0000000000000000000000000000000000000000..c9db59609e51058a1bc9bdf8e1ff01969d163051 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_4_a3784e4f.txt @@ -0,0 +1,59 @@ +""" +FA...... +.G...... +.....B.. +.....D.. +...F.... +.B..C..A +.C..EDGE +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(7, 5) (1, 0) +(1, 5) (5, 2) +(4, 5) (1, 6) +(5, 6) (5, 3) +(4, 6) (7, 6) +(3, 4) (0, 0) +(1, 1) (6, 6) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FAAAAAAA +FGGGGGGA +FBBBBBGA +FBCCCDGA +FBCFCDGA +FBCFCDGA +FCCFEDGE +FFFFEEEE +""" + +## Raw solver output: +7 8 8 +(7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(1, 5) (1, 4) (1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) +(4, 5) (4, 4) (4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) (1, 6) +(5, 6) (5, 5) (5, 4) (5, 3) +(4, 6) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) +(3, 4) (3, 5) (3, 6) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) + +Touching forbidden +Nodes 91 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(7, 5) (1, 0) +(1, 5) (5, 2) +(4, 5) (1, 6) +(5, 6) (5, 3) +(4, 6) (7, 6) +(3, 4) (0, 0) +(1, 1) (6, 6) diff --git a/submodules/flowfree/generated/8x8_7c_5_0118fd6b.txt b/submodules/flowfree/generated/8x8_7c_5_0118fd6b.txt new file mode 100644 index 0000000000000000000000000000000000000000..3bfb9f3e97dee6e8c569a6642c47bb3370a67835 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_5_0118fd6b.txt @@ -0,0 +1,59 @@ +""" +........ +B....... +........ +....A.F. +F.A..... +E.G..D.C +...GD... +....EB.C +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(4, 3) (2, 4) +(5, 7) (0, 1) +(7, 7) (7, 5) +(5, 5) (4, 6) +(4, 7) (0, 5) +(0, 4) (6, 3) +(2, 5) (3, 6) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBBB +BFFFFFFB +FFGGGGFB +FGGAAGFB +FGAAGGBB +EGGGGDBC +EGGGDDBC +EEEEEBBC +""" + +## Raw solver output: +7 8 8 +(4, 3) (3, 3) (3, 4) (2, 4) +(5, 7) (6, 7) (6, 6) (6, 5) (6, 4) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(7, 7) (7, 6) (7, 5) +(5, 5) (5, 6) (4, 6) +(4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) +(0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) +(2, 5) (3, 5) (4, 5) (4, 4) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (1, 3) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(4, 3) (2, 4) +(5, 7) (0, 1) +(7, 7) (7, 5) +(5, 5) (4, 6) +(4, 7) (0, 5) +(0, 4) (6, 3) +(2, 5) (3, 6) diff --git a/submodules/flowfree/generated/8x8_7c_5_d4345423.txt b/submodules/flowfree/generated/8x8_7c_5_d4345423.txt new file mode 100644 index 0000000000000000000000000000000000000000..f3a6192ef08af2e14061291ab18634a788d512bd --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_5_d4345423.txt @@ -0,0 +1,59 @@ +""" +........ +.C...... +..AF.D.. +....DG.. +........ +F.E..... +G.BEB.C. +......A. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(6, 7) (2, 2) +(4, 6) (2, 6) +(1, 1) (6, 6) +(4, 3) (5, 2) +(2, 5) (3, 6) +(0, 5) (3, 2) +(5, 3) (0, 6) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAA +ACCCCCCA +AAAFDDCA +FFFFDGCA +FBBBBGCA +FBEEBGCA +GBBEBGCA +GGGGGGAA +""" + +## Raw solver output: +7 8 8 +(6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) (2, 2) +(4, 6) (4, 5) (4, 4) (3, 4) (2, 4) (1, 4) (1, 5) (1, 6) (2, 6) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(4, 3) (4, 2) (5, 2) +(2, 5) (3, 5) (3, 6) +(0, 5) (0, 4) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) +(5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(6, 7) (2, 2) +(4, 6) (2, 6) +(1, 1) (6, 6) +(4, 3) (5, 2) +(2, 5) (3, 6) +(0, 5) (3, 2) +(5, 3) (0, 6) diff --git a/submodules/flowfree/generated/8x8_7c_6_3ff2d94a.txt b/submodules/flowfree/generated/8x8_7c_6_3ff2d94a.txt new file mode 100644 index 0000000000000000000000000000000000000000..6b7996bf3013ca607e234fbccf87357b752f3c38 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_6_3ff2d94a.txt @@ -0,0 +1,59 @@ +""" +.....C.B +....BF.. +..D..... +.F..DC.. +........ +...E..EG +.A...... +G......A +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(1, 6) (7, 7) +(4, 1) (7, 0) +(5, 3) (5, 0) +(2, 2) (4, 3) +(3, 5) (6, 5) +(5, 1) (1, 3) +(0, 7) (7, 5) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBCCB +BFFFBFCB +BFDFFFCB +BFDDDCCB +BBBBBBBB +GGGEEEEG +GAGGGGGG +GAAAAAAA +""" + +## Raw solver output: +7 8 8 +(1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) +(5, 3) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) +(2, 2) (2, 3) (3, 3) (4, 3) +(3, 5) (4, 5) (5, 5) (6, 5) +(5, 1) (5, 2) (4, 2) (3, 2) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) +(0, 7) (0, 6) (0, 5) (1, 5) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) + +Touching forbidden +Nodes 74 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(1, 6) (7, 7) +(4, 1) (7, 0) +(5, 3) (5, 0) +(2, 2) (4, 3) +(3, 5) (6, 5) +(5, 1) (1, 3) +(0, 7) (7, 5) diff --git a/submodules/flowfree/generated/8x8_7c_6_d2bfa7eb.txt b/submodules/flowfree/generated/8x8_7c_6_d2bfa7eb.txt new file mode 100644 index 0000000000000000000000000000000000000000..30d3d5688a6027b8ae7f92ef08217a5678e27d8a --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_6_d2bfa7eb.txt @@ -0,0 +1,59 @@ +""" +........ +.E...... +..FA.... +....B... +.F.A..E. +...G.... +BC...DG. +...DC... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(3, 2) (3, 4) +(0, 6) (4, 3) +(1, 6) (4, 7) +(3, 7) (5, 6) +(1, 1) (6, 4) +(1, 4) (2, 2) +(3, 5) (6, 6) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CEEEEEEC +CFFAAAEC +CFBBBAEC +CFBAAAEC +CCBGGGGC +BCBDDDGC +BBBDCCCC +""" + +## Raw solver output: +7 8 8 +(3, 2) (4, 2) (5, 2) (5, 3) (5, 4) (4, 4) (3, 4) +(0, 6) (0, 7) (1, 7) (2, 7) (2, 6) (2, 5) (2, 4) (2, 3) (3, 3) (4, 3) +(1, 6) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) +(3, 7) (3, 6) (4, 6) (5, 6) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) +(1, 4) (1, 3) (1, 2) (2, 2) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(3, 2) (3, 4) +(0, 6) (4, 3) +(1, 6) (4, 7) +(3, 7) (5, 6) +(1, 1) (6, 4) +(1, 4) (2, 2) +(3, 5) (6, 6) diff --git a/submodules/flowfree/generated/8x8_7c_7_d0b91616.txt b/submodules/flowfree/generated/8x8_7c_7_d0b91616.txt new file mode 100644 index 0000000000000000000000000000000000000000..c840cd602633d82b2f81959ac476f7c92b30c6a5 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_7_d0b91616.txt @@ -0,0 +1,59 @@ +""" +.....FA. +.G....B. +.C...... +...F...A +D..EC..G +..D..... +..E..B.. +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(6, 0) (7, 3) +(5, 6) (6, 1) +(4, 4) (1, 2) +(2, 5) (0, 4) +(2, 6) (3, 4) +(3, 3) (5, 0) +(1, 1) (7, 4) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFAA +FGGGGGBA +FCCCCGBA +FFFFCGBA +DEEECGBG +DEDDGGBG +DEEDGBBG +DDDDGGGG +""" + +## Raw solver output: +7 8 8 +(6, 0) (7, 0) (7, 1) (7, 2) (7, 3) +(5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) +(4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (1, 2) +(2, 5) (3, 5) (3, 6) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) +(2, 6) (1, 6) (1, 5) (1, 4) (2, 4) (3, 4) +(3, 3) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) +(1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (4, 6) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(6, 0) (7, 3) +(5, 6) (6, 1) +(4, 4) (1, 2) +(2, 5) (0, 4) +(2, 6) (3, 4) +(3, 3) (5, 0) +(1, 1) (7, 4) diff --git a/submodules/flowfree/generated/8x8_7c_7_d86e8aab.txt b/submodules/flowfree/generated/8x8_7c_7_d86e8aab.txt new file mode 100644 index 0000000000000000000000000000000000000000..2438831641a304658a4c0959d05929f0c569cde2 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_7_d86e8aab.txt @@ -0,0 +1,59 @@ +""" +.D..FE.. +......A. +..A..... +...F.GCB +.E...... +......C. +.GB..... +.......D +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(6, 1) (2, 2) +(2, 6) (7, 3) +(6, 5) (6, 3) +(1, 0) (7, 7) +(1, 4) (5, 0) +(4, 0) (3, 3) +(1, 6) (5, 3) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDFFFEEE +DFFAAAAE +DFAAEEEE +DFFFEGCB +DEEEEGCB +DGGGGGCB +DGBBBBBB +DDDDDDDD +""" + +## Raw solver output: +7 8 8 +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) +(2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) +(6, 5) (6, 4) (6, 3) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(1, 4) (2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (6, 2) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) +(4, 0) (3, 0) (2, 0) (2, 1) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) +(1, 6) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(6, 1) (2, 2) +(2, 6) (7, 3) +(6, 5) (6, 3) +(1, 0) (7, 7) +(1, 4) (5, 0) +(4, 0) (3, 3) +(1, 6) (5, 3) diff --git a/submodules/flowfree/generated/8x8_7c_8_12000403.txt b/submodules/flowfree/generated/8x8_7c_8_12000403.txt new file mode 100644 index 0000000000000000000000000000000000000000..7aaf2b3233b0f4d371cb7d015e83b70e4408ca8a --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_8_12000403.txt @@ -0,0 +1,59 @@ +""" +..CA.... +.A....D. +.EF..... +..G.E..B +....CD.. +..G..... +......B. +.......F +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(3, 0) (1, 1) +(6, 6) (7, 3) +(2, 0) (4, 4) +(5, 4) (6, 1) +(4, 3) (1, 2) +(7, 7) (2, 2) +(2, 3) (2, 5) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCAFFFF +CAAAFDDF +CEFFFDFF +CEGEEDFB +CEGECDFB +CEGECFFB +CEEECFBB +CCCCCFFF +""" + +## Raw solver output: +7 8 8 +(3, 0) (3, 1) (2, 1) (1, 1) +(6, 6) (7, 6) (7, 5) (7, 4) (7, 3) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (4, 4) +(5, 4) (5, 3) (5, 2) (5, 1) (6, 1) +(4, 3) (3, 3) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) +(7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) (3, 2) (2, 2) +(2, 3) (2, 4) (2, 5) + +Touching forbidden +Nodes 68 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(3, 0) (1, 1) +(6, 6) (7, 3) +(2, 0) (4, 4) +(5, 4) (6, 1) +(4, 3) (1, 2) +(7, 7) (2, 2) +(2, 3) (2, 5) diff --git a/submodules/flowfree/generated/8x8_7c_8_d3386298.txt b/submodules/flowfree/generated/8x8_7c_8_d3386298.txt new file mode 100644 index 0000000000000000000000000000000000000000..b43230593136a1d0c4ec996ee42eead0b1aaee1a --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_8_d3386298.txt @@ -0,0 +1,59 @@ +""" +EA..B..B +........ +.D...... +.....EG. +........ +..G..ACF +........ +DC...F.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(1, 0) (5, 5) +(7, 0) (4, 0) +(1, 7) (6, 5) +(1, 2) (0, 7) +(5, 3) (0, 0) +(5, 7) (7, 5) +(2, 5) (6, 3) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EAAABBBB +EEEAAAAA +DDEGGGGA +DEEGEEGA +DEGGEAAA +DEGEEACF +DEEECCCF +DCCCCFFF +""" + +## Raw solver output: +7 8 8 +(1, 0) (2, 0) (3, 0) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 5) +(7, 0) (6, 0) (5, 0) (4, 0) +(1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (5, 6) (6, 6) (6, 5) +(1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) +(5, 3) (4, 3) (4, 4) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (2, 3) (2, 2) (2, 1) (1, 1) (0, 1) (0, 0) +(5, 7) (6, 7) (7, 7) (7, 6) (7, 5) +(2, 5) (2, 4) (3, 4) (3, 3) (3, 2) (4, 2) (5, 2) (6, 2) (6, 3) + +Touching forbidden +Nodes 86 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(1, 0) (5, 5) +(7, 0) (4, 0) +(1, 7) (6, 5) +(1, 2) (0, 7) +(5, 3) (0, 0) +(5, 7) (7, 5) +(2, 5) (6, 3) diff --git a/submodules/flowfree/generated/8x8_7c_9_9d87e141.txt b/submodules/flowfree/generated/8x8_7c_9_9d87e141.txt new file mode 100644 index 0000000000000000000000000000000000000000..b0cfbc297da5456021755eeb5b20eab91b82ed49 --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_9_9d87e141.txt @@ -0,0 +1,59 @@ +""" +B...G..G +....ED.D +.EF..... +..B...A. +........ +........ +.C..FA.. +...C.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(5, 6) (6, 3) +(2, 3) (0, 0) +(1, 6) (3, 7) +(7, 1) (5, 1) +(4, 1) (1, 2) +(4, 6) (2, 2) +(7, 0) (4, 0) + + param line: 7 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBGGGG +FFFBEDDD +FEFBECCC +FEBBECAC +FEEEECAC +FCCCCCAC +FCFFFAAC +FFFCCCCC +""" + +## Raw solver output: +7 8 8 +(5, 6) (6, 6) (6, 5) (6, 4) (6, 3) +(2, 3) (3, 3) (3, 2) (3, 1) (3, 0) (2, 0) (1, 0) (0, 0) +(1, 6) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (5, 2) (6, 2) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) +(7, 1) (6, 1) (5, 1) +(4, 1) (4, 2) (4, 3) (4, 4) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) +(4, 6) (3, 6) (2, 6) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (2, 2) +(7, 0) (6, 0) (5, 0) (4, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(5, 6) (6, 3) +(2, 3) (0, 0) +(1, 6) (3, 7) +(7, 1) (5, 1) +(4, 1) (1, 2) +(4, 6) (2, 2) +(7, 0) (4, 0) diff --git a/submodules/flowfree/generated/8x8_7c_9_aad8ae11.txt b/submodules/flowfree/generated/8x8_7c_9_aad8ae11.txt new file mode 100644 index 0000000000000000000000000000000000000000..9c0c01076fbdf7f9f78b819b66d9e254e56cea8a --- /dev/null +++ b/submodules/flowfree/generated/8x8_7c_9_aad8ae11.txt @@ -0,0 +1,59 @@ +""" +...A.... +...DFE.. +..B..... +....G... +...C...F +A..G.... +EDC...B. +........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 8 8 +(0, 5) (3, 0) +(6, 6) (2, 2) +(2, 6) (3, 4) +(1, 6) (3, 1) +(0, 6) (5, 1) +(7, 4) (4, 1) +(4, 3) (3, 5) + + param line: 7 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAFFFF +ADDDFEEF +ADBBBBEF +ADGGGBEF +ADGCCBEF +ADGGCBEE +EDCCCBBE +EEEEEEEE +""" + +## Raw solver output: +7 8 8 +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(6, 6) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) (2, 2) +(2, 6) (3, 6) (4, 6) (4, 5) (4, 4) (3, 4) +(1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) +(0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) +(7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (4, 1) +(4, 3) (3, 3) (2, 3) (2, 4) (2, 5) (3, 5) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 8 8 +(0, 5) (3, 0) +(6, 6) (2, 2) +(2, 6) (3, 4) +(1, 6) (3, 1) +(0, 6) (5, 1) +(7, 4) (4, 1) +(4, 3) (3, 5) diff --git a/submodules/flowfree/generated/8x8_8c_10_83d92d01.txt b/submodules/flowfree/generated/8x8_8c_10_83d92d01.txt new file mode 100644 index 0000000000000000000000000000000000000000..464a61572ab5eb1ebd284f9ea5946a599daf0f7d --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_10_83d92d01.txt @@ -0,0 +1,62 @@ +""" +D...H... +..E..DC. +........ +..A....H +.C...... +..GB.... +F..E..GA +....F..B +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(7, 6) (2, 3) +(3, 5) (7, 7) +(1, 4) (6, 1) +(0, 0) (5, 1) +(3, 6) (2, 1) +(0, 6) (4, 7) +(2, 5) (6, 6) +(7, 3) (4, 0) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDHHHH +EEEDDDCH +ECCCCCCH +ECAAAAAH +ECGGGGAA +EEGBBGGA +FEEEBBGA +FFFFFBBB +""" + +## Raw solver output: +8 8 8 +(7, 6) (7, 5) (7, 4) (6, 4) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(3, 5) (4, 5) (4, 6) (5, 6) (5, 7) (6, 7) (7, 7) +(1, 4) (1, 3) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (6, 1) +(0, 0) (1, 0) (2, 0) (3, 0) (3, 1) (4, 1) (5, 1) +(3, 6) (2, 6) (1, 6) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) +(0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) +(2, 5) (2, 4) (3, 4) (4, 4) (5, 4) (5, 5) (6, 5) (6, 6) +(7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(7, 6) (2, 3) +(3, 5) (7, 7) +(1, 4) (6, 1) +(0, 0) (5, 1) +(3, 6) (2, 1) +(0, 6) (4, 7) +(2, 5) (6, 6) +(7, 3) (4, 0) diff --git a/submodules/flowfree/generated/8x8_8c_10_f24df32a.txt b/submodules/flowfree/generated/8x8_8c_10_f24df32a.txt new file mode 100644 index 0000000000000000000000000000000000000000..0291bef27a828cd597b99f5c15f22677cb8db1c3 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_10_f24df32a.txt @@ -0,0 +1,62 @@ +""" +.AH..... +......B. +.BF..F.. +.CG....D +....C... +..G..... +E..A.... +..EH.D.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(3, 6) (1, 0) +(6, 1) (1, 2) +(1, 3) (4, 4) +(5, 7) (7, 3) +(2, 7) (0, 6) +(2, 2) (5, 2) +(2, 3) (2, 5) +(3, 7) (2, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAHHHHHH +ABBBBBBH +ABFFFFHH +ACGGGGHD +ACCCCGHD +AAGGGGHD +EAAAHHHD +EEEHHDDD +""" + +## Raw solver output: +8 8 8 +(3, 6) (2, 6) (1, 6) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) +(1, 3) (1, 4) (2, 4) (3, 4) (4, 4) +(5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) +(2, 7) (1, 7) (0, 7) (0, 6) +(2, 2) (3, 2) (4, 2) (5, 2) +(2, 3) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (2, 5) +(3, 7) (4, 7) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(3, 6) (1, 0) +(6, 1) (1, 2) +(1, 3) (4, 4) +(5, 7) (7, 3) +(2, 7) (0, 6) +(2, 2) (5, 2) +(2, 3) (2, 5) +(3, 7) (2, 0) diff --git a/submodules/flowfree/generated/8x8_8c_1_25624d86.txt b/submodules/flowfree/generated/8x8_8c_1_25624d86.txt new file mode 100644 index 0000000000000000000000000000000000000000..8856cdd6ca4d9dc279ecc030777acbf3d79e08d8 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_1_25624d86.txt @@ -0,0 +1,60 @@ +""" +.......H +.....F.. +..G..B.. +...BH... +A..C.... +........ +F.EGC.A. +E.D.D... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(0, 4) (6, 6) +(3, 3) (5, 2) +(3, 4) (4, 6) +(4, 7) (2, 7) +(2, 6) (0, 7) +(5, 1) (0, 6) +(2, 2) (3, 6) +(7, 0) (4, 3) + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAH +AFFFFFAH +AFGBBBAH +AFGBHHAH +AFGCCHAH +FFGGCHAH +FEEGCHAH +EEDDDHHH +""" + +## Raw solver output: +8 8 8 +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(3, 3) (3, 2) (4, 2) (5, 2) +(3, 4) (4, 4) (4, 5) (4, 6) +(4, 7) (3, 7) (2, 7) +(2, 6) (1, 6) (1, 7) (0, 7) +(5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (0, 5) (0, 6) +(2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (3, 6) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) (4, 3) + +Touching forbidden +Nodes 66 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(0, 4) (6, 6) +(3, 3) (5, 2) +(3, 4) (4, 6) +(4, 7) (2, 7) +(2, 6) (0, 7) +(5, 1) (0, 6) +(2, 2) (3, 6) +(7, 0) (4, 3) diff --git a/submodules/flowfree/generated/8x8_8c_1_67d5ba9e.txt b/submodules/flowfree/generated/8x8_8c_1_67d5ba9e.txt new file mode 100644 index 0000000000000000000000000000000000000000..abd3e3f2d8eb7d77042bfa88cac4657763bc2890 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_1_67d5ba9e.txt @@ -0,0 +1,62 @@ +""" +.....HGD +..FB.... +..H..G.. +B.D....F +A....... +.EC..... +....E.A. +......C. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(6, 6) (0, 4) +(3, 1) (0, 3) +(2, 5) (6, 7) +(7, 0) (2, 3) +(4, 6) (1, 5) +(7, 3) (2, 1) +(6, 0) (5, 2) +(2, 2) (5, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBHHGD +BFFBHGGD +BFHHHGDD +BFDDDDDF +AFFFFFFF +AECCCCCC +AEEEEAAC +AAAAAACC +""" + +## Raw solver output: +8 8 8 +(6, 6) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) +(3, 1) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (7, 5) (7, 6) (7, 7) (6, 7) +(7, 0) (7, 1) (7, 2) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) +(4, 6) (3, 6) (2, 6) (1, 6) (1, 5) +(7, 3) (7, 4) (6, 4) (5, 4) (4, 4) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) +(6, 0) (6, 1) (5, 1) (5, 2) +(2, 2) (3, 2) (4, 2) (4, 1) (4, 0) (5, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(6, 6) (0, 4) +(3, 1) (0, 3) +(2, 5) (6, 7) +(7, 0) (2, 3) +(4, 6) (1, 5) +(7, 3) (2, 1) +(6, 0) (5, 2) +(2, 2) (5, 0) diff --git a/submodules/flowfree/generated/8x8_8c_1_9c6e60cd.txt b/submodules/flowfree/generated/8x8_8c_1_9c6e60cd.txt new file mode 100644 index 0000000000000000000000000000000000000000..f1bd35fd1fdcf57ad5592775f01ece899ec10898 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_1_9c6e60cd.txt @@ -0,0 +1,62 @@ +""" +......G. +.FE..... +.......G +........ +.HABF.EA +HB...... +......D. +CD....C. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(2, 4) (7, 4) +(3, 4) (1, 5) +(0, 7) (6, 7) +(1, 7) (6, 6) +(2, 1) (6, 4) +(1, 1) (4, 4) +(7, 2) (6, 0) +(1, 4) (0, 5) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAGG +AFEEEAAG +AFFFEEAG +AAAFFEAA +HHABFEEA +HBBBCCCC +CCCCCDDC +CDDDDDCC +""" + +## Raw solver output: +8 8 8 +(2, 4) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (6, 1) (6, 2) (6, 3) (7, 3) (7, 4) +(3, 4) (3, 5) (2, 5) (1, 5) +(0, 7) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (4, 5) (5, 5) (6, 5) (7, 5) (7, 6) (7, 7) (6, 7) +(1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (6, 6) +(2, 1) (3, 1) (4, 1) (4, 2) (5, 2) (5, 3) (5, 4) (6, 4) +(1, 1) (1, 2) (2, 2) (3, 2) (3, 3) (4, 3) (4, 4) +(7, 2) (7, 1) (7, 0) (6, 0) +(1, 4) (0, 4) (0, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(2, 4) (7, 4) +(3, 4) (1, 5) +(0, 7) (6, 7) +(1, 7) (6, 6) +(2, 1) (6, 4) +(1, 1) (4, 4) +(7, 2) (6, 0) +(1, 4) (0, 5) diff --git a/submodules/flowfree/generated/8x8_8c_2_5eb06022.txt b/submodules/flowfree/generated/8x8_8c_2_5eb06022.txt new file mode 100644 index 0000000000000000000000000000000000000000..4d01fa1acc56d980cd4a061372027ae3f406fc06 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_2_5eb06022.txt @@ -0,0 +1,62 @@ +""" +H....... +..F...FE +..D....D +H.E....C +....C... +.G.GA.A. +........ +B......B +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(4, 5) (6, 5) +(0, 7) (7, 7) +(7, 3) (4, 4) +(2, 2) (7, 2) +(2, 3) (7, 1) +(2, 1) (6, 1) +(1, 5) (3, 5) +(0, 3) (0, 0) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HEEEEEEE +HEFFFFFE +HEDDDDDD +HEEAAAAC +AAAACCAC +AGGGACAC +AAAAACCC +BBBBBBBB +""" + +## Raw solver output: +8 8 8 +(4, 5) (4, 6) (3, 6) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (3, 4) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) +(0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(7, 3) (7, 4) (7, 5) (7, 6) (6, 6) (5, 6) (5, 5) (5, 4) (4, 4) +(2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (7, 2) +(2, 3) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) +(2, 1) (3, 1) (4, 1) (5, 1) (6, 1) +(1, 5) (2, 5) (3, 5) +(0, 3) (0, 2) (0, 1) (0, 0) + +Touching forbidden +Nodes 160 +Solutions 2 + +## Solver input (raw puzzle block): +8 8 8 +(4, 5) (6, 5) +(0, 7) (7, 7) +(7, 3) (4, 4) +(2, 2) (7, 2) +(2, 3) (7, 1) +(2, 1) (6, 1) +(1, 5) (3, 5) +(0, 3) (0, 0) diff --git a/submodules/flowfree/generated/8x8_8c_2_a7f0c08f.txt b/submodules/flowfree/generated/8x8_8c_2_a7f0c08f.txt new file mode 100644 index 0000000000000000000000000000000000000000..2da95fb312ea21070d59fad1227954201aeb9bc3 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_2_a7f0c08f.txt @@ -0,0 +1,62 @@ +""" +......BH +.E..H... +A.....B. +C..EG.F. +..A..... +........ +..CD..F. +D...G... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(2, 4) (0, 2) +(6, 0) (6, 2) +(2, 6) (0, 3) +(0, 7) (3, 6) +(3, 3) (1, 1) +(6, 6) (6, 3) +(4, 7) (4, 3) +(4, 1) (7, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAABBBBH +AEABHHHH +AEABBBBB +CEAEGBFB +CEAEGBFB +CEEEGBFB +CCCDGBFB +DDDDGBBB +""" + +## Raw solver output: +8 8 8 +(2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(6, 0) (5, 0) (4, 0) (3, 0) (3, 1) (3, 2) (4, 2) (5, 2) (5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) +(2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (0, 3) +(0, 7) (1, 7) (2, 7) (3, 7) (3, 6) +(3, 3) (3, 4) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) +(6, 6) (6, 5) (6, 4) (6, 3) +(4, 7) (4, 6) (4, 5) (4, 4) (4, 3) +(4, 1) (5, 1) (6, 1) (7, 1) (7, 0) + +Touching forbidden +Nodes 164 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(2, 4) (0, 2) +(6, 0) (6, 2) +(2, 6) (0, 3) +(0, 7) (3, 6) +(3, 3) (1, 1) +(6, 6) (6, 3) +(4, 7) (4, 3) +(4, 1) (7, 0) diff --git a/submodules/flowfree/generated/8x8_8c_3_671c264d.txt b/submodules/flowfree/generated/8x8_8c_3_671c264d.txt new file mode 100644 index 0000000000000000000000000000000000000000..07314c9ef3e2dc949c48438a40840cebb41a66aa --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_3_671c264d.txt @@ -0,0 +1,62 @@ +""" +.H...... +.CB...C. +....F... +.G...BA. +..H...D. +EG...DF. +.A...... +..E..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(1, 6) (6, 3) +(2, 1) (5, 3) +(6, 1) (1, 1) +(5, 5) (6, 4) +(2, 7) (0, 5) +(4, 2) (6, 5) +(1, 5) (1, 3) +(2, 4) (1, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHBBBBBB +HCBCCCCB +HCCCFBBB +HGGGFBAA +HHHGFDDA +EGGGFDFA +EAAAFFFA +EEEAAAAA +""" + +## Raw solver output: +8 8 8 +(1, 6) (2, 6) (3, 6) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (6, 3) +(2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (6, 2) (5, 2) (5, 3) +(6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (2, 2) (1, 2) (1, 1) +(5, 5) (5, 4) (6, 4) +(2, 7) (1, 7) (0, 7) (0, 6) (0, 5) +(4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (6, 6) (6, 5) +(1, 5) (2, 5) (3, 5) (3, 4) (3, 3) (2, 3) (1, 3) +(2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(1, 6) (6, 3) +(2, 1) (5, 3) +(6, 1) (1, 1) +(5, 5) (6, 4) +(2, 7) (0, 5) +(4, 2) (6, 5) +(1, 5) (1, 3) +(2, 4) (1, 0) diff --git a/submodules/flowfree/generated/8x8_8c_3_c81e3705.txt b/submodules/flowfree/generated/8x8_8c_3_c81e3705.txt new file mode 100644 index 0000000000000000000000000000000000000000..80067da7ebf35fbefe7b6e26133e98d2d35313bf --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_3_c81e3705.txt @@ -0,0 +1,62 @@ +""" +HFD..D.E +.......A +.F....C. +.....G.. +.......B +..CE.AH. +....G... +......B. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(5, 5) (7, 1) +(7, 4) (6, 7) +(6, 2) (2, 5) +(2, 0) (5, 0) +(3, 5) (7, 0) +(1, 0) (1, 2) +(4, 6) (5, 3) +(0, 0) (6, 5) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HFDDDDEE +HFEEEEEA +HFECCCCA +HEECGGAA +HECCGAAB +HECEGAHB +HEEEGHHB +HHHHHHBB +""" + +## Raw solver output: +8 8 8 +(5, 5) (5, 4) (6, 4) (6, 3) (7, 3) (7, 2) (7, 1) +(7, 4) (7, 5) (7, 6) (7, 7) (6, 7) +(6, 2) (5, 2) (4, 2) (3, 2) (3, 3) (3, 4) (2, 4) (2, 5) +(2, 0) (3, 0) (4, 0) (5, 0) +(3, 5) (3, 6) (2, 6) (1, 6) (1, 5) (1, 4) (1, 3) (2, 3) (2, 2) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 0) (7, 0) +(1, 0) (1, 1) (1, 2) +(4, 6) (4, 5) (4, 4) (4, 3) (5, 3) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (6, 6) (6, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(5, 5) (7, 1) +(7, 4) (6, 7) +(6, 2) (2, 5) +(2, 0) (5, 0) +(3, 5) (7, 0) +(1, 0) (1, 2) +(4, 6) (5, 3) +(0, 0) (6, 5) diff --git a/submodules/flowfree/generated/8x8_8c_4_da9b061d.txt b/submodules/flowfree/generated/8x8_8c_4_da9b061d.txt new file mode 100644 index 0000000000000000000000000000000000000000..a7f9cafcce06604b46d8903a8d16b989c94e0384 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_4_da9b061d.txt @@ -0,0 +1,62 @@ +""" +BC...... +...HA... +..B..... +..ED...C +...E...A +..D....F +....H.FG +......G. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(7, 4) (4, 1) +(2, 2) (0, 0) +(7, 3) (1, 0) +(3, 3) (2, 5) +(2, 3) (3, 4) +(7, 5) (6, 6) +(6, 7) (7, 6) +(3, 1) (4, 6) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BCCCCCCC +BHHHAAAC +BHBBBBAC +BHEDDBAC +BHEEDBAA +BHDDDBFF +BHHHHBFG +BBBBBBGG +""" + +## Raw solver output: +8 8 8 +(7, 4) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) +(2, 2) (3, 2) (4, 2) (5, 2) (5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) +(3, 3) (4, 3) (4, 4) (4, 5) (3, 5) (2, 5) +(2, 3) (2, 4) (3, 4) +(7, 5) (6, 5) (6, 6) +(6, 7) (7, 7) (7, 6) +(3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(7, 4) (4, 1) +(2, 2) (0, 0) +(7, 3) (1, 0) +(3, 3) (2, 5) +(2, 3) (3, 4) +(7, 5) (6, 6) +(6, 7) (7, 6) +(3, 1) (4, 6) diff --git a/submodules/flowfree/generated/8x8_8c_4_f967b217.txt b/submodules/flowfree/generated/8x8_8c_4_f967b217.txt new file mode 100644 index 0000000000000000000000000000000000000000..0087c534eb008caec4d8e81dd9d95f52973e7fbc --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_4_f967b217.txt @@ -0,0 +1,62 @@ +""" +GBHF.... +......H. +.B....G. +.....AE. +....FC.. +.AD...E. +......C. +...D.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(1, 5) (5, 3) +(1, 2) (1, 0) +(5, 4) (6, 6) +(2, 5) (3, 7) +(6, 5) (6, 3) +(4, 4) (3, 0) +(6, 2) (0, 0) +(6, 1) (2, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GBHFFFFF +GBHHHHHF +GBGGGGGF +GGGAAAEF +DDDAFCEF +DADAFCEF +DAAAFCCF +DDDDFFFF +""" + +## Raw solver output: +8 8 8 +(1, 5) (1, 6) (2, 6) (3, 6) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) +(1, 2) (1, 1) (1, 0) +(5, 4) (5, 5) (5, 6) (6, 6) +(2, 5) (2, 4) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) +(6, 5) (6, 4) (6, 3) +(4, 4) (4, 5) (4, 6) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) +(6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) +(6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (2, 0) + +Touching forbidden +Nodes 70 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(1, 5) (5, 3) +(1, 2) (1, 0) +(5, 4) (6, 6) +(2, 5) (3, 7) +(6, 5) (6, 3) +(4, 4) (3, 0) +(6, 2) (0, 0) +(6, 1) (2, 0) diff --git a/submodules/flowfree/generated/8x8_8c_5_76af8782.txt b/submodules/flowfree/generated/8x8_8c_5_76af8782.txt new file mode 100644 index 0000000000000000000000000000000000000000..73db20f7039e5961f05299b645d541fe90176ed8 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_5_76af8782.txt @@ -0,0 +1,62 @@ +""" +C....... +..BHEDFE +....B... +....HDA. +.C...... +........ +.G...A.. +.....G.F +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(5, 6) (6, 3) +(4, 2) (2, 1) +(0, 0) (1, 4) +(5, 1) (5, 3) +(4, 1) (7, 1) +(7, 7) (6, 1) +(5, 7) (1, 6) +(4, 3) (3, 1) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CHHHEEEE +CHBHEDFE +CHBBBDFF +CHHHHDAF +CCAAAAAF +AAAGGGGF +AGGGAAGF +AAAAAGGF +""" + +## Raw solver output: +8 8 8 +(5, 6) (4, 6) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (1, 5) (2, 5) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 3) +(4, 2) (3, 2) (2, 2) (2, 1) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) +(5, 1) (5, 2) (5, 3) +(4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) +(7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (6, 1) +(5, 7) (6, 7) (6, 6) (6, 5) (5, 5) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) +(4, 3) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) (3, 0) (3, 1) + +Touching forbidden +Nodes 68 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(5, 6) (6, 3) +(4, 2) (2, 1) +(0, 0) (1, 4) +(5, 1) (5, 3) +(4, 1) (7, 1) +(7, 7) (6, 1) +(5, 7) (1, 6) +(4, 3) (3, 1) diff --git a/submodules/flowfree/generated/8x8_8c_5_eba37cd0.txt b/submodules/flowfree/generated/8x8_8c_5_eba37cd0.txt new file mode 100644 index 0000000000000000000000000000000000000000..ee5b06a231670a92d2b165d35ed3ecd0a7bf4a48 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_5_eba37cd0.txt @@ -0,0 +1,62 @@ +""" +D....... +........ +GB....G. +B.E.F.E. +........ +.CA..H.. +....C..D +...FH..A +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(2, 5) (7, 7) +(1, 2) (0, 3) +(1, 5) (4, 6) +(7, 6) (0, 0) +(2, 3) (6, 3) +(4, 3) (3, 7) +(0, 2) (6, 2) +(4, 7) (5, 5) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDDD +GGGGGGGD +GBEEEEGD +BBEFFEED +FFFFAAAD +FCAAAHAD +FCCCCHAD +FFFFHHAA +""" + +## Raw solver output: +8 8 8 +(2, 5) (3, 5) (4, 5) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (6, 7) (7, 7) +(1, 2) (1, 3) (0, 3) +(1, 5) (1, 6) (2, 6) (3, 6) (4, 6) +(7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(2, 3) (2, 2) (3, 2) (4, 2) (5, 2) (5, 3) (6, 3) +(4, 3) (3, 3) (3, 4) (2, 4) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) +(0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) +(4, 7) (5, 7) (5, 6) (5, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(2, 5) (7, 7) +(1, 2) (0, 3) +(1, 5) (4, 6) +(7, 6) (0, 0) +(2, 3) (6, 3) +(4, 3) (3, 7) +(0, 2) (6, 2) +(4, 7) (5, 5) diff --git a/submodules/flowfree/generated/8x8_8c_6_410da633.txt b/submodules/flowfree/generated/8x8_8c_6_410da633.txt new file mode 100644 index 0000000000000000000000000000000000000000..2895b26f5e76e3fd420582bafcd4df6b3e77589a --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_6_410da633.txt @@ -0,0 +1,62 @@ +""" +D....DE. +........ +.B.C.... +.G..H... +A..HB..E +C......F +....A.G. +......F. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(0, 4) (4, 6) +(4, 4) (1, 2) +(0, 5) (3, 2) +(5, 0) (0, 0) +(7, 4) (6, 0) +(7, 5) (6, 7) +(1, 3) (6, 6) +(4, 3) (3, 4) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDEE +GGGGGGGE +GBBCCCGE +GGBHHCGE +AABHBCGE +CABBBCGF +CAAAACGF +CCCCCCFF +""" + +## Raw solver output: +8 8 8 +(0, 4) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) (4, 6) +(4, 4) (4, 5) (3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (1, 2) +(0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) +(7, 5) (7, 6) (7, 7) (6, 7) +(1, 3) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(4, 3) (3, 3) (3, 4) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(0, 4) (4, 6) +(4, 4) (1, 2) +(0, 5) (3, 2) +(5, 0) (0, 0) +(7, 4) (6, 0) +(7, 5) (6, 7) +(1, 3) (6, 6) +(4, 3) (3, 4) diff --git a/submodules/flowfree/generated/8x8_8c_6_86c5e3a0.txt b/submodules/flowfree/generated/8x8_8c_6_86c5e3a0.txt new file mode 100644 index 0000000000000000000000000000000000000000..dba12bf7e5142a5d88a357a03919b68b55f4b77f --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_6_86c5e3a0.txt @@ -0,0 +1,62 @@ +""" +.EF...AH +.G.CF... +...A...B +.....C.. +........ +E...DG.. +..H..... +DB...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(3, 2) (6, 0) +(7, 2) (1, 7) +(5, 3) (3, 1) +(0, 7) (4, 5) +(0, 5) (1, 0) +(2, 0) (4, 1) +(5, 5) (1, 1) +(7, 0) (2, 6) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEFFFAAH +EGCCFAHH +EGCAAAHB +EGCCCCHB +EGGGGGHB +EDDDDGHB +DDHHHHHB +DBBBBBBB +""" + +## Raw solver output: +8 8 8 +(3, 2) (4, 2) (5, 2) (5, 1) (5, 0) (6, 0) +(7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) +(5, 3) (4, 3) (3, 3) (2, 3) (2, 2) (2, 1) (3, 1) +(0, 7) (0, 6) (1, 6) (1, 5) (2, 5) (3, 5) (4, 5) +(0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(2, 0) (3, 0) (4, 0) (4, 1) +(5, 5) (5, 4) (4, 4) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) +(7, 0) (7, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) + +Touching forbidden +Nodes 69 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(3, 2) (6, 0) +(7, 2) (1, 7) +(5, 3) (3, 1) +(0, 7) (4, 5) +(0, 5) (1, 0) +(2, 0) (4, 1) +(5, 5) (1, 1) +(7, 0) (2, 6) diff --git a/submodules/flowfree/generated/8x8_8c_7_a3396780.txt b/submodules/flowfree/generated/8x8_8c_7_a3396780.txt new file mode 100644 index 0000000000000000000000000000000000000000..9191e8354d19ab18b76097a7220513bd440a5cbb --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_7_a3396780.txt @@ -0,0 +1,62 @@ +""" +........ +.E..E.A. +CD.B..G. +..BA.... +....G.F. +..H.CH.. +......F. +D....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(6, 1) (3, 3) +(3, 2) (2, 3) +(4, 5) (0, 2) +(0, 7) (1, 2) +(1, 1) (4, 1) +(6, 6) (6, 4) +(4, 4) (6, 2) +(5, 5) (2, 5) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCC +CEEEEAAC +CDBBAAGC +DDBAAGGC +DCCCGGFC +DCHCCHFC +DCHHHHFC +DCCCCCCC +""" + +## Raw solver output: +8 8 8 +(6, 1) (5, 1) (5, 2) (4, 2) (4, 3) (3, 3) +(3, 2) (2, 2) (2, 3) +(4, 5) (3, 5) (3, 4) (2, 4) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (1, 2) +(1, 1) (2, 1) (3, 1) (4, 1) +(6, 6) (6, 5) (6, 4) +(4, 4) (5, 4) (5, 3) (6, 3) (6, 2) +(5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(6, 1) (3, 3) +(3, 2) (2, 3) +(4, 5) (0, 2) +(0, 7) (1, 2) +(1, 1) (4, 1) +(6, 6) (6, 4) +(4, 4) (6, 2) +(5, 5) (2, 5) diff --git a/submodules/flowfree/generated/8x8_8c_7_ea280416.txt b/submodules/flowfree/generated/8x8_8c_7_ea280416.txt new file mode 100644 index 0000000000000000000000000000000000000000..dd01cee3723ff7152feffd401c1ce25c76de288e --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_7_ea280416.txt @@ -0,0 +1,62 @@ +""" +F....... +......HG +C.E..... +D....... +..CF.B.. +.......H +.EB....A +DG..A... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(7, 6) (4, 7) +(2, 6) (5, 4) +(0, 2) (2, 4) +(0, 7) (0, 3) +(2, 2) (1, 6) +(0, 0) (3, 4) +(7, 1) (1, 7) +(7, 5) (6, 1) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFGGG +CCCCFGHG +CEECFGHH +DECCFGGH +DECFFBGH +DEBBBBGH +DEBGGGGA +DGGGAAAA +""" + +## Raw solver output: +8 8 8 +(7, 6) (7, 7) (6, 7) (5, 7) (4, 7) +(2, 6) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) +(0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (2, 3) (2, 4) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) +(2, 2) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (3, 4) +(7, 1) (7, 0) (6, 0) (5, 0) (5, 1) (5, 2) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 7) (2, 7) (1, 7) +(7, 5) (7, 4) (7, 3) (7, 2) (6, 2) (6, 1) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(7, 6) (4, 7) +(2, 6) (5, 4) +(0, 2) (2, 4) +(0, 7) (0, 3) +(2, 2) (1, 6) +(0, 0) (3, 4) +(7, 1) (1, 7) +(7, 5) (6, 1) diff --git a/submodules/flowfree/generated/8x8_8c_8_14eb01d5.txt b/submodules/flowfree/generated/8x8_8c_8_14eb01d5.txt new file mode 100644 index 0000000000000000000000000000000000000000..6514a10842b5acc3dd8cba5a94a8be3666aa1bf5 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_8_14eb01d5.txt @@ -0,0 +1,62 @@ +""" +F......H +.C..E..A +..EFDC.. +H....... +.G..GD.. +........ +BA...... +.......B +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(1, 6) (7, 1) +(0, 6) (7, 7) +(1, 1) (5, 2) +(4, 2) (5, 4) +(4, 1) (2, 2) +(0, 0) (3, 2) +(1, 4) (4, 4) +(0, 3) (7, 0) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FCCCCCHH +FCEEECHA +FFEFDCHA +HFFFDDHA +HGGGGDHA +HHHHHHHA +BAAAAAAA +BBBBBBBB +""" + +## Raw solver output: +8 8 8 +(1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) +(0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(1, 1) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) +(4, 2) (4, 3) (5, 3) (5, 4) +(4, 1) (3, 1) (2, 1) (2, 2) +(0, 0) (0, 1) (0, 2) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) +(1, 4) (2, 4) (3, 4) (4, 4) +(0, 3) (0, 4) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (7, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(1, 6) (7, 1) +(0, 6) (7, 7) +(1, 1) (5, 2) +(4, 2) (5, 4) +(4, 1) (2, 2) +(0, 0) (3, 2) +(1, 4) (4, 4) +(0, 3) (7, 0) diff --git a/submodules/flowfree/generated/8x8_8c_8_6ac110ec.txt b/submodules/flowfree/generated/8x8_8c_8_6ac110ec.txt new file mode 100644 index 0000000000000000000000000000000000000000..bc0b2cb8ae507c6160d82213c738f20a57c4320d --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_8_6ac110ec.txt @@ -0,0 +1,62 @@ +""" +........ +.F..C... +..D..BCF +D....... +.G.AB.G. +.HA..... +.......H +.....E.E +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(2, 5) (3, 4) +(4, 4) (5, 2) +(6, 2) (4, 1) +(2, 2) (0, 3) +(7, 7) (5, 7) +(1, 1) (7, 2) +(1, 4) (6, 4) +(7, 6) (1, 5) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDFFFFF +DFDFCCCF +DFDFBBCF +DFFFBHHH +GGAABHGH +GHAHHHGH +GHHHGGGH +GGGGGEEE +""" + +## Raw solver output: +8 8 8 +(2, 5) (2, 4) (3, 4) +(4, 4) (4, 3) (4, 2) (5, 2) +(6, 2) (6, 1) (5, 1) (4, 1) +(2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(7, 7) (6, 7) (5, 7) +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (3, 2) (3, 1) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) +(1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) +(7, 6) (7, 5) (7, 4) (7, 3) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) + +Touching forbidden +Nodes 73 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(2, 5) (3, 4) +(4, 4) (5, 2) +(6, 2) (4, 1) +(2, 2) (0, 3) +(7, 7) (5, 7) +(1, 1) (7, 2) +(1, 4) (6, 4) +(7, 6) (1, 5) diff --git a/submodules/flowfree/generated/8x8_8c_9_12367174.txt b/submodules/flowfree/generated/8x8_8c_9_12367174.txt new file mode 100644 index 0000000000000000000000000000000000000000..bf0c18498f627e09afc2ea7c379ca62dbf03f32e --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_9_12367174.txt @@ -0,0 +1,62 @@ +""" +........ +......F. +...H.... +.F.E.C.A +E..D.... +G.B....A +...H.... +..GB..DC +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(7, 5) (7, 3) +(2, 5) (3, 7) +(5, 3) (7, 7) +(3, 4) (6, 7) +(3, 3) (0, 4) +(1, 3) (6, 1) +(0, 5) (2, 7) +(3, 2) (3, 6) + + param line: 8 8 8 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEEE +EFFFFFFE +EFHHEEEE +EFHEECCA +EHHDDDCA +GHBBBDCA +GHHHBDCC +GGGBBDDC +""" + +## Raw solver output: +8 8 8 +(7, 5) (7, 4) (7, 3) +(2, 5) (3, 5) (4, 5) (4, 6) (4, 7) (3, 7) +(5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (7, 6) (7, 7) +(3, 4) (4, 4) (5, 4) (5, 5) (5, 6) (5, 7) (6, 7) +(3, 3) (4, 3) (4, 2) (5, 2) (6, 2) (7, 2) (7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) +(0, 5) (0, 6) (0, 7) (1, 7) (2, 7) +(3, 2) (2, 2) (2, 3) (2, 4) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(7, 5) (7, 3) +(2, 5) (3, 7) +(5, 3) (7, 7) +(3, 4) (6, 7) +(3, 3) (0, 4) +(1, 3) (6, 1) +(0, 5) (2, 7) +(3, 2) (3, 6) diff --git a/submodules/flowfree/generated/8x8_8c_9_3b537bc3.txt b/submodules/flowfree/generated/8x8_8c_9_3b537bc3.txt new file mode 100644 index 0000000000000000000000000000000000000000..cd1121b90f0c928d5647d7f461fa7e578771f9c4 --- /dev/null +++ b/submodules/flowfree/generated/8x8_8c_9_3b537bc3.txt @@ -0,0 +1,62 @@ +""" +.F.....H +.E....A. +....D.GA +.......C +.E...G.. +.BH..B.. +........ +FD...C.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 8 8 +(7, 2) (6, 1) +(5, 5) (1, 5) +(5, 7) (7, 3) +(4, 2) (1, 7) +(1, 1) (1, 4) +(0, 7) (1, 0) +(6, 2) (5, 4) +(2, 5) (7, 0) + + param line: 8 8 8 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFHHHHHH +FEHGGGAA +FEHGDGGA +FEHGDDDC +FEHGGGDC +FBHBBBDC +FBBBDDDC +FDDDDCCC +""" + +## Raw solver output: +8 8 8 +(7, 2) (7, 1) (6, 1) +(5, 5) (4, 5) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) +(5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) +(4, 2) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (4, 7) (3, 7) (2, 7) (1, 7) +(1, 1) (1, 2) (1, 3) (1, 4) +(0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(6, 2) (5, 2) (5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (3, 4) (4, 4) (5, 4) +(2, 5) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) + +Touching forbidden +Nodes 65 +Solutions 1 + +## Solver input (raw puzzle block): +8 8 8 +(7, 2) (6, 1) +(5, 5) (1, 5) +(5, 7) (7, 3) +(4, 2) (1, 7) +(1, 1) (1, 4) +(0, 7) (1, 0) +(6, 2) (5, 4) +(2, 5) (7, 0) diff --git a/submodules/flowfree/generated/9x9_7c_10_67766dd4.txt b/submodules/flowfree/generated/9x9_7c_10_67766dd4.txt new file mode 100644 index 0000000000000000000000000000000000000000..ce12a9fb79be12ecce9a0fdefccd17383ef0cc5b --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_10_67766dd4.txt @@ -0,0 +1,61 @@ +""" +B......C. +.......G. +......... +...F.E.G. +.A.A.D... +...D....B +F........ +....E..C. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(3, 4) (1, 4) +(0, 0) (8, 5) +(7, 7) (7, 0) +(3, 5) (5, 4) +(4, 7) (5, 3) +(0, 6) (3, 3) +(7, 3) (7, 1) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBBCC +EEEEEEBGC +EAAAAEBGC +EAFFAEBGC +EAFAADBCC +EEFDDDBCB +FEFFFFBCB +FEEEEFBCB +FFFFFFBBB +""" + +## Raw solver output: +7 9 9 +(3, 4) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (6, 7) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) +(7, 7) (7, 6) (7, 5) (7, 4) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) +(3, 5) (4, 5) (5, 5) (5, 4) +(4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) +(0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (5, 7) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (2, 3) (3, 3) +(7, 3) (7, 2) (7, 1) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(3, 4) (1, 4) +(0, 0) (8, 5) +(7, 7) (7, 0) +(3, 5) (5, 4) +(4, 7) (5, 3) +(0, 6) (3, 3) +(7, 3) (7, 1) diff --git a/submodules/flowfree/generated/9x9_7c_10_b9baf331.txt b/submodules/flowfree/generated/9x9_7c_10_b9baf331.txt new file mode 100644 index 0000000000000000000000000000000000000000..f21a5cfa93acfc76eb8ed11665f1eacd61dc3d3f --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_10_b9baf331.txt @@ -0,0 +1,61 @@ +""" +......... +.A....... +..GEFE... +.......F. +.C..D.... +......... +B.....DC. +GB....... +...A..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(1, 1) (3, 8) +(0, 6) (1, 7) +(1, 4) (7, 6) +(6, 6) (4, 4) +(5, 2) (3, 2) +(7, 3) (4, 2) +(0, 7) (2, 2) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGEEEEEE +GAGEFFFFE +GAGEFEEFE +GAAAAAEFE +GCCCDAEEE +GGGCDAAAA +BBGCDDDCA +GBGCCCCCA +GGGAAAAAA +""" + +## Raw solver output: +7 9 9 +(1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) (6, 5) (7, 5) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) +(0, 6) (1, 6) (1, 7) +(1, 4) (2, 4) (3, 4) (3, 5) (3, 6) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) +(6, 6) (5, 6) (4, 6) (4, 5) (4, 4) +(5, 2) (6, 2) (6, 3) (6, 4) (7, 4) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (3, 1) (3, 2) +(7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (4, 2) +(0, 7) (0, 8) (1, 8) (2, 8) (2, 7) (2, 6) (2, 5) (1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) + +Touching forbidden +Nodes 96 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(1, 1) (3, 8) +(0, 6) (1, 7) +(1, 4) (7, 6) +(6, 6) (4, 4) +(5, 2) (3, 2) +(7, 3) (4, 2) +(0, 7) (2, 2) diff --git a/submodules/flowfree/generated/9x9_7c_1_a599e0e6.txt b/submodules/flowfree/generated/9x9_7c_1_a599e0e6.txt new file mode 100644 index 0000000000000000000000000000000000000000..e0ef832ebdb58b0d5bc67b965db87dd90fc1602a --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_1_a599e0e6.txt @@ -0,0 +1,61 @@ +""" +....EA..A +......... +..B.C..D. +......... +E.B.F.... +G.....G.. +..F...... +D........ +.....C... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(5, 0) (8, 0) +(2, 4) (2, 2) +(4, 2) (5, 8) +(0, 7) (7, 2) +(0, 4) (4, 0) +(4, 4) (2, 6) +(6, 5) (0, 5) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEAAAA +EFFFFFCCC +EFBCCFCDC +EFBCFFCDC +EFBCFCCDC +GFFCCCGDC +GGFGGGGDC +DGGGDDDDC +DDDDDCCCC +""" + +## Raw solver output: +7 9 9 +(5, 0) (6, 0) (7, 0) (8, 0) +(2, 4) (2, 3) (2, 2) +(4, 2) (3, 2) (3, 3) (3, 4) (3, 5) (4, 5) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) +(0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(4, 4) (4, 3) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (2, 5) (2, 6) +(6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (3, 7) (2, 7) (1, 7) (1, 6) (0, 6) (0, 5) + +Touching forbidden +Nodes 100 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(5, 0) (8, 0) +(2, 4) (2, 2) +(4, 2) (5, 8) +(0, 7) (7, 2) +(0, 4) (4, 0) +(4, 4) (2, 6) +(6, 5) (0, 5) diff --git a/submodules/flowfree/generated/9x9_7c_1_e28dfc75.txt b/submodules/flowfree/generated/9x9_7c_1_e28dfc75.txt new file mode 100644 index 0000000000000000000000000000000000000000..271f1823001eb06202b958a024cea71ddaefb816 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_1_e28dfc75.txt @@ -0,0 +1,61 @@ +""" +......GDB +.F..FA... +......... +..C...... +....D.B.. +..C...... +...G..... +.E.....EA +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(5, 1) (8, 7) +(6, 4) (8, 0) +(2, 3) (2, 5) +(4, 4) (7, 0) +(1, 7) (7, 7) +(1, 1) (4, 1) +(6, 0) (3, 6) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAGDB +AFFFFAGDB +AGGGGGGDB +AGCBBBBDB +AGCBDDBDB +AGCBBDDDB +AGGGBBBBB +AEEEEEEEA +AAAAAAAAA +""" + +## Raw solver output: +7 9 9 +(5, 1) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) +(6, 4) (6, 3) (5, 3) (4, 3) (3, 3) (3, 4) (3, 5) (4, 5) (4, 6) (5, 6) (6, 6) (7, 6) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) +(2, 3) (2, 4) (2, 5) +(4, 4) (5, 4) (5, 5) (6, 5) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) +(1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) +(1, 1) (2, 1) (3, 1) (4, 1) +(6, 0) (6, 1) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (2, 6) (3, 6) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(5, 1) (8, 7) +(6, 4) (8, 0) +(2, 3) (2, 5) +(4, 4) (7, 0) +(1, 7) (7, 7) +(1, 1) (4, 1) +(6, 0) (3, 6) diff --git a/submodules/flowfree/generated/9x9_7c_2_056744a7.txt b/submodules/flowfree/generated/9x9_7c_2_056744a7.txt new file mode 100644 index 0000000000000000000000000000000000000000..350453231265396a990ecc0ca95e6a1fdd3c48c6 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_2_056744a7.txt @@ -0,0 +1,61 @@ +""" +....A...D +.FB...C.. +......E.. +ACG...... +......... +.....B... +..D.F.... +..G...E.. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(0, 3) (4, 0) +(5, 5) (2, 1) +(1, 3) (6, 1) +(2, 6) (8, 0) +(6, 2) (6, 7) +(4, 6) (1, 1) +(2, 3) (2, 7) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAADDDD +AFBBBDCCC +AFFFBDEEC +ACGFBDDEC +CCGFBBDEC +CGGFFBDEC +CGDDFDDEC +CGGDDDEEC +CCCCCCCCC +""" + +## Raw solver output: +7 9 9 +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(5, 5) (5, 4) (4, 4) (4, 3) (4, 2) (4, 1) (3, 1) (2, 1) +(1, 3) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (7, 1) (6, 1) +(2, 6) (3, 6) (3, 7) (4, 7) (5, 7) (5, 6) (6, 6) (6, 5) (6, 4) (6, 3) (5, 3) (5, 2) (5, 1) (5, 0) (6, 0) (7, 0) (8, 0) +(6, 2) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) +(4, 6) (4, 5) (3, 5) (3, 4) (3, 3) (3, 2) (2, 2) (1, 2) (1, 1) +(2, 3) (2, 4) (2, 5) (1, 5) (1, 6) (1, 7) (2, 7) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(0, 3) (4, 0) +(5, 5) (2, 1) +(1, 3) (6, 1) +(2, 6) (8, 0) +(6, 2) (6, 7) +(4, 6) (1, 1) +(2, 3) (2, 7) diff --git a/submodules/flowfree/generated/9x9_7c_2_fd249655.txt b/submodules/flowfree/generated/9x9_7c_2_fd249655.txt new file mode 100644 index 0000000000000000000000000000000000000000..bf3b15e8cd1925948ea12777a06d73590ca107b4 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_2_fd249655.txt @@ -0,0 +1,61 @@ +""" +.F....... +.......E. +....G.... +........D +......... +..A.....D +..EGA.F.B +.C.....C. +.......B. +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(2, 5) (4, 6) +(8, 6) (7, 8) +(7, 7) (1, 7) +(8, 3) (8, 5) +(7, 1) (2, 6) +(6, 6) (1, 0) +(3, 6) (4, 2) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFCCCCCCC +FCCAAAEEC +FCAAGAECC +FCAGGAECD +FCAGAAECD +FCAGAEECD +FCEGAEFCB +FCEEEEFCB +FFFFFFFBB +""" + +## Raw solver output: +7 9 9 +(2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (5, 4) (4, 4) (4, 5) (4, 6) +(8, 6) (8, 7) (8, 8) (7, 8) +(7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) +(8, 3) (8, 4) (8, 5) +(7, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (5, 5) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) +(6, 6) (6, 7) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) +(3, 6) (3, 5) (3, 4) (3, 3) (4, 3) (4, 2) + +Touching forbidden +Nodes 91 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(2, 5) (4, 6) +(8, 6) (7, 8) +(7, 7) (1, 7) +(8, 3) (8, 5) +(7, 1) (2, 6) +(6, 6) (1, 0) +(3, 6) (4, 2) diff --git a/submodules/flowfree/generated/9x9_7c_3_999b887c.txt b/submodules/flowfree/generated/9x9_7c_3_999b887c.txt new file mode 100644 index 0000000000000000000000000000000000000000..53fa504077c9d3c506191aa5f7c352563da96543 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_3_999b887c.txt @@ -0,0 +1,61 @@ +""" +......... +.A..D..D. +..E...... +F........ +....C.... +.F..E.BA. +GB.....G. +......... +........C +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(7, 5) (1, 1) +(6, 5) (1, 6) +(8, 8) (4, 4) +(7, 1) (4, 1) +(4, 5) (2, 2) +(1, 5) (0, 3) +(0, 6) (7, 6) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAAA +AAAADDDDA +AAEAAAAAA +FAEECCCCC +FAAECAAAC +FFAEEABAC +GBAAAABGC +GBBBBBBGC +GGGGGGGGC +""" + +## Raw solver output: +7 9 9 +(7, 5) (7, 4) (6, 4) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (7, 2) (6, 2) (5, 2) (4, 2) (3, 2) (3, 1) (2, 1) (1, 1) +(6, 5) (6, 6) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (1, 6) +(8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (7, 3) (6, 3) (5, 3) (4, 3) (4, 4) +(7, 1) (6, 1) (5, 1) (4, 1) +(4, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) +(1, 5) (0, 5) (0, 4) (0, 3) +(0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) + +Touching forbidden +Nodes 88 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(7, 5) (1, 1) +(6, 5) (1, 6) +(8, 8) (4, 4) +(7, 1) (4, 1) +(4, 5) (2, 2) +(1, 5) (0, 3) +(0, 6) (7, 6) diff --git a/submodules/flowfree/generated/9x9_7c_3_b3558dd5.txt b/submodules/flowfree/generated/9x9_7c_3_b3558dd5.txt new file mode 100644 index 0000000000000000000000000000000000000000..3aeb4acb2fdba9a33bf82b5414b265d0f942091b --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_3_b3558dd5.txt @@ -0,0 +1,61 @@ +""" +........G +....A.... +G.C...... +B...F.B.. +......... +.C.F..... +.D....E.E +..D..A... +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(5, 7) (4, 1) +(0, 3) (6, 3) +(2, 2) (1, 5) +(1, 6) (2, 7) +(6, 6) (8, 6) +(3, 5) (4, 3) +(8, 0) (0, 2) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGGGGGGG +GBBBAAAAA +GBCBFFFFA +BBCBFBBFA +CCCBBBFFA +CCCFFFFAA +CDCCEEEAE +CDDCEAAAE +CCCCEEEEE +""" + +## Raw solver output: +7 9 9 +(5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (7, 1) (6, 1) (5, 1) (4, 1) +(0, 3) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) (4, 4) (5, 4) (5, 3) (6, 3) +(2, 2) (2, 3) (2, 4) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (3, 7) (3, 6) (2, 6) (2, 5) (1, 5) +(1, 6) (1, 7) (2, 7) +(6, 6) (5, 6) (4, 6) (4, 7) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (7, 4) (7, 3) (7, 2) (6, 2) (5, 2) (4, 2) (4, 3) +(8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) + +Touching forbidden +Nodes 107 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(5, 7) (4, 1) +(0, 3) (6, 3) +(2, 2) (1, 5) +(1, 6) (2, 7) +(6, 6) (8, 6) +(3, 5) (4, 3) +(8, 0) (0, 2) diff --git a/submodules/flowfree/generated/9x9_7c_4_207aef04.txt b/submodules/flowfree/generated/9x9_7c_4_207aef04.txt new file mode 100644 index 0000000000000000000000000000000000000000..60781641bacb9225ebd6d49875b8bcbd17ee0835 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_4_207aef04.txt @@ -0,0 +1,61 @@ +""" +E......G. +B........ +.F..A.D.. +...B..... +......... +...C..D.. +......... +...E...C. +.F..AG... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(4, 8) (4, 2) +(3, 3) (0, 1) +(7, 7) (3, 5) +(6, 5) (6, 2) +(3, 7) (0, 0) +(1, 2) (1, 8) +(5, 8) (7, 0) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEEGG +BBBBBBEEG +FFAAABDEG +FAABBBDEG +FAEEEEDEG +FAECCEDEG +FAEECEEEG +FAAECCCCG +FFAAAGGGG +""" + +## Raw solver output: +7 9 9 +(4, 8) (3, 8) (2, 8) (2, 7) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (2, 3) (2, 2) (3, 2) (4, 2) +(3, 3) (4, 3) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (0, 1) +(7, 7) (6, 7) (5, 7) (4, 7) (4, 6) (4, 5) (3, 5) +(6, 5) (6, 4) (6, 3) (6, 2) +(3, 7) (3, 6) (2, 6) (2, 5) (2, 4) (3, 4) (4, 4) (5, 4) (5, 5) (5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(1, 2) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) +(5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(4, 8) (4, 2) +(3, 3) (0, 1) +(7, 7) (3, 5) +(6, 5) (6, 2) +(3, 7) (0, 0) +(1, 2) (1, 8) +(5, 8) (7, 0) diff --git a/submodules/flowfree/generated/9x9_7c_4_b67fe4d3.txt b/submodules/flowfree/generated/9x9_7c_4_b67fe4d3.txt new file mode 100644 index 0000000000000000000000000000000000000000..3d9bbe1dec75694b6304c1e3491b08017ab09349 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_4_b67fe4d3.txt @@ -0,0 +1,61 @@ +""" +...A....E +A....G... +......... +.B.E...D. +...F..... +.......G. +.B....D.. +....F...C +C........ +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(3, 0) (0, 1) +(1, 3) (1, 6) +(0, 8) (8, 7) +(6, 6) (7, 3) +(3, 3) (8, 0) +(3, 4) (4, 7) +(7, 5) (5, 1) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAADDDDE +ADDDDGGDE +DDDDDDGDE +DBDEEDGDE +DBDFEDGGE +DBDFEDDGE +DBDFEEDEE +DDDFFEEEC +CCCCCCCCC +""" + +## Raw solver output: +7 9 9 +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(1, 3) (1, 4) (1, 5) (1, 6) +(0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) +(6, 6) (6, 5) (5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (7, 1) (7, 2) (7, 3) +(3, 3) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) (5, 7) (6, 7) (7, 7) (7, 6) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) +(3, 4) (3, 5) (3, 6) (3, 7) (4, 7) +(7, 5) (7, 4) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) + +Touching forbidden +Nodes 180 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(3, 0) (0, 1) +(1, 3) (1, 6) +(0, 8) (8, 7) +(6, 6) (7, 3) +(3, 3) (8, 0) +(3, 4) (4, 7) +(7, 5) (5, 1) diff --git a/submodules/flowfree/generated/9x9_7c_5_297ba08d.txt b/submodules/flowfree/generated/9x9_7c_5_297ba08d.txt new file mode 100644 index 0000000000000000000000000000000000000000..9ca887b7d5263d95a7753507f302e1cfc105db53 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_5_297ba08d.txt @@ -0,0 +1,61 @@ +""" +......... +......... +......B.. +C.......C +..B.A.... +..E.F.... +..A...D.. +.....D... +...G.EF.G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(4, 4) (2, 6) +(6, 2) (2, 4) +(0, 3) (8, 3) +(6, 6) (5, 7) +(2, 5) (5, 8) +(4, 5) (6, 8) +(3, 8) (8, 8) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCCC +CGGGGGGGC +CGBBBBBGC +CGBFFFFGC +GGBFAAFGG +GEEFFAFFG +GEAAAADFG +GEEEEDDFG +GGGGEEFFG +""" + +## Raw solver output: +7 9 9 +(4, 4) (5, 4) (5, 5) (5, 6) (4, 6) (3, 6) (2, 6) +(6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) +(6, 6) (6, 7) (5, 7) +(2, 5) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (4, 8) (5, 8) +(4, 5) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) (6, 3) (6, 4) (6, 5) (7, 5) (7, 6) (7, 7) (7, 8) (6, 8) +(3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(4, 4) (2, 6) +(6, 2) (2, 4) +(0, 3) (8, 3) +(6, 6) (5, 7) +(2, 5) (5, 8) +(4, 5) (6, 8) +(3, 8) (8, 8) diff --git a/submodules/flowfree/generated/9x9_7c_5_64e8fc42.txt b/submodules/flowfree/generated/9x9_7c_5_64e8fc42.txt new file mode 100644 index 0000000000000000000000000000000000000000..fb7632ca3a42a6fde2b6c265626e3ee9be3a8b51 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_5_64e8fc42.txt @@ -0,0 +1,61 @@ +""" +.....A... +.GD...... +..G.....A +.B....... +....CB.E. +........C +.E......D +......... +F.......F +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(8, 2) (5, 0) +(5, 4) (1, 3) +(8, 5) (4, 4) +(8, 6) (2, 1) +(7, 4) (1, 6) +(8, 8) (0, 8) +(2, 2) (1, 1) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCAAAA +CGDDCCCCA +CGGDDDDCA +CBBBBBDCC +CCCCCBDEC +DDDDDDDEC +DEEEEEEED +DDDDDDDDD +FFFFFFFFF +""" + +## Raw solver output: +7 9 9 +(8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) +(5, 4) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) +(8, 5) (8, 4) (8, 3) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1, 4) (2, 4) (3, 4) (4, 4) +(8, 6) (8, 7) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (3, 1) (2, 1) +(7, 4) (7, 5) (7, 6) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (1, 6) +(8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) +(2, 2) (1, 2) (1, 1) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(8, 2) (5, 0) +(5, 4) (1, 3) +(8, 5) (4, 4) +(8, 6) (2, 1) +(7, 4) (1, 6) +(8, 8) (0, 8) +(2, 2) (1, 1) diff --git a/submodules/flowfree/generated/9x9_7c_6_8fa5441c.txt b/submodules/flowfree/generated/9x9_7c_6_8fa5441c.txt new file mode 100644 index 0000000000000000000000000000000000000000..2464c366a997121b906ccb2788495eff8fa663dd --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_6_8fa5441c.txt @@ -0,0 +1,61 @@ +""" +..BF....G +.....C... +.F....EC. +...DA...E +G....A... +.....D.B. +......... +......... +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(5, 4) (4, 3) +(2, 0) (7, 5) +(7, 2) (5, 1) +(3, 3) (5, 5) +(6, 2) (8, 3) +(1, 2) (3, 0) +(8, 0) (0, 4) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBFGGGGG +BFFFGCEEE +BFGGGCECE +BBGDACCCE +GBGDAAGGG +GBGDDDGBG +GBGGGGGBG +GBBBBBBBG +GGGGGGGGG +""" + +## Raw solver output: +7 9 9 +(5, 4) (4, 4) (4, 3) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) +(7, 2) (7, 3) (6, 3) (5, 3) (5, 2) (5, 1) +(3, 3) (3, 4) (3, 5) (4, 5) (5, 5) +(6, 2) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) +(1, 2) (1, 1) (2, 1) (3, 1) (3, 0) +(8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6) (6, 5) (6, 4) (7, 4) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) + +Touching forbidden +Nodes 85 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(5, 4) (4, 3) +(2, 0) (7, 5) +(7, 2) (5, 1) +(3, 3) (5, 5) +(6, 2) (8, 3) +(1, 2) (3, 0) +(8, 0) (0, 4) diff --git a/submodules/flowfree/generated/9x9_7c_6_d4cb8ca8.txt b/submodules/flowfree/generated/9x9_7c_6_d4cb8ca8.txt new file mode 100644 index 0000000000000000000000000000000000000000..0fbe24094a461008666fa2c409986eb07557bb6f --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_6_d4cb8ca8.txt @@ -0,0 +1,61 @@ +""" +...G....A +.B......C +..DE..... +......... +......G.. +....E...C +F.B...ADF +......... +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(6, 6) (8, 0) +(1, 1) (2, 6) +(8, 1) (8, 5) +(2, 2) (7, 6) +(4, 5) (3, 2) +(8, 6) (0, 6) +(3, 0) (6, 4) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDGGGGAA +DBDDDDGAC +DBDEEDGAC +DBDDEDGAC +DBBDEDGAC +DDBDEDAAC +FDBDDDADF +FDDDDDDDF +FFFFFFFFF +""" + +## Raw solver output: +7 9 9 +(6, 6) (6, 5) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (8, 0) +(1, 1) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) (2, 6) +(8, 1) (8, 2) (8, 3) (8, 4) (8, 5) +(2, 2) (2, 3) (3, 3) (3, 4) (3, 5) (3, 6) (4, 6) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) +(4, 5) (4, 4) (4, 3) (4, 2) (3, 2) +(8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) +(3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (6, 4) + +Touching forbidden +Nodes 98 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(6, 6) (8, 0) +(1, 1) (2, 6) +(8, 1) (8, 5) +(2, 2) (7, 6) +(4, 5) (3, 2) +(8, 6) (0, 6) +(3, 0) (6, 4) diff --git a/submodules/flowfree/generated/9x9_7c_7_126ff9b4.txt b/submodules/flowfree/generated/9x9_7c_7_126ff9b4.txt new file mode 100644 index 0000000000000000000000000000000000000000..78460b9fa195d2ef92c3bfe77d618382bdbb3078 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_7_126ff9b4.txt @@ -0,0 +1,61 @@ +""" +...FG.... +..E....A. +.EF.B.... +.D....... +.....C.B. +......... +......... +.D......C +......A.G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(7, 1) (6, 8) +(4, 2) (7, 4) +(5, 4) (8, 7) +(1, 3) (1, 7) +(2, 1) (1, 2) +(2, 2) (3, 0) +(4, 0) (8, 8) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFGGGGG +FEEAAAAAG +FEFABBBBG +FDFAGGGBG +FDFAGCGBG +FDFAGCGGG +FDFAGCCCC +FDFAGGGGC +FFFAAAAGG +""" + +## Raw solver output: +7 9 9 +(7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (3, 6) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) +(4, 2) (5, 2) (6, 2) (7, 2) (7, 3) (7, 4) +(5, 4) (5, 5) (5, 6) (6, 6) (7, 6) (8, 6) (8, 7) +(1, 3) (1, 4) (1, 5) (1, 6) (1, 7) +(2, 1) (1, 1) (1, 2) +(2, 2) (2, 3) (2, 4) (2, 5) (2, 6) (2, 7) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (7, 5) (6, 5) (6, 4) (6, 3) (5, 3) (4, 3) (4, 4) (4, 5) (4, 6) (4, 7) (5, 7) (6, 7) (7, 7) (7, 8) (8, 8) + +Touching forbidden +Nodes 238 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(7, 1) (6, 8) +(4, 2) (7, 4) +(5, 4) (8, 7) +(1, 3) (1, 7) +(2, 1) (1, 2) +(2, 2) (3, 0) +(4, 0) (8, 8) diff --git a/submodules/flowfree/generated/9x9_7c_7_dce8ae70.txt b/submodules/flowfree/generated/9x9_7c_7_dce8ae70.txt new file mode 100644 index 0000000000000000000000000000000000000000..264a65bfbd428d233a44519d9201f692931ab3a1 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_7_dce8ae70.txt @@ -0,0 +1,61 @@ +""" +....FG... +.......B. +.AE..D... +...C..... +..DE..... +......... +..A...... +......C.. +.FB.....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(1, 2) (2, 6) +(2, 8) (7, 1) +(3, 3) (6, 7) +(2, 4) (5, 2) +(2, 2) (3, 4) +(1, 8) (4, 0) +(8, 8) (5, 0) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFGGGG +FAAAAAABG +FAEEEDABG +FCCCEDABG +FCDEEDABG +FCDDDDABG +FCAAAAABG +FCCCCCCBG +FFBBBBBBG +""" + +## Raw solver output: +7 9 9 +(1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) +(2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) +(3, 3) (2, 3) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) +(2, 4) (2, 5) (3, 5) (4, 5) (5, 5) (5, 4) (5, 3) (5, 2) +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (3, 4) +(1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) + +Touching forbidden +Nodes 97 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(1, 2) (2, 6) +(2, 8) (7, 1) +(3, 3) (6, 7) +(2, 4) (5, 2) +(2, 2) (3, 4) +(1, 8) (4, 0) +(8, 8) (5, 0) diff --git a/submodules/flowfree/generated/9x9_7c_8_72f89e8a.txt b/submodules/flowfree/generated/9x9_7c_8_72f89e8a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c519f467b3e97b76e1e5238bf5d9a295b3b31a67 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_8_72f89e8a.txt @@ -0,0 +1,61 @@ +""" +....F.... +..E..AFB. +..A...... +...E..... +.GD...... +......B.. +.DG..C... +.......C. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(2, 2) (5, 1) +(6, 5) (7, 1) +(7, 7) (5, 6) +(1, 6) (2, 4) +(3, 3) (2, 1) +(6, 1) (4, 0) +(2, 6) (1, 4) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAFAAAA +AEEAFAFBA +AEAAFFFBA +AEEEBBBBA +AGDDBCCCA +AGGDBCBCA +ADGDBCBCA +ADDDBBBCA +AAAAAAAAA +""" + +## Raw solver output: +7 9 9 +(2, 2) (3, 2) (3, 1) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (5, 1) +(6, 5) (6, 6) (6, 7) (5, 7) (4, 7) (4, 6) (4, 5) (4, 4) (4, 3) (5, 3) (6, 3) (7, 3) (7, 2) (7, 1) +(7, 7) (7, 6) (7, 5) (7, 4) (6, 4) (5, 4) (5, 5) (5, 6) +(1, 6) (1, 7) (2, 7) (3, 7) (3, 6) (3, 5) (3, 4) (2, 4) +(3, 3) (2, 3) (1, 3) (1, 2) (1, 1) (2, 1) +(6, 1) (6, 2) (5, 2) (4, 2) (4, 1) (4, 0) +(2, 6) (2, 5) (1, 5) (1, 4) + +Touching forbidden +Nodes 188 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(2, 2) (5, 1) +(6, 5) (7, 1) +(7, 7) (5, 6) +(1, 6) (2, 4) +(3, 3) (2, 1) +(6, 1) (4, 0) +(2, 6) (1, 4) diff --git a/submodules/flowfree/generated/9x9_7c_8_bb2794e7.txt b/submodules/flowfree/generated/9x9_7c_8_bb2794e7.txt new file mode 100644 index 0000000000000000000000000000000000000000..6774244601bb394534a456dcd7fb6ab758e5dddc --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_8_bb2794e7.txt @@ -0,0 +1,61 @@ +""" +.EA....CG +E........ +D....F... +...A..... +....B.... +......CB. +......... +.....G... +...D....F +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(2, 0) (3, 3) +(7, 5) (4, 4) +(7, 0) (6, 5) +(3, 8) (0, 2) +(1, 0) (0, 1) +(8, 8) (5, 2) +(8, 0) (5, 7) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEAAAAACG +EFFFFFACG +DFBBBFACG +DFBABAACG +DFBABACCG +DFBAAACBG +DFBBBBBBG +DFFFFGGGG +DDDDFFFFF +""" + +## Raw solver output: +7 9 9 +(2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (3, 4) (3, 3) +(7, 5) (7, 6) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 3) (4, 4) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (6, 5) +(3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(1, 0) (0, 0) (0, 1) +(8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) +(8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (7, 7) (6, 7) (5, 7) + +Touching forbidden +Nodes 99 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(2, 0) (3, 3) +(7, 5) (4, 4) +(7, 0) (6, 5) +(3, 8) (0, 2) +(1, 0) (0, 1) +(8, 8) (5, 2) +(8, 0) (5, 7) diff --git a/submodules/flowfree/generated/9x9_7c_9_a6b69ac4.txt b/submodules/flowfree/generated/9x9_7c_9_a6b69ac4.txt new file mode 100644 index 0000000000000000000000000000000000000000..d23705dc310ba5ecd01f645c79ab8de4577baf51 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_9_a6b69ac4.txt @@ -0,0 +1,61 @@ +""" +...C..... +.G..D.... +....E.FD. +.......F. +....E.AC. +.......B. +.......G. +......... +..AB..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(6, 4) (2, 8) +(7, 5) (3, 8) +(7, 4) (3, 0) +(7, 2) (4, 1) +(4, 2) (4, 4) +(7, 3) (6, 2) +(1, 1) (7, 6) + + param line: 7 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAACCCCCC +AGADDDDDC +AGADEDFDC +AGADEDFFC +AGADEDACC +AGADDDABB +AGAAAAAGB +AGGGGGGGB +AAABBBBBB +""" + +## Raw solver output: +7 9 9 +(6, 4) (6, 5) (6, 6) (5, 6) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) +(7, 5) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) +(7, 4) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) +(7, 2) (7, 1) (6, 1) (5, 1) (5, 2) (5, 3) (5, 4) (5, 5) (4, 5) (3, 5) (3, 4) (3, 3) (3, 2) (3, 1) (4, 1) +(4, 2) (4, 3) (4, 4) +(7, 3) (6, 3) (6, 2) +(1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(6, 4) (2, 8) +(7, 5) (3, 8) +(7, 4) (3, 0) +(7, 2) (4, 1) +(4, 2) (4, 4) +(7, 3) (6, 2) +(1, 1) (7, 6) diff --git a/submodules/flowfree/generated/9x9_7c_9_d3ff1418.txt b/submodules/flowfree/generated/9x9_7c_9_d3ff1418.txt new file mode 100644 index 0000000000000000000000000000000000000000..dd8f6fbcfb70dd9a620e5c0dd98172eed441b477 --- /dev/null +++ b/submodules/flowfree/generated/9x9_7c_9_d3ff1418.txt @@ -0,0 +1,61 @@ +""" +...EA..B. +.C....... +...CD.... +.....G... +..F...... +....D.... +...AG.... +.F..E.... +........B +""" + +# ---- raw puzzle block (for reproducibility) ---- +7 9 9 +(3, 6) (4, 0) +(7, 0) (8, 8) +(3, 2) (1, 1) +(4, 5) (4, 2) +(4, 7) (3, 0) +(1, 7) (2, 4) +(4, 6) (5, 3) + + param line: 7 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCEAAABB +CCCEEEAAB +CCCCDEEAB +CCCCDGEAB +CFFCDGEAB +CFCCDGEAB +CFCAGGEAB +CFCAEEEAB +CCCAAAAAB +""" + +## Raw solver output: +7 9 9 +(3, 6) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (6, 0) (5, 0) (4, 0) +(7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) +(3, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (2, 7) (2, 6) (2, 5) (3, 5) (3, 4) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) +(4, 5) (4, 4) (4, 3) (4, 2) +(4, 7) (5, 7) (6, 7) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (5, 1) (4, 1) (3, 1) (3, 0) +(1, 7) (1, 6) (1, 5) (1, 4) (2, 4) +(4, 6) (5, 6) (5, 5) (5, 4) (5, 3) + +Touching forbidden +Nodes 158 +Solutions 1 + +## Solver input (raw puzzle block): +7 9 9 +(3, 6) (4, 0) +(7, 0) (8, 8) +(3, 2) (1, 1) +(4, 5) (4, 2) +(4, 7) (3, 0) +(1, 7) (2, 4) +(4, 6) (5, 3) diff --git a/submodules/flowfree/generated/9x9_8c_10_2471bb38.txt b/submodules/flowfree/generated/9x9_8c_10_2471bb38.txt new file mode 100644 index 0000000000000000000000000000000000000000..b56228caf99cef45b8e60dd87a90847b7838f76f --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_10_2471bb38.txt @@ -0,0 +1,64 @@ +""" +........D +.E...F..A +......... +A..BG.... +E..C...D. +......... +.GC...... +.....H.H. +.FB...... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(8, 1) (0, 3) +(2, 8) (3, 3) +(2, 6) (3, 4) +(7, 4) (8, 0) +(1, 1) (0, 4) +(1, 8) (5, 1) +(1, 6) (4, 3) +(5, 7) (7, 7) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAADD +AEFFFFADA +AEFBBBADA +AEFBGBADA +EEFCGBADA +FFFCGBAAA +FGCCGBBBB +FGGGGHHHB +FFBBBBBBB +""" + +## Raw solver output: +8 9 9 +(8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (7, 5) (6, 5) (6, 4) (6, 3) (6, 2) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (7, 6) (6, 6) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (4, 2) (3, 2) (3, 3) +(2, 6) (3, 6) (3, 5) (3, 4) +(7, 4) (7, 3) (7, 2) (7, 1) (7, 0) (8, 0) +(1, 1) (1, 2) (1, 3) (1, 4) (0, 4) +(1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (1, 5) (2, 5) (2, 4) (2, 3) (2, 2) (2, 1) (3, 1) (4, 1) (5, 1) +(1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (4, 4) (4, 3) +(5, 7) (6, 7) (7, 7) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(8, 1) (0, 3) +(2, 8) (3, 3) +(2, 6) (3, 4) +(7, 4) (8, 0) +(1, 1) (0, 4) +(1, 8) (5, 1) +(1, 6) (4, 3) +(5, 7) (7, 7) diff --git a/submodules/flowfree/generated/9x9_8c_10_3e7e1f61.txt b/submodules/flowfree/generated/9x9_8c_10_3e7e1f61.txt new file mode 100644 index 0000000000000000000000000000000000000000..8f670adc002e5c91baf7451cfdae2441e200f8f2 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_10_3e7e1f61.txt @@ -0,0 +1,64 @@ +""" +....BE... +.A..E..F. +......G.. +......... +...B.D... +......... +C..D..H.. +....A..FG +C.......H +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(4, 7) (1, 1) +(3, 4) (4, 0) +(0, 6) (0, 8) +(5, 4) (3, 6) +(4, 1) (5, 0) +(7, 7) (7, 1) +(6, 2) (8, 7) +(8, 8) (6, 6) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDBBEGGG +DADBEEGFG +DADBBBGFG +DADDDBBFG +DAABDDBFG +DDABBBBFG +CDADDDHFG +CDAAADHFG +CDDDDDHHH +""" + +## Raw solver output: +8 9 9 +(4, 7) (3, 7) (2, 7) (2, 6) (2, 5) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) +(3, 4) (3, 5) (4, 5) (5, 5) (6, 5) (6, 4) (6, 3) (5, 3) (5, 2) (4, 2) (3, 2) (3, 1) (3, 0) (4, 0) +(0, 6) (0, 7) (0, 8) +(5, 4) (4, 4) (4, 3) (3, 3) (2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (1, 5) (1, 6) (1, 7) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (5, 7) (5, 6) (4, 6) (3, 6) +(4, 1) (5, 1) (5, 0) +(7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) +(6, 2) (6, 1) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) +(8, 8) (7, 8) (6, 8) (6, 7) (6, 6) + +Touching forbidden +Nodes 125 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(4, 7) (1, 1) +(3, 4) (4, 0) +(0, 6) (0, 8) +(5, 4) (3, 6) +(4, 1) (5, 0) +(7, 7) (7, 1) +(6, 2) (8, 7) +(8, 8) (6, 6) diff --git a/submodules/flowfree/generated/9x9_8c_1_306fbd00.txt b/submodules/flowfree/generated/9x9_8c_1_306fbd00.txt new file mode 100644 index 0000000000000000000000000000000000000000..24a0957e5ef18f58d2ff94fab74c2dd2399f5509 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_1_306fbd00.txt @@ -0,0 +1,64 @@ +""" +.....B... +H......G. +..A.....B +....F..GD +E......H. +...E..... +.DF...A.. +....C..C. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(2, 2) (6, 6) +(5, 0) (8, 2) +(7, 7) (4, 7) +(1, 6) (8, 3) +(0, 4) (3, 5) +(2, 6) (4, 3) +(7, 3) (7, 1) +(7, 4) (0, 1) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHHHHBBBB +HEEEHHHGB +EEAEEEHGB +EAAFFEHGD +EAFFEEHHD +AAFEEDDDD +ADFDDDAAA +ADDDCCCCA +AAAAAAAAA +""" + +## Raw solver output: +8 9 9 +(2, 2) (2, 3) (1, 3) (1, 4) (1, 5) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (7, 6) (6, 6) +(5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) +(7, 7) (6, 7) (5, 7) (4, 7) +(1, 6) (1, 7) (2, 7) (3, 7) (3, 6) (4, 6) (5, 6) (5, 5) (6, 5) (7, 5) (8, 5) (8, 4) (8, 3) +(0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (4, 2) (5, 2) (5, 3) (5, 4) (4, 4) (4, 5) (3, 5) +(2, 6) (2, 5) (2, 4) (3, 4) (3, 3) (4, 3) +(7, 3) (7, 2) (7, 1) +(7, 4) (6, 4) (6, 3) (6, 2) (6, 1) (5, 1) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(2, 2) (6, 6) +(5, 0) (8, 2) +(7, 7) (4, 7) +(1, 6) (8, 3) +(0, 4) (3, 5) +(2, 6) (4, 3) +(7, 3) (7, 1) +(7, 4) (0, 1) diff --git a/submodules/flowfree/generated/9x9_8c_1_55c4888b.txt b/submodules/flowfree/generated/9x9_8c_1_55c4888b.txt new file mode 100644 index 0000000000000000000000000000000000000000..d9ccf0713304703974d393d9f0afe628a30e8bfc --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_1_55c4888b.txt @@ -0,0 +1,64 @@ +""" +C........ +.......G. +.....H.C. +..F..D.E. +.......H. +.FB...... +.......A. +.B...D..A +......G.E +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(7, 6) (8, 7) +(1, 7) (2, 5) +(0, 0) (7, 2) +(5, 7) (5, 3) +(7, 3) (8, 8) +(2, 3) (1, 5) +(6, 8) (7, 1) +(5, 2) (7, 4) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCCC +GGGGGGGGC +GBBBBHHCC +GBFFBDHEE +GBBFBDHHE +GFBFBDEEE +GFFFBDEAA +GBBBBDEEA +GGGGGGGEE +""" + +## Raw solver output: +8 9 9 +(7, 6) (8, 6) (8, 7) +(1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (4, 4) (4, 3) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (7, 2) +(5, 7) (5, 6) (5, 5) (5, 4) (5, 3) +(7, 3) (8, 3) (8, 4) (8, 5) (7, 5) (6, 5) (6, 6) (6, 7) (7, 7) (7, 8) (8, 8) +(2, 3) (3, 3) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) (1, 5) +(6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) +(5, 2) (6, 2) (6, 3) (6, 4) (7, 4) + +Touching forbidden +Nodes 122 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(7, 6) (8, 7) +(1, 7) (2, 5) +(0, 0) (7, 2) +(5, 7) (5, 3) +(7, 3) (8, 8) +(2, 3) (1, 5) +(6, 8) (7, 1) +(5, 2) (7, 4) diff --git a/submodules/flowfree/generated/9x9_8c_2_b69f748c.txt b/submodules/flowfree/generated/9x9_8c_2_b69f748c.txt new file mode 100644 index 0000000000000000000000000000000000000000..472244f699564d10ec1d637461bf7dcb40a36930 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_2_b69f748c.txt @@ -0,0 +1,64 @@ +""" +...H..... +H........ +F.A..BD.. +..B..D..E +..E...G.. +.....G.C. +..A..C... +........F +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(2, 2) (2, 6) +(2, 3) (5, 2) +(7, 5) (5, 6) +(5, 3) (6, 2) +(2, 4) (8, 3) +(8, 7) (0, 2) +(6, 4) (5, 5) +(0, 1) (3, 0) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHHHEEEEE +HEEEEBBBE +FEAAABDBE +FEBBADDBE +FEEBAGGBB +FBBBAGCCB +FBAAACCBB +FBBBBBBBF +FFFFFFFFF +""" + +## Raw solver output: +8 9 9 +(2, 2) (3, 2) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (3, 6) (2, 6) +(2, 3) (3, 3) (3, 4) (3, 5) (2, 5) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (8, 6) (8, 5) (8, 4) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (5, 2) +(7, 5) (6, 5) (6, 6) (5, 6) +(5, 3) (6, 3) (6, 2) +(2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) +(8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) +(6, 4) (5, 4) (5, 5) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(2, 2) (2, 6) +(2, 3) (5, 2) +(7, 5) (5, 6) +(5, 3) (6, 2) +(2, 4) (8, 3) +(8, 7) (0, 2) +(6, 4) (5, 5) +(0, 1) (3, 0) diff --git a/submodules/flowfree/generated/9x9_8c_2_f539b23a.txt b/submodules/flowfree/generated/9x9_8c_2_f539b23a.txt new file mode 100644 index 0000000000000000000000000000000000000000..d124c498cb2bcc8e0028f89db0cabfa15bcfc89e --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_2_f539b23a.txt @@ -0,0 +1,64 @@ +""" +G.BH..... +..C...... +..B...EA. +......AD. +F........ +......... +..C.E.... +......... +.F..GD.H. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(6, 3) (7, 2) +(2, 0) (2, 2) +(2, 6) (2, 1) +(7, 3) (5, 8) +(4, 6) (6, 2) +(1, 8) (0, 4) +(0, 0) (4, 8) +(3, 0) (7, 8) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GBBHHHHHH +GBCCAAAAH +GBBCAEEAH +GGCCAEADH +FGCAAEADH +FGCAEEADH +FGCAEAADH +FGGAAADDH +FFGGGDDHH +""" + +## Raw solver output: +8 9 9 +(6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (5, 7) (4, 7) (3, 7) (3, 6) (3, 5) (3, 4) (4, 4) (4, 3) (4, 2) (4, 1) (5, 1) (6, 1) (7, 1) (7, 2) +(2, 0) (1, 0) (1, 1) (1, 2) (2, 2) +(2, 6) (2, 5) (2, 4) (2, 3) (3, 3) (3, 2) (3, 1) (2, 1) +(7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (6, 8) (5, 8) +(4, 6) (4, 5) (5, 5) (5, 4) (5, 3) (5, 2) (6, 2) +(1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) +(0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (2, 8) (3, 8) (4, 8) +(3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(6, 3) (7, 2) +(2, 0) (2, 2) +(2, 6) (2, 1) +(7, 3) (5, 8) +(4, 6) (6, 2) +(1, 8) (0, 4) +(0, 0) (4, 8) +(3, 0) (7, 8) diff --git a/submodules/flowfree/generated/9x9_8c_3_01959e84.txt b/submodules/flowfree/generated/9x9_8c_3_01959e84.txt new file mode 100644 index 0000000000000000000000000000000000000000..3e51e0f46dd8a74d1ca571bd272b8625342291a0 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_3_01959e84.txt @@ -0,0 +1,64 @@ +""" +C........ +......... +......... +.....G.F. +...HB..E. +......... +F.BHGE.A. +D.....CD. +........A +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(7, 6) (8, 8) +(2, 6) (4, 4) +(6, 7) (0, 0) +(7, 7) (0, 7) +(7, 4) (5, 6) +(7, 3) (0, 6) +(4, 6) (5, 3) +(3, 4) (3, 6) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCCCCCCCC +FFFFFFFFC +FEEEEEEFC +FEBBBGEFC +FEBHBGEEC +FEBHGGCCC +FEBHGECAA +DEEEEECDA +DDDDDDDDA +""" + +## Raw solver output: +8 9 9 +(7, 6) (8, 6) (8, 7) (8, 8) +(2, 6) (2, 5) (2, 4) (2, 3) (3, 3) (4, 3) (4, 4) +(6, 7) (6, 6) (6, 5) (7, 5) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(7, 7) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) +(7, 4) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) +(7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(4, 6) (4, 5) (5, 5) (5, 4) (5, 3) +(3, 4) (3, 5) (3, 6) + +Touching forbidden +Nodes 99 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(7, 6) (8, 8) +(2, 6) (4, 4) +(6, 7) (0, 0) +(7, 7) (0, 7) +(7, 4) (5, 6) +(7, 3) (0, 6) +(4, 6) (5, 3) +(3, 4) (3, 6) diff --git a/submodules/flowfree/generated/9x9_8c_3_21bd5b1f.txt b/submodules/flowfree/generated/9x9_8c_3_21bd5b1f.txt new file mode 100644 index 0000000000000000000000000000000000000000..41f3c3ea32703d04c61d78b26f641c4003b9aaa9 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_3_21bd5b1f.txt @@ -0,0 +1,64 @@ +""" +..HCE..FE +.G....... +.H......D +.....F..A +.B....... +...D..... +.....B... +......C.. +..G.....A +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(8, 3) (8, 8) +(1, 4) (5, 6) +(6, 7) (3, 0) +(3, 5) (8, 2) +(4, 0) (8, 0) +(7, 0) (5, 3) +(2, 8) (1, 1) +(2, 0) (1, 2) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHHCEFFFE +HGGCEFEEE +HHGCEFEDD +GGGCEFEDA +GBCCEEEDA +GBCDDDDDA +GBCCCBBBA +GBBBCCCBA +GGGBBBBBA +""" + +## Raw solver output: +8 9 9 +(8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) +(1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) (6, 6) (5, 6) +(6, 7) (5, 7) (4, 7) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (3, 4) (3, 3) (3, 2) (3, 1) (3, 0) +(3, 5) (4, 5) (5, 5) (6, 5) (7, 5) (7, 4) (7, 3) (7, 2) (8, 2) +(4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (7, 1) (8, 1) (8, 0) +(7, 0) (6, 0) (5, 0) (5, 1) (5, 2) (5, 3) +(2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (1, 3) (2, 3) (2, 2) (2, 1) (1, 1) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (1, 2) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(8, 3) (8, 8) +(1, 4) (5, 6) +(6, 7) (3, 0) +(3, 5) (8, 2) +(4, 0) (8, 0) +(7, 0) (5, 3) +(2, 8) (1, 1) +(2, 0) (1, 2) diff --git a/submodules/flowfree/generated/9x9_8c_4_36602eab.txt b/submodules/flowfree/generated/9x9_8c_4_36602eab.txt new file mode 100644 index 0000000000000000000000000000000000000000..91f5afc24920b61b719005f76ebb24009601e8f3 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_4_36602eab.txt @@ -0,0 +1,64 @@ +""" +D........ +E...B.... +..H....B. +.G...E.C. +..A...... +........D +..HA...F. +.......CF +........G +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(3, 6) (2, 4) +(7, 2) (4, 1) +(7, 7) (7, 3) +(0, 0) (8, 5) +(0, 1) (5, 3) +(8, 7) (7, 6) +(1, 3) (8, 8) +(2, 6) (2, 2) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDDDD +EGGGBBBBD +EGHGGGGBD +EGHHEEGCD +EAAHEGGCD +EAHHEGCCD +EAHAEGCFF +EAAAEGCCF +EEEEEGGGG +""" + +## Raw solver output: +8 9 9 +(3, 6) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (1, 4) (2, 4) +(7, 2) (7, 1) (6, 1) (5, 1) (4, 1) +(7, 7) (6, 7) (6, 6) (6, 5) (7, 5) (7, 4) (7, 3) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) +(0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (4, 7) (4, 6) (4, 5) (4, 4) (4, 3) (5, 3) +(8, 7) (8, 6) (7, 6) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (4, 2) (5, 2) (6, 2) (6, 3) (6, 4) (5, 4) (5, 5) (5, 6) (5, 7) (5, 8) (6, 8) (7, 8) (8, 8) +(2, 6) (2, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) + +Touching forbidden +Nodes 122 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(3, 6) (2, 4) +(7, 2) (4, 1) +(7, 7) (7, 3) +(0, 0) (8, 5) +(0, 1) (5, 3) +(8, 7) (7, 6) +(1, 3) (8, 8) +(2, 6) (2, 2) diff --git a/submodules/flowfree/generated/9x9_8c_4_a50e0622.txt b/submodules/flowfree/generated/9x9_8c_4_a50e0622.txt new file mode 100644 index 0000000000000000000000000000000000000000..ed1cd07ef02969a38d180061efc29d89fc60f444 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_4_a50e0622.txt @@ -0,0 +1,64 @@ +""" +D.......D +...GE...E +......... +..H.....C +......... +.......B. +.BA...C.. +...GA.... +F.FH..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(2, 6) (4, 7) +(1, 6) (7, 5) +(8, 3) (6, 6) +(8, 0) (0, 0) +(8, 1) (4, 1) +(0, 8) (2, 8) +(3, 7) (3, 1) +(3, 8) (2, 3) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDDDD +GGGGEEEEE +GCCCCCCCC +GCHHHHHHC +GCCCCCCHH +GBBBBBCBH +GBAAABCBH +GGGGABBBH +FFFHHHHHH +""" + +## Raw solver output: +8 9 9 +(2, 6) (3, 6) (4, 6) (4, 7) +(1, 6) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (5, 6) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) +(8, 3) (8, 2) (7, 2) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (6, 5) (6, 6) +(8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) +(8, 1) (7, 1) (6, 1) (5, 1) (4, 1) +(0, 8) (1, 8) (2, 8) +(3, 7) (2, 7) (1, 7) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (1, 1) (2, 1) (3, 1) +(3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (7, 4) (7, 3) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(2, 6) (4, 7) +(1, 6) (7, 5) +(8, 3) (6, 6) +(8, 0) (0, 0) +(8, 1) (4, 1) +(0, 8) (2, 8) +(3, 7) (3, 1) +(3, 8) (2, 3) diff --git a/submodules/flowfree/generated/9x9_8c_5_2af3ded9.txt b/submodules/flowfree/generated/9x9_8c_5_2af3ded9.txt new file mode 100644 index 0000000000000000000000000000000000000000..6d234c9cfa322ed0b6b651846849fa4385e0653a --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_5_2af3ded9.txt @@ -0,0 +1,64 @@ +""" +....F.... +.B.F..E.A +.....C... +.....G... +.D.GH..C. +.....B... +..E.H...D +......... +.A....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(8, 1) (1, 8) +(5, 5) (1, 1) +(7, 4) (5, 2) +(1, 4) (8, 6) +(6, 1) (2, 6) +(4, 0) (3, 1) +(5, 3) (3, 4) +(4, 4) (4, 6) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAFFAAAA +ABAFAAEEA +ABAAACCEE +ABBGGGCCE +ADBGHHHCE +ADBBBBHEE +ADEEHHHED +ADDEEEEED +AADDDDDDD +""" + +## Raw solver output: +8 9 9 +(8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (5, 1) (4, 1) (4, 2) (3, 2) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) +(5, 5) (4, 5) (3, 5) (2, 5) (2, 4) (2, 3) (1, 3) (1, 2) (1, 1) +(7, 4) (7, 3) (6, 3) (6, 2) (5, 2) +(1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) +(6, 1) (7, 1) (7, 2) (8, 2) (8, 3) (8, 4) (8, 5) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (3, 6) (2, 6) +(4, 0) (3, 0) (3, 1) +(5, 3) (4, 3) (3, 3) (3, 4) +(4, 4) (5, 4) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(8, 1) (1, 8) +(5, 5) (1, 1) +(7, 4) (5, 2) +(1, 4) (8, 6) +(6, 1) (2, 6) +(4, 0) (3, 1) +(5, 3) (3, 4) +(4, 4) (4, 6) diff --git a/submodules/flowfree/generated/9x9_8c_5_e51c3380.txt b/submodules/flowfree/generated/9x9_8c_5_e51c3380.txt new file mode 100644 index 0000000000000000000000000000000000000000..bbd8c59017fabece972d7068355106e2ab9b3694 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_5_e51c3380.txt @@ -0,0 +1,64 @@ +""" +C......F. +.E...H... +...G.AHE. +..G....B. +......... +.C.A...D. +B........ +F.....D.. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(5, 2) (3, 5) +(0, 6) (7, 3) +(1, 5) (0, 0) +(6, 7) (7, 5) +(7, 2) (1, 1) +(7, 0) (0, 7) +(3, 2) (2, 3) +(5, 1) (6, 2) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CEEEEEEFF +CEHHHHEEF +CHHGAAHEF +CHGGAHHBF +CHHAAHBBF +CCHAHHBDF +BBHHHBBDF +FBBBBBDDF +FFFFFFFFF +""" + +## Raw solver output: +8 9 9 +(5, 2) (4, 2) (4, 3) (4, 4) (3, 4) (3, 5) +(0, 6) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (6, 6) (6, 5) (6, 4) (7, 4) (7, 3) +(1, 5) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) +(6, 7) (7, 7) (7, 6) (7, 5) +(7, 2) (7, 1) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (1, 1) +(7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) +(3, 2) (3, 3) (2, 3) +(5, 1) (4, 1) (3, 1) (2, 1) (2, 2) (1, 2) (1, 3) (1, 4) (2, 4) (2, 5) (2, 6) (3, 6) (4, 6) (4, 5) (5, 5) (5, 4) (5, 3) (6, 3) (6, 2) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(5, 2) (3, 5) +(0, 6) (7, 3) +(1, 5) (0, 0) +(6, 7) (7, 5) +(7, 2) (1, 1) +(7, 0) (0, 7) +(3, 2) (2, 3) +(5, 1) (6, 2) diff --git a/submodules/flowfree/generated/9x9_8c_6_08c857eb.txt b/submodules/flowfree/generated/9x9_8c_6_08c857eb.txt new file mode 100644 index 0000000000000000000000000000000000000000..48e9b415f97b73a2bf8400563efc973704cf82ba --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_6_08c857eb.txt @@ -0,0 +1,64 @@ +""" +B........ +H.....F.. +......GF. +H..D..... +G.A.E.... +........B +.C....E.D +...C..A.. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(2, 4) (6, 7) +(0, 0) (8, 5) +(3, 7) (1, 6) +(3, 3) (8, 6) +(6, 6) (4, 4) +(7, 2) (6, 1) +(0, 4) (6, 2) +(0, 3) (0, 1) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBBBBB +HGGGGGFFB +HGAAAGGFB +HGADAAAAB +GGADEEEAB +GGGDDDEAB +GCGGGDEAD +GCCCGDAAD +GGGGGDDDD +""" + +## Raw solver output: +8 9 9 +(2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 3) (5, 3) (6, 3) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) +(0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) +(3, 7) (2, 7) (1, 7) (1, 6) +(3, 3) (3, 4) (3, 5) (4, 5) (5, 5) (5, 6) (5, 7) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) +(6, 6) (6, 5) (6, 4) (5, 4) (4, 4) +(7, 2) (7, 1) (6, 1) +(0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (4, 7) (4, 6) (3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (6, 2) +(0, 3) (0, 2) (0, 1) + +Touching forbidden +Nodes 123 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(2, 4) (6, 7) +(0, 0) (8, 5) +(3, 7) (1, 6) +(3, 3) (8, 6) +(6, 6) (4, 4) +(7, 2) (6, 1) +(0, 4) (6, 2) +(0, 3) (0, 1) diff --git a/submodules/flowfree/generated/9x9_8c_6_3e7403c4.txt b/submodules/flowfree/generated/9x9_8c_6_3e7403c4.txt new file mode 100644 index 0000000000000000000000000000000000000000..95f6f3f206a52122d75efad710142c0713fdb365 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_6_3e7403c4.txt @@ -0,0 +1,64 @@ +""" +...E...ED +FG....... +.......BF +...D.B... +G.A...... +......... +.CHC..A.. +....H.... +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(2, 4) (6, 6) +(7, 2) (5, 3) +(3, 6) (1, 6) +(3, 3) (8, 0) +(7, 0) (3, 0) +(8, 2) (0, 1) +(1, 1) (0, 4) +(2, 6) (4, 7) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFEEEEED +FGFDDDDDD +GGFDAAABF +GFFDABABF +GFAAABABF +FFHHHBABF +FCHCHBABF +FCCCHBBBF +FFFFFFFFF +""" + +## Raw solver output: +8 9 9 +(2, 4) (3, 4) (4, 4) (4, 3) (4, 2) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) +(3, 6) (3, 7) (2, 7) (1, 7) (1, 6) +(3, 3) (3, 2) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 0) +(7, 0) (6, 0) (5, 0) (4, 0) (3, 0) +(8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (1, 5) (1, 4) (1, 3) (2, 3) (2, 2) (2, 1) (2, 0) (1, 0) (0, 0) (0, 1) +(1, 1) (1, 2) (0, 2) (0, 3) (0, 4) +(2, 6) (2, 5) (3, 5) (4, 5) (4, 6) (4, 7) + +Touching forbidden +Nodes 100 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(2, 4) (6, 6) +(7, 2) (5, 3) +(3, 6) (1, 6) +(3, 3) (8, 0) +(7, 0) (3, 0) +(8, 2) (0, 1) +(1, 1) (0, 4) +(2, 6) (4, 7) diff --git a/submodules/flowfree/generated/9x9_8c_7_a0a086d4.txt b/submodules/flowfree/generated/9x9_8c_7_a0a086d4.txt new file mode 100644 index 0000000000000000000000000000000000000000..c6177c76f5addda3ad8a15605fec8c60f776e499 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_7_a0a086d4.txt @@ -0,0 +1,64 @@ +""" +...A..... +A......E. +......F.. +.E.C..B.. +......... +...F.C... +.HD..B... +...H..... +.....G.GD +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(3, 0) (0, 1) +(6, 3) (5, 6) +(3, 3) (5, 5) +(2, 6) (8, 8) +(7, 1) (1, 3) +(3, 5) (6, 2) +(5, 8) (7, 8) +(1, 6) (3, 7) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAADDDDD +ADDDDEEED +DDEEEEFFD +DEECCCBFD +DDDDDCBFD +FFFFDCBFD +FHDDDBBFD +FHHHFFFFD +FFFFFGGGD +""" + +## Raw solver output: +8 9 9 +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) +(6, 3) (6, 4) (6, 5) (6, 6) (5, 6) +(3, 3) (4, 3) (5, 3) (5, 4) (5, 5) +(2, 6) (3, 6) (4, 6) (4, 5) (4, 4) (3, 4) (2, 4) (1, 4) (0, 4) (0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) +(7, 1) (6, 1) (5, 1) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (1, 3) +(3, 5) (2, 5) (1, 5) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (6, 2) +(5, 8) (6, 8) (7, 8) +(1, 6) (1, 7) (2, 7) (3, 7) + +Touching forbidden +Nodes 108 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(3, 0) (0, 1) +(6, 3) (5, 6) +(3, 3) (5, 5) +(2, 6) (8, 8) +(7, 1) (1, 3) +(3, 5) (6, 2) +(5, 8) (7, 8) +(1, 6) (3, 7) diff --git a/submodules/flowfree/generated/9x9_8c_7_f1829bb0.txt b/submodules/flowfree/generated/9x9_8c_7_f1829bb0.txt new file mode 100644 index 0000000000000000000000000000000000000000..415a3ec313475fef54dd430e47e4d372647956fa --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_7_f1829bb0.txt @@ -0,0 +1,64 @@ +""" +G........ +.......A. +.H.D...C. +...G..... +E.......F +...A..... +.B....C.. +..D...B.. +E......HF +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(3, 5) (7, 1) +(6, 7) (1, 6) +(7, 2) (6, 6) +(3, 2) (2, 7) +(0, 8) (0, 4) +(8, 8) (8, 4) +(3, 3) (0, 0) +(1, 2) (7, 8) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GHHHHHHHH +GHAAAAAAH +GHADDDCCH +GGAGGDCHH +EGAAGDCHF +EGGAGDCHF +EBGGGDCHF +EBDDDDBHF +EBBBBBBHF +""" + +## Raw solver output: +8 9 9 +(3, 5) (3, 4) (2, 4) (2, 3) (2, 2) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) +(6, 7) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) +(7, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(3, 2) (4, 2) (5, 2) (5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (4, 7) (3, 7) (2, 7) +(0, 8) (0, 7) (0, 6) (0, 5) (0, 4) +(8, 8) (8, 7) (8, 6) (8, 5) (8, 4) +(3, 3) (4, 3) (4, 4) (4, 5) (4, 6) (3, 6) (2, 6) (2, 5) (1, 5) (1, 4) (1, 3) (0, 3) (0, 2) (0, 1) (0, 0) +(1, 2) (1, 1) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (7, 8) + +Touching forbidden +Nodes 197 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(3, 5) (7, 1) +(6, 7) (1, 6) +(7, 2) (6, 6) +(3, 2) (2, 7) +(0, 8) (0, 4) +(8, 8) (8, 4) +(3, 3) (0, 0) +(1, 2) (7, 8) diff --git a/submodules/flowfree/generated/9x9_8c_8_43f37569.txt b/submodules/flowfree/generated/9x9_8c_8_43f37569.txt new file mode 100644 index 0000000000000000000000000000000000000000..4ff9815085cca040e2325cb16325bdcff73d2dc5 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_8_43f37569.txt @@ -0,0 +1,64 @@ +""" +.....DA.. +...H...B. +.....A... +......... +D...E..CH +G........ +....B.EGC +........F +.......F. +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(6, 0) (5, 2) +(4, 6) (7, 1) +(8, 6) (7, 4) +(0, 4) (5, 0) +(4, 4) (6, 6) +(8, 7) (7, 8) +(7, 6) (0, 5) +(3, 1) (8, 4) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDAAA +DHHHBBBBA +DHBBBAAAA +DHBHHHHHH +DHBHEEECH +GHBHHHECC +GHBBBHEGC +GHHHHHGGF +GGGGGGGFF +""" + +## Raw solver output: +8 9 9 +(6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (7, 2) (6, 2) (5, 2) +(4, 6) (3, 6) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 1) (5, 1) (6, 1) (7, 1) +(8, 6) (8, 5) (7, 5) (7, 4) +(0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) +(4, 4) (5, 4) (6, 4) (6, 5) (6, 6) +(8, 7) (8, 8) (7, 8) +(7, 6) (7, 7) (6, 7) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) +(3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (4, 5) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) (6, 3) (7, 3) (8, 3) (8, 4) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(6, 0) (5, 2) +(4, 6) (7, 1) +(8, 6) (7, 4) +(0, 4) (5, 0) +(4, 4) (6, 6) +(8, 7) (7, 8) +(7, 6) (0, 5) +(3, 1) (8, 4) diff --git a/submodules/flowfree/generated/9x9_8c_8_aab17324.txt b/submodules/flowfree/generated/9x9_8c_8_aab17324.txt new file mode 100644 index 0000000000000000000000000000000000000000..1e13d807f3e0f563ccd2773accf8d4c4ac5726f3 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_8_aab17324.txt @@ -0,0 +1,64 @@ +""" +...DH.... +.G.....C. +...D..... +...EHB..F +......... +.AEF..... +......BC. +.A..G.... +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(1, 7) (1, 5) +(6, 6) (5, 3) +(7, 6) (7, 1) +(3, 0) (3, 2) +(2, 5) (3, 3) +(3, 5) (8, 3) +(4, 7) (1, 1) +(4, 3) (4, 0) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEDHBBBB +EGEDHBCCB +EGEDHBCBB +EGEEHBCBF +EGGGGCCBF +EAEFGCBBF +EAEFGCBCF +EAEFGCCCF +EEEFFFFFF +""" + +## Raw solver output: +8 9 9 +(1, 7) (1, 6) (1, 5) +(6, 6) (6, 5) (7, 5) (7, 4) (7, 3) (7, 2) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (5, 1) (5, 2) (5, 3) +(7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (7, 1) +(3, 0) (3, 1) (3, 2) +(2, 5) (2, 6) (2, 7) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) (2, 3) (3, 3) +(3, 5) (3, 6) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) +(4, 7) (4, 6) (4, 5) (4, 4) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) +(4, 3) (4, 2) (4, 1) (4, 0) + +Touching forbidden +Nodes 197 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(1, 7) (1, 5) +(6, 6) (5, 3) +(7, 6) (7, 1) +(3, 0) (3, 2) +(2, 5) (3, 3) +(3, 5) (8, 3) +(4, 7) (1, 1) +(4, 3) (4, 0) diff --git a/submodules/flowfree/generated/9x9_8c_9_5fb7c0cf.txt b/submodules/flowfree/generated/9x9_8c_9_5fb7c0cf.txt new file mode 100644 index 0000000000000000000000000000000000000000..2d65c14a2d261b2e11ac9801f4c898a244e9892b --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_9_5fb7c0cf.txt @@ -0,0 +1,64 @@ +""" +.....E..E +......... +..H....B. +A........ +C...D.... +.......AD +......... +CBH....F. +G...FG... +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(0, 3) (7, 5) +(1, 7) (7, 2) +(0, 7) (0, 4) +(8, 5) (4, 4) +(5, 0) (8, 0) +(7, 7) (4, 8) +(5, 8) (0, 8) +(2, 7) (2, 2) + + param line: 8 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAEEEE +ABBBAAAAA +ABHBBBBBA +ABHAAAAAA +CBHADDDDD +CBHAAAAAD +CBHGGGGGG +CBHGFFFFG +GGGGFGGGG +""" + +## Raw solver output: +8 9 9 +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (8, 2) (8, 3) (7, 3) (6, 3) (5, 3) (4, 3) (3, 3) (3, 4) (3, 5) (4, 5) (5, 5) (6, 5) (7, 5) +(1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (4, 2) (5, 2) (6, 2) (7, 2) +(0, 7) (0, 6) (0, 5) (0, 4) +(8, 5) (8, 4) (7, 4) (6, 4) (5, 4) (4, 4) +(5, 0) (6, 0) (7, 0) (8, 0) +(7, 7) (6, 7) (5, 7) (4, 7) (4, 8) +(5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (7, 6) (6, 6) (5, 6) (4, 6) (3, 6) (3, 7) (3, 8) (2, 8) (1, 8) (0, 8) +(2, 7) (2, 6) (2, 5) (2, 4) (2, 3) (2, 2) + +Touching forbidden +Nodes 126 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(0, 3) (7, 5) +(1, 7) (7, 2) +(0, 7) (0, 4) +(8, 5) (4, 4) +(5, 0) (8, 0) +(7, 7) (4, 8) +(5, 8) (0, 8) +(2, 7) (2, 2) diff --git a/submodules/flowfree/generated/9x9_8c_9_fe00bcd5.txt b/submodules/flowfree/generated/9x9_8c_9_fe00bcd5.txt new file mode 100644 index 0000000000000000000000000000000000000000..b50731598aec6630f2cda5a29d54a6b052e41a41 --- /dev/null +++ b/submodules/flowfree/generated/9x9_8c_9_fe00bcd5.txt @@ -0,0 +1,64 @@ +""" +D.....FC. +......B.. +....F.C.. +......... +..H.HA... +D...E.... +.......B. +......... +EAG.....G +""" + +# ---- raw puzzle block (for reproducibility) ---- +8 9 9 +(1, 8) (5, 4) +(7, 6) (6, 1) +(7, 0) (6, 2) +(0, 0) (0, 5) +(0, 8) (4, 5) +(4, 2) (6, 0) +(2, 8) (8, 8) +(2, 4) (4, 4) + + param line: 8 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DFFFFFFCC +DFHHHHBBC +DFHFFHCBC +DFHFHHCBC +DFHFHACBC +DFFFEACBC +EEEEEACBC +EAAAAACCC +EAGGGGGGG +""" + +## Raw solver output: +8 9 9 +(1, 8) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (5, 4) +(7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) +(7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (7, 7) (6, 7) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) +(0, 8) (0, 7) (0, 6) (1, 6) (2, 6) (3, 6) (4, 6) (4, 5) +(4, 2) (3, 2) (3, 3) (3, 4) (3, 5) (2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) +(2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) +(2, 4) (2, 3) (2, 2) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (5, 3) (4, 3) (4, 4) + +Touching forbidden +Nodes 99 +Solutions 1 + +## Solver input (raw puzzle block): +8 9 9 +(1, 8) (5, 4) +(7, 6) (6, 1) +(7, 0) (6, 2) +(0, 0) (0, 5) +(0, 8) (4, 5) +(4, 2) (6, 0) +(2, 8) (8, 8) +(2, 4) (4, 4) diff --git a/submodules/flowfree/generated/9x9_9c_10_b1d5c5be.txt b/submodules/flowfree/generated/9x9_9c_10_b1d5c5be.txt new file mode 100644 index 0000000000000000000000000000000000000000..3edf31d5e3bf08160e3fbb8f02ff3c63184e221b --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_10_b1d5c5be.txt @@ -0,0 +1,67 @@ +""" +..BH..... +......... +..F...... +B......A. +GID..A... +...C....H +.DI..C.FE +.......E. +........G +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(7, 3) (5, 4) +(0, 3) (2, 0) +(3, 5) (5, 6) +(1, 6) (2, 4) +(7, 7) (8, 6) +(7, 6) (2, 2) +(0, 4) (8, 8) +(8, 5) (3, 0) +(2, 6) (1, 4) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBHHHHHH +BAAAAAAAH +BAFFFFFAH +BAAAAAFAH +GIDDDAFFH +GIICDDDFH +GDICCCDFE +GDDDDDDEE +GGGGGGGGG +""" + +## Raw solver output: +9 9 9 +(7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (5, 4) +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) +(3, 5) (3, 6) (4, 6) (5, 6) +(1, 6) (1, 7) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (6, 6) (6, 5) (5, 5) (4, 5) (4, 4) (3, 4) (2, 4) +(7, 7) (8, 7) (8, 6) +(7, 6) (7, 5) (7, 4) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) +(0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) +(8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) +(2, 6) (2, 5) (1, 5) (1, 4) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(7, 3) (5, 4) +(0, 3) (2, 0) +(3, 5) (5, 6) +(1, 6) (2, 4) +(7, 7) (8, 6) +(7, 6) (2, 2) +(0, 4) (8, 8) +(8, 5) (3, 0) +(2, 6) (1, 4) diff --git a/submodules/flowfree/generated/9x9_9c_10_f029a480.txt b/submodules/flowfree/generated/9x9_9c_10_f029a480.txt new file mode 100644 index 0000000000000000000000000000000000000000..be4e8ec226ec55d787a080a8fc554b39ebf54d33 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_10_f029a480.txt @@ -0,0 +1,67 @@ +""" +.....E... +....I..D. +..G...B.. +..F.F.... +......D.. +..CE...A. +.C...HB.. +...I..H.. +A.......G +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(0, 8) (7, 5) +(6, 2) (6, 6) +(2, 5) (1, 6) +(6, 4) (7, 1) +(5, 0) (3, 5) +(2, 3) (4, 3) +(2, 2) (8, 8) +(5, 6) (6, 7) +(3, 7) (4, 1) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEGGG +EIIIIGGDG +EIGGGGBDG +EIFFFBBDG +EIIIIBDDG +ECCEIBBAG +ECEEIHBAG +EEEIIHHAG +AAAAAAAAG +""" + +## Raw solver output: +9 9 9 +(0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) (7, 5) +(6, 2) (6, 3) (5, 3) (5, 4) (5, 5) (6, 5) (6, 6) +(2, 5) (1, 5) (1, 6) +(6, 4) (7, 4) (7, 3) (7, 2) (7, 1) +(5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) (2, 6) (3, 6) (3, 5) +(2, 3) (3, 3) (4, 3) +(2, 2) (3, 2) (4, 2) (5, 2) (5, 1) (6, 1) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) +(5, 6) (5, 7) (6, 7) +(3, 7) (4, 7) (4, 6) (4, 5) (4, 4) (3, 4) (2, 4) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(0, 8) (7, 5) +(6, 2) (6, 6) +(2, 5) (1, 6) +(6, 4) (7, 1) +(5, 0) (3, 5) +(2, 3) (4, 3) +(2, 2) (8, 8) +(5, 6) (6, 7) +(3, 7) (4, 1) diff --git a/submodules/flowfree/generated/9x9_9c_1_1956903b.txt b/submodules/flowfree/generated/9x9_9c_1_1956903b.txt new file mode 100644 index 0000000000000000000000000000000000000000..5be91b362d012e551ec5cb573b09cbc9e133ec52 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_1_1956903b.txt @@ -0,0 +1,67 @@ +""" +......... +.C..B..E. +..BF..H.. +FC....... +...H..... +E.G...... +..D...AI. +.A....... +GI....D.. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(1, 7) (6, 6) +(2, 2) (4, 1) +(1, 3) (1, 1) +(6, 8) (2, 6) +(7, 1) (0, 5) +(0, 3) (3, 2) +(2, 5) (0, 8) +(3, 4) (6, 2) +(1, 8) (7, 6) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFHHH +FCBBBFHEH +FCBFFFHEH +FCEEEEEEH +EEEHHHHHH +EGGDDDDDD +GGDDAAAID +GAAAAIIID +GIIIIIDDD +""" + +## Raw solver output: +9 9 9 +(1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (5, 6) (6, 6) +(2, 2) (2, 1) (3, 1) (4, 1) +(1, 3) (1, 2) (1, 1) +(6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (7, 5) (6, 5) (5, 5) (4, 5) (3, 5) (3, 6) (2, 6) +(7, 1) (7, 2) (7, 3) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) (2, 4) (1, 4) (0, 4) (0, 5) +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (5, 1) (5, 2) (4, 2) (3, 2) +(2, 5) (1, 5) (1, 6) (0, 6) (0, 7) (0, 8) +(3, 4) (4, 4) (5, 4) (6, 4) (7, 4) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (6, 1) (6, 2) +(1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (5, 7) (6, 7) (7, 7) (7, 6) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(1, 7) (6, 6) +(2, 2) (4, 1) +(1, 3) (1, 1) +(6, 8) (2, 6) +(7, 1) (0, 5) +(0, 3) (3, 2) +(2, 5) (0, 8) +(3, 4) (6, 2) +(1, 8) (7, 6) diff --git a/submodules/flowfree/generated/9x9_9c_1_80802004.txt b/submodules/flowfree/generated/9x9_9c_1_80802004.txt new file mode 100644 index 0000000000000000000000000000000000000000..0f0d5aebc6504cc896a71db66203908d153d1e7c --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_1_80802004.txt @@ -0,0 +1,67 @@ +""" +...E..... +.B....... +...B..F.. +DA....... +...G....E +...A..... +H..D..... +.G....IF. +...HC..CI +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(1, 3) (3, 5) +(3, 2) (1, 1) +(7, 8) (4, 8) +(3, 6) (0, 3) +(8, 4) (3, 0) +(7, 7) (6, 2) +(1, 7) (3, 4) +(0, 6) (3, 8) +(6, 7) (8, 8) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEEEE +EBBBEIIIE +EEEBEIFIE +DAEEEIFIE +DAAGGIFIE +DDAAGIFII +HDDDGIFFI +HGGGGIIFI +HHHHCCCCI +""" + +## Raw solver output: +9 9 9 +(1, 3) (1, 4) (2, 4) (2, 5) (3, 5) +(3, 2) (3, 1) (2, 1) (1, 1) +(7, 8) (6, 8) (5, 8) (4, 8) +(3, 6) (2, 6) (1, 6) (1, 5) (0, 5) (0, 4) (0, 3) +(8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (4, 1) (4, 2) (4, 3) (3, 3) (2, 3) (2, 2) (1, 2) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(7, 7) (7, 6) (6, 6) (6, 5) (6, 4) (6, 3) (6, 2) +(1, 7) (2, 7) (3, 7) (4, 7) (4, 6) (4, 5) (4, 4) (3, 4) +(0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) +(6, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (8, 5) (8, 6) (8, 7) (8, 8) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(1, 3) (3, 5) +(3, 2) (1, 1) +(7, 8) (4, 8) +(3, 6) (0, 3) +(8, 4) (3, 0) +(7, 7) (6, 2) +(1, 7) (3, 4) +(0, 6) (3, 8) +(6, 7) (8, 8) diff --git a/submodules/flowfree/generated/9x9_9c_2_b0120833.txt b/submodules/flowfree/generated/9x9_9c_2_b0120833.txt new file mode 100644 index 0000000000000000000000000000000000000000..a209f8be2b382f35e3fd056e6568b98aa6356855 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_2_b0120833.txt @@ -0,0 +1,67 @@ +""" +B...D.... +.EF.I..AD +........G +B...I..E. +......... +....C.... +..A.G.C.. +......... +FH.H..... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(2, 6) (7, 1) +(0, 0) (0, 3) +(6, 6) (4, 5) +(8, 1) (4, 0) +(7, 3) (1, 1) +(0, 8) (2, 1) +(8, 2) (4, 6) +(1, 8) (3, 8) +(4, 1) (4, 3) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BEEEDDDDD +BEFEIAAAD +BFFEIAGGG +BFEEIAGEE +FFEAAAGGE +FEEACCCGE +FEAAGGCGE +FEEEEGGGE +FHHHEEEEE +""" + +## Raw solver output: +9 9 9 +(2, 6) (3, 6) (3, 5) (3, 4) (4, 4) (5, 4) (5, 3) (5, 2) (5, 1) (6, 1) (7, 1) +(0, 0) (0, 1) (0, 2) (0, 3) +(6, 6) (6, 5) (5, 5) (4, 5) +(8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) +(7, 3) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (2, 5) (2, 4) (2, 3) (3, 3) (3, 2) (3, 1) (3, 0) (2, 0) (1, 0) (1, 1) +(0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (1, 3) (1, 2) (2, 2) (2, 1) +(8, 2) (7, 2) (6, 2) (6, 3) (6, 4) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (4, 6) +(1, 8) (2, 8) (3, 8) +(4, 1) (4, 2) (4, 3) + +Touching forbidden +Nodes 115 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(2, 6) (7, 1) +(0, 0) (0, 3) +(6, 6) (4, 5) +(8, 1) (4, 0) +(7, 3) (1, 1) +(0, 8) (2, 1) +(8, 2) (4, 6) +(1, 8) (3, 8) +(4, 1) (4, 3) diff --git a/submodules/flowfree/generated/9x9_9c_2_cb24bd37.txt b/submodules/flowfree/generated/9x9_9c_2_cb24bd37.txt new file mode 100644 index 0000000000000000000000000000000000000000..6222ba1a31d0d893ff14e24637d1fd5e6ecb146b --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_2_cb24bd37.txt @@ -0,0 +1,67 @@ +""" +......... +.G....D.. +.B..F.... +.....I.D. +A...IG.A. +.FB...... +.H.HE.... +.C.C..... +.....E... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(0, 4) (7, 4) +(1, 2) (2, 5) +(1, 7) (3, 7) +(7, 3) (6, 1) +(5, 8) (4, 6) +(4, 2) (1, 5) +(5, 4) (1, 1) +(3, 6) (1, 6) +(4, 4) (5, 3) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFEEEE +FGGGFEDDE +FBBGFEEDE +FFBGIIEDE +AFBGIGEAE +AFBGGGEAE +AHHHEEEAE +ACCCAAAAE +AAAAAEEEE +""" + +## Raw solver output: +9 9 9 +(0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) +(1, 2) (2, 2) (2, 3) (2, 4) (2, 5) +(1, 7) (2, 7) (3, 7) +(7, 3) (7, 2) (7, 1) (6, 1) +(5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (5, 1) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) (5, 6) (4, 6) +(4, 2) (4, 1) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (1, 4) (1, 5) +(5, 4) (5, 5) (4, 5) (3, 5) (3, 4) (3, 3) (3, 2) (3, 1) (2, 1) (1, 1) +(3, 6) (2, 6) (1, 6) +(4, 4) (4, 3) (5, 3) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(0, 4) (7, 4) +(1, 2) (2, 5) +(1, 7) (3, 7) +(7, 3) (6, 1) +(5, 8) (4, 6) +(4, 2) (1, 5) +(5, 4) (1, 1) +(3, 6) (1, 6) +(4, 4) (5, 3) diff --git a/submodules/flowfree/generated/9x9_9c_3_93eaa6a8.txt b/submodules/flowfree/generated/9x9_9c_3_93eaa6a8.txt new file mode 100644 index 0000000000000000000000000000000000000000..d1747a89174502ad440e90f9642a7bc715b73dbd --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_3_93eaa6a8.txt @@ -0,0 +1,67 @@ +""" +D...IG.EF +.I...C... +.C.DG.... +....E.... +.....A... +..A..H.B. +..B....F. +.......H. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(5, 4) (2, 5) +(7, 5) (2, 6) +(5, 1) (1, 2) +(0, 0) (3, 2) +(7, 0) (4, 3) +(8, 0) (7, 6) +(5, 0) (4, 2) +(7, 7) (5, 5) +(4, 0) (1, 1) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DIIIIGGEF +DICCCCGEF +DCCDGGGEF +DDDDEEEEF +BBBBAAFFF +BAABAHFBB +BABBAHFFB +BAAAAHHHB +BBBBBBBBB +""" + +## Raw solver output: +9 9 9 +(5, 4) (4, 4) (4, 5) (4, 6) (4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (1, 5) (2, 5) +(7, 5) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (3, 4) (3, 5) (3, 6) (2, 6) +(5, 1) (4, 1) (3, 1) (2, 1) (2, 2) (1, 2) +(0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (2, 3) (3, 3) (3, 2) +(7, 0) (7, 1) (7, 2) (7, 3) (6, 3) (5, 3) (4, 3) +(8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (7, 4) (6, 4) (6, 5) (6, 6) (7, 6) +(5, 0) (6, 0) (6, 1) (6, 2) (5, 2) (4, 2) +(7, 7) (6, 7) (5, 7) (5, 6) (5, 5) +(4, 0) (3, 0) (2, 0) (1, 0) (1, 1) + +Touching forbidden +Nodes 121 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(5, 4) (2, 5) +(7, 5) (2, 6) +(5, 1) (1, 2) +(0, 0) (3, 2) +(7, 0) (4, 3) +(8, 0) (7, 6) +(5, 0) (4, 2) +(7, 7) (5, 5) +(4, 0) (1, 1) diff --git a/submodules/flowfree/generated/9x9_9c_3_bb39e0a5.txt b/submodules/flowfree/generated/9x9_9c_3_bb39e0a5.txt new file mode 100644 index 0000000000000000000000000000000000000000..3725490b7b16aba5ce408b94a3993f5b2580e926 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_3_bb39e0a5.txt @@ -0,0 +1,67 @@ +""" +C.GD..... +H......A. +..G.D.... +H........ +B..I....I +...F.BE.. +...A...E. +....C..F. +......... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(7, 1) (3, 6) +(0, 4) (5, 5) +(0, 0) (4, 7) +(3, 0) (4, 2) +(7, 6) (6, 5) +(7, 7) (3, 5) +(2, 2) (2, 0) +(0, 3) (0, 1) +(3, 4) (8, 4) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +CCGDDDDDD +HCGAAAAAD +HCGADDDDD +HCAAIIIII +BCAIIBBBI +BCAFFBEBB +BCAAFFEEB +BCCCCFFFB +BBBBBBBBB +""" + +## Raw solver output: +9 9 9 +(7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (3, 2) (3, 3) (2, 3) (2, 4) (2, 5) (2, 6) (3, 6) +(0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (7, 5) (7, 4) (6, 4) (5, 4) (5, 5) +(0, 0) (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (4, 7) +(3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (7, 2) (6, 2) (5, 2) (4, 2) +(7, 6) (6, 6) (6, 5) +(7, 7) (6, 7) (5, 7) (5, 6) (4, 6) (4, 5) (3, 5) +(2, 2) (2, 1) (2, 0) +(0, 3) (0, 2) (0, 1) +(3, 4) (4, 4) (4, 3) (5, 3) (6, 3) (7, 3) (8, 3) (8, 4) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(7, 1) (3, 6) +(0, 4) (5, 5) +(0, 0) (4, 7) +(3, 0) (4, 2) +(7, 6) (6, 5) +(7, 7) (3, 5) +(2, 2) (2, 0) +(0, 3) (0, 1) +(3, 4) (8, 4) diff --git a/submodules/flowfree/generated/9x9_9c_4_28d534c2.txt b/submodules/flowfree/generated/9x9_9c_4_28d534c2.txt new file mode 100644 index 0000000000000000000000000000000000000000..6982e06ed00e4a18e09f898f040fa16b0eb7addf --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_4_28d534c2.txt @@ -0,0 +1,67 @@ +""" +..D.HB... +......... +..CF.B... +.H..AG.F. +..E...... +......I.I +D..G..... +.......A. +EC....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(7, 7) (4, 3) +(5, 2) (5, 0) +(1, 8) (2, 2) +(2, 0) (0, 6) +(2, 4) (0, 8) +(7, 3) (3, 2) +(3, 6) (5, 3) +(4, 0) (1, 3) +(8, 5) (6, 5) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDHHBBBB +DHHHFFFFB +DHCFFBBFB +DHCCAGBFB +DEECAGBBB +DECCAGIII +DECGAGGGG +EECGAAAAG +ECCGGGGGG +""" + +## Raw solver output: +9 9 9 +(7, 7) (6, 7) (5, 7) (4, 7) (4, 6) (4, 5) (4, 4) (4, 3) +(5, 2) (6, 2) (6, 3) (6, 4) (7, 4) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) +(1, 8) (2, 8) (2, 7) (2, 6) (2, 5) (3, 5) (3, 4) (3, 3) (2, 3) (2, 2) +(2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) +(2, 4) (1, 4) (1, 5) (1, 6) (1, 7) (0, 7) (0, 8) +(7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (4, 2) (3, 2) +(3, 6) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) (8, 7) (8, 6) (7, 6) (6, 6) (5, 6) (5, 5) (5, 4) (5, 3) +(4, 0) (3, 0) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) +(8, 5) (7, 5) (6, 5) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(7, 7) (4, 3) +(5, 2) (5, 0) +(1, 8) (2, 2) +(2, 0) (0, 6) +(2, 4) (0, 8) +(7, 3) (3, 2) +(3, 6) (5, 3) +(4, 0) (1, 3) +(8, 5) (6, 5) diff --git a/submodules/flowfree/generated/9x9_9c_4_f2284643.txt b/submodules/flowfree/generated/9x9_9c_4_f2284643.txt new file mode 100644 index 0000000000000000000000000000000000000000..92fd9ea0ad0044b5b470f5de6ef45007418f927f --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_4_f2284643.txt @@ -0,0 +1,67 @@ +""" +........C +....F.EA. +..G...I.. +....F.E.. +..G.B..IC +..H...... +....H.... +..D...D.. +A.......B +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(7, 1) (0, 8) +(8, 8) (4, 4) +(8, 4) (8, 0) +(2, 7) (6, 7) +(6, 1) (6, 3) +(4, 1) (4, 3) +(2, 4) (2, 2) +(2, 5) (4, 6) +(6, 2) (7, 4) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAAAAAAC +AHHHFEEAC +AHGHFEIIC +AHGHFEEIC +AHGHBBBIC +AHHHHHBBB +AHHHHHHHB +AHDDDDDHB +AHHHHHHHB +""" + +## Raw solver output: +9 9 9 +(7, 1) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) +(8, 8) (8, 7) (8, 6) (8, 5) (7, 5) (6, 5) (6, 4) (5, 4) (4, 4) +(8, 4) (8, 3) (8, 2) (8, 1) (8, 0) +(2, 7) (3, 7) (4, 7) (5, 7) (6, 7) +(6, 1) (5, 1) (5, 2) (5, 3) (6, 3) +(4, 1) (4, 2) (4, 3) +(2, 4) (2, 3) (2, 2) +(2, 5) (1, 5) (1, 4) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (4, 5) (5, 5) (5, 6) (6, 6) (7, 6) (7, 7) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (2, 6) (3, 6) (4, 6) +(6, 2) (7, 2) (7, 3) (7, 4) + +Touching forbidden +Nodes 148 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(7, 1) (0, 8) +(8, 8) (4, 4) +(8, 4) (8, 0) +(2, 7) (6, 7) +(6, 1) (6, 3) +(4, 1) (4, 3) +(2, 4) (2, 2) +(2, 5) (4, 6) +(6, 2) (7, 4) diff --git a/submodules/flowfree/generated/9x9_9c_5_7e0506bb.txt b/submodules/flowfree/generated/9x9_9c_5_7e0506bb.txt new file mode 100644 index 0000000000000000000000000000000000000000..731e570a5969499d582b12b6eb616675f46cd452 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_5_7e0506bb.txt @@ -0,0 +1,67 @@ +""" +FI....... +.E....... +...GA.... +.....G... +...D...B. +.....DA.. +..C....IB +..E..C... +....FH..H +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(6, 5) (4, 2) +(8, 6) (7, 4) +(2, 6) (5, 7) +(5, 5) (3, 4) +(1, 1) (2, 7) +(0, 0) (4, 8) +(5, 3) (3, 2) +(8, 8) (5, 8) +(1, 0) (7, 6) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FIIIIIIII +FEBBBBBBI +FEBGAAABI +FEBGGGABI +FEBDDDABI +FEBBBDAII +FECCBBBIB +FEECCCBBB +FFFFFHHHH +""" + +## Raw solver output: +9 9 9 +(6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) +(8, 6) (8, 7) (7, 7) (6, 7) (6, 6) (5, 6) (4, 6) (4, 5) (3, 5) (2, 5) (2, 4) (2, 3) (2, 2) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) +(2, 6) (3, 6) (3, 7) (4, 7) (5, 7) +(5, 5) (5, 4) (4, 4) (3, 4) +(1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) (2, 7) +(0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) (3, 8) (4, 8) +(5, 3) (4, 3) (3, 3) (3, 2) +(8, 8) (7, 8) (6, 8) (5, 8) +(1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (7, 5) (7, 6) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(6, 5) (4, 2) +(8, 6) (7, 4) +(2, 6) (5, 7) +(5, 5) (3, 4) +(1, 1) (2, 7) +(0, 0) (4, 8) +(5, 3) (3, 2) +(8, 8) (5, 8) +(1, 0) (7, 6) diff --git a/submodules/flowfree/generated/9x9_9c_5_a571c118.txt b/submodules/flowfree/generated/9x9_9c_5_a571c118.txt new file mode 100644 index 0000000000000000000000000000000000000000..15ceb746bc15745b529ab10361a04bd3892ce748 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_5_a571c118.txt @@ -0,0 +1,67 @@ +""" +.....D... +....B..E. +.....GF.. +.B.C..... +.......EG +.FH..H..I +.....I..A +..C...... +D.......A +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 8) (8, 6) +(1, 3) (4, 1) +(2, 7) (3, 3) +(0, 8) (5, 0) +(7, 4) (7, 1) +(1, 5) (6, 2) +(5, 2) (8, 4) +(2, 5) (5, 5) +(8, 5) (5, 6) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +DDDDDDGGG +DBBBBGGEG +DBFFFGFEG +DBFCFFFEG +DFFCCCCEG +DFHHHHCII +DIIIIICIA +DICCCCCIA +DIIIIIIIA +""" + +## Raw solver output: +9 9 9 +(8, 8) (8, 7) (8, 6) +(1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) +(2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (6, 6) (6, 5) (6, 4) (5, 4) (4, 4) (3, 4) (3, 3) +(0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) +(7, 4) (7, 3) (7, 2) (7, 1) +(1, 5) (1, 4) (2, 4) (2, 3) (2, 2) (3, 2) (4, 2) (4, 3) (5, 3) (6, 3) (6, 2) +(5, 2) (5, 1) (6, 1) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) +(2, 5) (3, 5) (4, 5) (5, 5) +(8, 5) (7, 5) (7, 6) (7, 7) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (1, 7) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) + +Touching forbidden +Nodes 121 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 8) (8, 6) +(1, 3) (4, 1) +(2, 7) (3, 3) +(0, 8) (5, 0) +(7, 4) (7, 1) +(1, 5) (6, 2) +(5, 2) (8, 4) +(2, 5) (5, 5) +(8, 5) (5, 6) diff --git a/submodules/flowfree/generated/9x9_9c_6_a4b5019b.txt b/submodules/flowfree/generated/9x9_9c_6_a4b5019b.txt new file mode 100644 index 0000000000000000000000000000000000000000..75b8e08a8ee47c171c81a0afa66668e2cb2196d7 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_6_a4b5019b.txt @@ -0,0 +1,67 @@ +""" +...AB...C +...H..... +..I....EB +....C.... +.......G. +......... +..GF.FI.. +.H......E +.AD.....D +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(3, 0) (1, 8) +(4, 0) (8, 2) +(4, 3) (8, 0) +(2, 8) (8, 8) +(8, 7) (7, 2) +(3, 6) (5, 6) +(2, 6) (7, 4) +(3, 1) (1, 7) +(2, 2) (6, 6) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +AAAABCCCC +AHHHBCBBB +AHIBBCBEB +AHIBCCBEE +AHIBBBBGE +AHIIIIIGE +AHGFFFIGE +AHGGGGGGE +AADDDDDDD +""" + +## Raw solver output: +9 9 9 +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) +(4, 0) (4, 1) (4, 2) (3, 2) (3, 3) (3, 4) (4, 4) (5, 4) (6, 4) (6, 3) (6, 2) (6, 1) (7, 1) (8, 1) (8, 2) +(4, 3) (5, 3) (5, 2) (5, 1) (5, 0) (6, 0) (7, 0) (8, 0) +(2, 8) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (8, 8) +(8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (7, 3) (7, 2) +(3, 6) (4, 6) (5, 6) +(2, 6) (2, 7) (3, 7) (4, 7) (5, 7) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) +(3, 1) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (1, 7) +(2, 2) (2, 3) (2, 4) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (6, 6) + +Touching forbidden +Nodes 83 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(3, 0) (1, 8) +(4, 0) (8, 2) +(4, 3) (8, 0) +(2, 8) (8, 8) +(8, 7) (7, 2) +(3, 6) (5, 6) +(2, 6) (7, 4) +(3, 1) (1, 7) +(2, 2) (6, 6) diff --git a/submodules/flowfree/generated/9x9_9c_6_dd9b1f9e.txt b/submodules/flowfree/generated/9x9_9c_6_dd9b1f9e.txt new file mode 100644 index 0000000000000000000000000000000000000000..7324b6e7ba78e78a42aa868e46fd90510d52d3ff --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_6_dd9b1f9e.txt @@ -0,0 +1,67 @@ +""" +......... +....H.... +..D...H.. +......... +EI....I.. +BF.C...DE +..FG....A +C...B.G.. +........A +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 8) (8, 6) +(4, 7) (0, 5) +(3, 5) (0, 7) +(2, 2) (7, 5) +(8, 5) (0, 4) +(1, 5) (2, 6) +(6, 7) (3, 6) +(6, 2) (4, 1) +(1, 4) (6, 4) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEEEEEE +EHHHHDDDE +EHDDDDHDE +EHHHHHHDE +EIIIIIIDE +BFFCCCCDE +BBFGGGCCA +CBBBBGGCA +CCCCCCCCA +""" + +## Raw solver output: +9 9 9 +(8, 8) (8, 7) (8, 6) +(4, 7) (3, 7) (2, 7) (1, 7) (1, 6) (0, 6) (0, 5) +(3, 5) (4, 5) (5, 5) (6, 5) (6, 6) (7, 6) (7, 7) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) (0, 8) (0, 7) +(2, 2) (3, 2) (4, 2) (5, 2) (5, 1) (6, 1) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) +(8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) +(1, 5) (2, 5) (2, 6) +(6, 7) (5, 7) (5, 6) (4, 6) (3, 6) +(6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) +(1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) + +Touching forbidden +Nodes 87 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 8) (8, 6) +(4, 7) (0, 5) +(3, 5) (0, 7) +(2, 2) (7, 5) +(8, 5) (0, 4) +(1, 5) (2, 6) +(6, 7) (3, 6) +(6, 2) (4, 1) +(1, 4) (6, 4) diff --git a/submodules/flowfree/generated/9x9_9c_7_71aa2cff.txt b/submodules/flowfree/generated/9x9_9c_7_71aa2cff.txt new file mode 100644 index 0000000000000000000000000000000000000000..511b96fb280db983499b7f5475ae861f2ba5ca4c --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_7_71aa2cff.txt @@ -0,0 +1,67 @@ +""" +....BA... +B......C. +..E..E... +I........ +..G...... +......... +.C....G.A +.FDF....H +I.....DH. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(5, 0) (8, 6) +(0, 1) (4, 0) +(7, 1) (1, 6) +(2, 7) (6, 8) +(2, 2) (5, 2) +(1, 7) (3, 7) +(6, 6) (2, 4) +(8, 7) (7, 8) +(0, 3) (0, 8) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +BBBBBAAAA +BIIIIIICA +IIEEEEICA +IIIIIIICA +IIGGGGGCA +ICCCCCGCA +ICDDDCGCA +IFDFDCCCH +IFFFDDDHH +""" + +## Raw solver output: +9 9 9 +(5, 0) (6, 0) (7, 0) (8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) +(7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (7, 6) (7, 7) (6, 7) (5, 7) (5, 6) (5, 5) (4, 5) (3, 5) (2, 5) (1, 5) (1, 6) +(2, 7) (2, 6) (3, 6) (4, 6) (4, 7) (4, 8) (5, 8) (6, 8) +(2, 2) (3, 2) (4, 2) (5, 2) +(1, 7) (1, 8) (2, 8) (3, 8) (3, 7) +(6, 6) (6, 5) (6, 4) (5, 4) (4, 4) (3, 4) (2, 4) +(8, 7) (8, 8) (7, 8) +(0, 3) (0, 2) (1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (6, 2) (6, 3) (5, 3) (4, 3) (3, 3) (2, 3) (1, 3) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) + +Touching forbidden +Nodes 108 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(5, 0) (8, 6) +(0, 1) (4, 0) +(7, 1) (1, 6) +(2, 7) (6, 8) +(2, 2) (5, 2) +(1, 7) (3, 7) +(6, 6) (2, 4) +(8, 7) (7, 8) +(0, 3) (0, 8) diff --git a/submodules/flowfree/generated/9x9_9c_7_d151790b.txt b/submodules/flowfree/generated/9x9_9c_7_d151790b.txt new file mode 100644 index 0000000000000000000000000000000000000000..e160d1e29b293a97010275694f0a7da2c9dca237 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_7_d151790b.txt @@ -0,0 +1,67 @@ +""" +...H....A +HI...B..E +......I.. +......... +..C..GC.. +...F..... +......AD. +..F...D.. +BG..E.... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 0) (6, 6) +(0, 8) (5, 1) +(6, 4) (2, 4) +(6, 7) (7, 6) +(8, 1) (4, 8) +(2, 7) (3, 5) +(1, 8) (5, 4) +(0, 1) (3, 0) +(1, 1) (6, 2) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +HHHHIIIAA +HIIIIBIAE +BBBBBBIAE +BFFFCCCAE +BFCFCGCAE +BFCFCGAAE +BFCCCGADE +BFFGGGDDE +BGGGEEEEE +""" + +## Raw solver output: +9 9 9 +(8, 0) (7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (7, 5) (6, 5) (6, 6) +(0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (5, 1) +(6, 4) (6, 3) (5, 3) (4, 3) (4, 4) (4, 5) (4, 6) (3, 6) (2, 6) (2, 5) (2, 4) +(6, 7) (7, 7) (7, 6) +(8, 1) (8, 2) (8, 3) (8, 4) (8, 5) (8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) +(2, 7) (1, 7) (1, 6) (1, 5) (1, 4) (1, 3) (2, 3) (3, 3) (3, 4) (3, 5) +(1, 8) (2, 8) (3, 8) (3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (5, 4) +(0, 1) (0, 0) (1, 0) (2, 0) (3, 0) +(1, 1) (2, 1) (3, 1) (4, 1) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) + +Touching forbidden +Nodes 87 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 0) (6, 6) +(0, 8) (5, 1) +(6, 4) (2, 4) +(6, 7) (7, 6) +(8, 1) (4, 8) +(2, 7) (3, 5) +(1, 8) (5, 4) +(0, 1) (3, 0) +(1, 1) (6, 2) diff --git a/submodules/flowfree/generated/9x9_9c_8_d1aea511.txt b/submodules/flowfree/generated/9x9_9c_8_d1aea511.txt new file mode 100644 index 0000000000000000000000000000000000000000..c542915b473c341cb797f580cb69d6187db5d9c2 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_8_d1aea511.txt @@ -0,0 +1,67 @@ +""" +.......A. +......... +.CH...... +...F..... +...EGH..A +.I...C..E +...IGF... +.B....... +BD......D +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 4) (7, 0) +(1, 7) (0, 8) +(1, 2) (5, 5) +(8, 8) (1, 8) +(8, 5) (3, 4) +(5, 6) (3, 3) +(4, 6) (4, 4) +(2, 2) (5, 4) +(1, 5) (3, 6) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +FFFFFFFAA +FCCCCCFFA +FCHHHCCFA +FFFFHHCFA +EEEEGHCFA +EIIIGCCFE +EEEIGFFFE +BBEEEEEEE +BDDDDDDDD +""" + +## Raw solver output: +9 9 9 +(8, 4) (8, 3) (8, 2) (8, 1) (8, 0) (7, 0) +(1, 7) (0, 7) (0, 8) +(1, 2) (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (5, 2) (6, 2) (6, 3) (6, 4) (6, 5) (5, 5) +(8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (1, 8) +(8, 5) (8, 6) (8, 7) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) (2, 7) (2, 6) (1, 6) (0, 6) (0, 5) (0, 4) (1, 4) (2, 4) (3, 4) +(5, 6) (6, 6) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (6, 0) (5, 0) (4, 0) (3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (1, 3) (2, 3) (3, 3) +(4, 6) (4, 5) (4, 4) +(2, 2) (3, 2) (4, 2) (4, 3) (5, 3) (5, 4) +(1, 5) (2, 5) (3, 5) (3, 6) + +Touching forbidden +Nodes 84 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 4) (7, 0) +(1, 7) (0, 8) +(1, 2) (5, 5) +(8, 8) (1, 8) +(8, 5) (3, 4) +(5, 6) (3, 3) +(4, 6) (4, 4) +(2, 2) (5, 4) +(1, 5) (3, 6) diff --git a/submodules/flowfree/generated/9x9_9c_8_da5d128a.txt b/submodules/flowfree/generated/9x9_9c_8_da5d128a.txt new file mode 100644 index 0000000000000000000000000000000000000000..a1e478e79e7d79c37bf2dae4f35a1b9e8b05ebf1 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_8_da5d128a.txt @@ -0,0 +1,67 @@ +""" +...GB..BE +......... +......... +.F....... +.A..H.... +.DC...... +...H..A.. +.I..D.... +G...ICFE. +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(6, 6) (1, 4) +(4, 0) (7, 0) +(2, 5) (5, 8) +(1, 5) (4, 7) +(7, 8) (8, 0) +(6, 8) (1, 3) +(3, 0) (0, 8) +(4, 4) (3, 6) +(1, 7) (4, 8) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +GGGGBBBBE +GFFFFFFFE +GFAAAAAFE +GFACCCAFE +GAACHCAFE +GDCCHCAFE +GDDHHCAFE +GIDDDCFFE +GIIIICFEE +""" + +## Raw solver output: +9 9 9 +(6, 6) (6, 5) (6, 4) (6, 3) (6, 2) (5, 2) (4, 2) (3, 2) (2, 2) (2, 3) (2, 4) (1, 4) +(4, 0) (5, 0) (6, 0) (7, 0) +(2, 5) (3, 5) (3, 4) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) (5, 6) (5, 7) (5, 8) +(1, 5) (1, 6) (2, 6) (2, 7) (3, 7) (4, 7) +(7, 8) (8, 8) (8, 7) (8, 6) (8, 5) (8, 4) (8, 3) (8, 2) (8, 1) (8, 0) +(6, 8) (6, 7) (7, 7) (7, 6) (7, 5) (7, 4) (7, 3) (7, 2) (7, 1) (6, 1) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) (1, 2) (1, 3) +(3, 0) (2, 0) (1, 0) (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) +(4, 4) (4, 5) (4, 6) (3, 6) +(1, 7) (1, 8) (2, 8) (3, 8) (4, 8) + +Touching forbidden +Nodes 82 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(6, 6) (1, 4) +(4, 0) (7, 0) +(2, 5) (5, 8) +(1, 5) (4, 7) +(7, 8) (8, 0) +(6, 8) (1, 3) +(3, 0) (0, 8) +(4, 4) (3, 6) +(1, 7) (4, 8) diff --git a/submodules/flowfree/generated/9x9_9c_9_503c7f99.txt b/submodules/flowfree/generated/9x9_9c_9_503c7f99.txt new file mode 100644 index 0000000000000000000000000000000000000000..91b5c7dd8cd69e688955a7ec8b8d17a95182400a --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_9_503c7f99.txt @@ -0,0 +1,67 @@ +""" +...B..... +EH..A...A +....F.G.. +H......G. +......... +...D...CI +..D...... +....CBF.. +..E.....I +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 1) (4, 1) +(3, 0) (5, 7) +(4, 7) (7, 5) +(2, 6) (3, 5) +(0, 1) (2, 8) +(6, 7) (4, 2) +(6, 2) (7, 3) +(1, 1) (0, 3) +(8, 5) (8, 8) + + param line: 9 9 9 0 2 1 1000000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEBAAAAA +EHEBAFFFA +HHEBFFGFF +HEEBBBGGF +EECCCBFFF +ECCDCBFCI +ECDDCBFCI +ECCCCBFCI +EEECCCCCI +""" + +## Raw solver output: +9 9 9 +(8, 1) (8, 0) (7, 0) (6, 0) (5, 0) (4, 0) (4, 1) +(3, 0) (3, 1) (3, 2) (3, 3) (4, 3) (5, 3) (5, 4) (5, 5) (5, 6) (5, 7) +(4, 7) (4, 6) (4, 5) (4, 4) (3, 4) (2, 4) (2, 5) (1, 5) (1, 6) (1, 7) (2, 7) (3, 7) (3, 8) (4, 8) (5, 8) (6, 8) (7, 8) (7, 7) (7, 6) (7, 5) +(2, 6) (3, 6) (3, 5) +(0, 1) (0, 0) (1, 0) (2, 0) (2, 1) (2, 2) (2, 3) (1, 3) (1, 4) (0, 4) (0, 5) (0, 6) (0, 7) (0, 8) (1, 8) (2, 8) +(6, 7) (6, 6) (6, 5) (6, 4) (7, 4) (8, 4) (8, 3) (8, 2) (7, 2) (7, 1) (6, 1) (5, 1) (5, 2) (4, 2) +(6, 2) (6, 3) (7, 3) +(1, 1) (1, 2) (0, 2) (0, 3) +(8, 5) (8, 6) (8, 7) (8, 8) + +Touching forbidden +Nodes 101 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 1) (4, 1) +(3, 0) (5, 7) +(4, 7) (7, 5) +(2, 6) (3, 5) +(0, 1) (2, 8) +(6, 7) (4, 2) +(6, 2) (7, 3) +(1, 1) (0, 3) +(8, 5) (8, 8) diff --git a/submodules/flowfree/generated/9x9_9c_9_e082bc41.txt b/submodules/flowfree/generated/9x9_9c_9_e082bc41.txt new file mode 100644 index 0000000000000000000000000000000000000000..e441b733ef0d0c7a958ce306a83ceaf373251af7 --- /dev/null +++ b/submodules/flowfree/generated/9x9_9c_9_e082bc41.txt @@ -0,0 +1,67 @@ +""" +......HGA +.BC..D... +.....F... +......... +.B.....G. +.......IA +..E.H.D.C +...F..I.. +.E....... +""" + +# ---- raw puzzle block (for reproducibility) ---- +9 9 9 +(8, 0) (8, 5) +(1, 1) (1, 4) +(8, 6) (2, 1) +(5, 1) (6, 6) +(1, 8) (2, 6) +(3, 7) (5, 2) +(7, 4) (7, 0) +(6, 0) (4, 6) +(6, 7) (7, 5) + + param line: 9 9 9 0 2 1 1000 + +# ---- solution (appended by solve_generated.py) ---- +## Human-readable solution: +""" +EEEEHHHGA +EBCEHDDGA +EBCEHFDGA +EBCEHFDGA +EBCEHFDGA +ECCEHFDIA +ECEEHFDIC +ECCFFFIIC +EECCCCCCC +""" + +## Raw solver output: +9 9 9 +(8, 0) (8, 1) (8, 2) (8, 3) (8, 4) (8, 5) +(1, 1) (1, 2) (1, 3) (1, 4) +(8, 6) (8, 7) (8, 8) (7, 8) (6, 8) (5, 8) (4, 8) (3, 8) (2, 8) (2, 7) (1, 7) (1, 6) (1, 5) (2, 5) (2, 4) (2, 3) (2, 2) (2, 1) +(5, 1) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) +(1, 8) (0, 8) (0, 7) (0, 6) (0, 5) (0, 4) (0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (3, 1) (3, 2) (3, 3) (3, 4) (3, 5) (3, 6) (2, 6) +(3, 7) (4, 7) (5, 7) (5, 6) (5, 5) (5, 4) (5, 3) (5, 2) +(7, 4) (7, 3) (7, 2) (7, 1) (7, 0) +(6, 0) (5, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (4, 5) (4, 6) +(6, 7) (7, 7) (7, 6) (7, 5) + +Touching forbidden +Nodes 84 +Solutions 1 + +## Solver input (raw puzzle block): +9 9 9 +(8, 0) (8, 5) +(1, 1) (1, 4) +(8, 6) (2, 1) +(5, 1) (6, 6) +(1, 8) (2, 6) +(3, 7) (5, 2) +(7, 4) (7, 0) +(6, 0) (4, 6) +(6, 7) (7, 5) diff --git a/submodules/flowfree/make.sh b/submodules/flowfree/make.sh new file mode 100644 index 0000000000000000000000000000000000000000..8ec669c809f4026a64ae89ad9cd52e7c9271f415 --- /dev/null +++ b/submodules/flowfree/make.sh @@ -0,0 +1,6 @@ +make -f convert_raetsel.make +make -f convert_raetsel_debug.make +make -f convert_thomasahle.make +make -f convert_thomasahle_debug.make +make -f flowfree.make +make -f flowfree_debug.make diff --git a/submodules/flowfree/puzzles/flowfree_11x11_210.txt b/submodules/flowfree/puzzles/flowfree_11x11_210.txt new file mode 100644 index 0000000000000000000000000000000000000000..b3177fbd8bc5882d6be2e028385de390121611da --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_11x11_210.txt @@ -0,0 +1,10 @@ +9 11 11 +(5, 0) (5, 6) +(6, 0) (10, 10) +(4, 1) (2, 5) +(2, 2) (6, 4) +(3, 2) (6, 2) +(4, 2) (9, 10) +(7, 2) (2, 9) +(8, 2) (5, 7) +(3, 5) (1, 9) diff --git a/submodules/flowfree/puzzles/flowfree_11x9_random.txt b/submodules/flowfree/puzzles/flowfree_11x9_random.txt new file mode 100644 index 0000000000000000000000000000000000000000..0862581a81627bbb176cc026a0a0e4dbbd5a5231 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_11x9_random.txt @@ -0,0 +1,8 @@ +7 11 9 +(10, 8) (4, 1) +(8, 4) (4, 4) +(8, 1) (2, 5) +(10, 7) (2, 6) +(9, 1) (6, 4) +(1, 1) (9, 6) +(10, 4) (3, 0) diff --git a/submodules/flowfree/puzzles/flowfree_12x12_extreme_10.txt b/submodules/flowfree/puzzles/flowfree_12x12_extreme_10.txt new file mode 100644 index 0000000000000000000000000000000000000000..8cb4f2580319cc7ab32103bab5adfce252b4282e --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_12x12_extreme_10.txt @@ -0,0 +1,8 @@ +7 12 12 +(0, 0) (6, 6) +(8, 2) (7, 9) +(7, 4) (1, 10) +(5, 4) (5, 9) +(1, 5) (3, 9) +(2, 5) (4, 9) +(1, 6) (7, 8) diff --git a/submodules/flowfree/puzzles/flowfree_14x14_300.txt b/submodules/flowfree/puzzles/flowfree_14x14_300.txt new file mode 100644 index 0000000000000000000000000000000000000000..9ec217d0a17bf9829f3b7f1680396f419ea838a3 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_14x14_300.txt @@ -0,0 +1,10 @@ +9 14 14 +(1, 1) (12, 7) +(11, 2) (4, 7) +(3, 4) (1, 12) +(7, 5) (0, 13) +(5, 7) (13, 11) +(6, 7) (12, 11) +(2, 12) (13, 13) +(6, 12) (12, 13) +(10, 12) (1, 13) diff --git a/submodules/flowfree/puzzles/flowfree_16x16_100.txt b/submodules/flowfree/puzzles/flowfree_16x16_100.txt new file mode 100644 index 0000000000000000000000000000000000000000..4b28becbdb8645ee774a5eda4e13f52c0fb3c25c --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_16x16_100.txt @@ -0,0 +1,9 @@ +8 16 16 +(15, 1) (2, 2) +(11, 1) (3, 12) +(8, 4) (11, 4) +(7, 5) (6, 14) +(12, 1) (6, 3) +(15, 0) (11, 5) +(5, 0) (11, 11) +(10, 7) (6, 13) diff --git a/submodules/flowfree/puzzles/flowfree_6x6_random.txt b/submodules/flowfree/puzzles/flowfree_6x6_random.txt new file mode 100644 index 0000000000000000000000000000000000000000..4af4ab06a1926b914f6c29e460b9f17b0560a510 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_6x6_random.txt @@ -0,0 +1,7 @@ +6 6 6 +(0, 0) (4, 5) +(3, 2) (2, 1) +(2, 3) (4, 4) +(5, 0) (3, 4) +(3, 1) (5, 1) +(4, 2) (5, 5) diff --git a/submodules/flowfree/puzzles/flowfree_7x7_random1.txt b/submodules/flowfree/puzzles/flowfree_7x7_random1.txt new file mode 100644 index 0000000000000000000000000000000000000000..077d026826df2a4cf8909bb8fe3bbe61862699d4 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_7x7_random1.txt @@ -0,0 +1,8 @@ +7 7 7 +(3, 1) (2, 2) +(1, 4) (0, 2) +(5, 4) (5, 5) +(5, 1) (2, 3) +(1, 1) (6, 1) +(2, 4) (4, 5) +(0, 3) (4, 6) diff --git a/submodules/flowfree/puzzles/flowfree_7x7_random2.txt b/submodules/flowfree/puzzles/flowfree_7x7_random2.txt new file mode 100644 index 0000000000000000000000000000000000000000..6f44b988fe2b7eb70ae1cd2efe25879645d4069a --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_7x7_random2.txt @@ -0,0 +1,8 @@ +7 7 7 +(0, 0) (2, 5) +(0, 6) (0, 3) +(6, 6) (1, 0) +(4, 4) (3, 2) +(3, 5) (5, 6) +(5, 3) (4, 5) +(5, 1) (3, 3) diff --git a/submodules/flowfree/puzzles/flowfree_7x7_random3.txt b/submodules/flowfree/puzzles/flowfree_7x7_random3.txt new file mode 100644 index 0000000000000000000000000000000000000000..dc66a0f6d98705165c486e973adad572a836a836 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_7x7_random3.txt @@ -0,0 +1,8 @@ +7 7 7 +(0, 3) (0, 0) +(5, 2) (1, 5) +(1, 0) (1, 3) +(6, 0) (2, 1) +(3, 1) (2, 5) +(2, 2) (0, 6) +(6, 3) (5, 5) diff --git a/submodules/flowfree/puzzles/flowfree_7x7_random4.txt b/submodules/flowfree/puzzles/flowfree_7x7_random4.txt new file mode 100644 index 0000000000000000000000000000000000000000..4363dd220d67517da8ed92bfc13eb8ef80066a77 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_7x7_random4.txt @@ -0,0 +1,8 @@ +7 7 7 +(4, 5) (6, 0) +(0, 3) (0, 6) +(5, 2) (5, 5) +(4, 2) (3, 4) +(2, 2) (4, 0) +(6, 1) (1, 1) +(1, 0) (0, 2) diff --git a/submodules/flowfree/puzzles/flowfree_7x7_random5.txt b/submodules/flowfree/puzzles/flowfree_7x7_random5.txt new file mode 100644 index 0000000000000000000000000000000000000000..8ee1894b02b54b9714772258b00c5b3e6da7b7c7 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_7x7_random5.txt @@ -0,0 +1,8 @@ +7 7 7 +(5, 0) (5, 5) +(2, 3) (1, 1) +(2, 4) (4, 5) +(6, 2) (1, 2) +(1, 0) (3, 1) +(6, 0) (4, 3) +(0, 0) (0, 6) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_120.txt b/submodules/flowfree/puzzles/flowfree_8x8_120.txt new file mode 100644 index 0000000000000000000000000000000000000000..f3ac6e8b86423bb3825107ae620fb9812bb4dd42 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_120.txt @@ -0,0 +1,9 @@ +8 8 8 +(7, 0) (1, 1) +(2, 2) (0, 4) +(3, 2) (1, 6) +(4, 2) (5, 6) +(0, 3) (6, 3) +(2, 3) (2, 7) +(5, 5) (7, 5) +(6, 6) (3, 7) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random1.txt b/submodules/flowfree/puzzles/flowfree_8x8_random1.txt new file mode 100644 index 0000000000000000000000000000000000000000..2658146787a982ca5ac74a6ae5109b94a43f8cf8 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random1.txt @@ -0,0 +1,9 @@ +8 8 8 +(1, 1) (6, 1) +(2, 5) (4, 6) +(4, 7) (4, 4) +(7, 0) (7, 6) +(2, 3) (0, 7) +(6, 2) (3, 5) +(3, 0) (2, 2) +(0, 6) (1, 3) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random2.txt b/submodules/flowfree/puzzles/flowfree_8x8_random2.txt new file mode 100644 index 0000000000000000000000000000000000000000..1d220e0a7b24a98679659c8b4d21a745810e084b --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random2.txt @@ -0,0 +1,9 @@ +8 8 8 +(7, 6) (6, 3) +(3, 6) (1, 2) +(7, 4) (4, 2) +(5, 7) (2, 3) +(3, 1) (6, 2) +(2, 0) (7, 0) +(2, 5) (7, 7) +(2, 4) (5, 5) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random3.txt b/submodules/flowfree/puzzles/flowfree_8x8_random3.txt new file mode 100644 index 0000000000000000000000000000000000000000..5443c0278497cccd5c9dfc1502d6e22b8850997e --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random3.txt @@ -0,0 +1,9 @@ +8 8 8 +(3, 1) (4, 4) +(2, 4) (5, 5) +(7, 0) (0, 1) +(7, 3) (4, 6) +(1, 3) (3, 6) +(7, 2) (4, 3) +(3, 7) (2, 1) +(5, 2) (6, 5) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random4.txt b/submodules/flowfree/puzzles/flowfree_8x8_random4.txt new file mode 100644 index 0000000000000000000000000000000000000000..906b55070f1dfa4b1a27b6807d20e5f1b0b2b496 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random4.txt @@ -0,0 +1,9 @@ +8 8 8 +(4, 7) (6, 4) +(1, 0) (0, 5) +(1, 1) (7, 0) +(7, 5) (3, 5) +(1, 3) (4, 2) +(1, 4) (2, 7) +(3, 1) (7, 1) +(7, 4) (5, 2) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random5.txt b/submodules/flowfree/puzzles/flowfree_8x8_random5.txt new file mode 100644 index 0000000000000000000000000000000000000000..99bc19ccb253fc96ca4ed66f8dbfef45ebbc9ee7 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random5.txt @@ -0,0 +1,9 @@ +8 8 8 +(3, 5) (5, 1) +(4, 5) (6, 2) +(0, 1) (3, 0) +(0, 6) (5, 7) +(3, 1) (0, 2) +(5, 0) (0, 3) +(7, 4) (6, 6) +(6, 5) (1, 4) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random6.txt b/submodules/flowfree/puzzles/flowfree_8x8_random6.txt new file mode 100644 index 0000000000000000000000000000000000000000..5961411c632c61a5c7b74809107ca39f0160a980 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random6.txt @@ -0,0 +1,9 @@ +8 8 8 +(6, 7) (0, 6) +(0, 3) (5, 6) +(7, 7) (7, 3) +(0, 2) (3, 1) +(3, 3) (6, 1) +(3, 0) (0, 1) +(1, 5) (4, 6) +(0, 5) (5, 4) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random7.txt b/submodules/flowfree/puzzles/flowfree_8x8_random7.txt new file mode 100644 index 0000000000000000000000000000000000000000..e02c736022803df16a7afabd53c043db7242321e --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random7.txt @@ -0,0 +1,9 @@ +8 8 8 +(6, 3) (4, 5) +(4, 0) (0, 0) +(5, 2) (3, 5) +(5, 4) (4, 6) +(1, 6) (2, 2) +(2, 3) (6, 2) +(4, 7) (6, 4) +(7, 5) (7, 2) diff --git a/submodules/flowfree/puzzles/flowfree_8x8_random8.txt b/submodules/flowfree/puzzles/flowfree_8x8_random8.txt new file mode 100644 index 0000000000000000000000000000000000000000..a1ebcad5ea0b2efd4f0d99fb367bbad69a59604d --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_8x8_random8.txt @@ -0,0 +1,9 @@ +8 8 8 +(2, 4) (5, 4) +(5, 2) (6, 6) +(0, 0) (1, 2) +(5, 3) (3, 6) +(5, 1) (1, 6) +(5, 0) (3, 2) +(3, 7) (5, 6) +(1, 1) (3, 5) diff --git a/submodules/flowfree/puzzles/flowfree_9x9_random.txt b/submodules/flowfree/puzzles/flowfree_9x9_random.txt new file mode 100644 index 0000000000000000000000000000000000000000..a0471a7a3e95008066c235faa9bf4ce4c56e56b4 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_9x9_random.txt @@ -0,0 +1,10 @@ +9 9 9 +(3, 5) (3, 2) +(7, 8) (0, 6) +(0, 3) (4, 4) +(3, 0) (7, 1) +(0, 4) (6, 6) +(4, 1) (0, 0) +(7, 7) (6, 3) +(1, 1) (2, 3) +(8, 8) (7, 2) diff --git a/submodules/flowfree/puzzles/flowfree_example1.txt b/submodules/flowfree/puzzles/flowfree_example1.txt new file mode 100644 index 0000000000000000000000000000000000000000..6e13f55fd87a829bcdd300eeec9177ebabb1749c --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_example1.txt @@ -0,0 +1,6 @@ +5 5 5 +(1, 0) (0, 3) +(2, 0) (0, 4) +(3, 0) (3, 4) +(3, 1) (2, 2) +(2, 4) (3, 3) diff --git a/submodules/flowfree/puzzles/flowfree_example2.txt b/submodules/flowfree/puzzles/flowfree_example2.txt new file mode 100644 index 0000000000000000000000000000000000000000..0b587cdd8f50abde85736816c7b449163cf22a82 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_example2.txt @@ -0,0 +1,6 @@ +5 6 6 +(0, 2) (2, 0) +(1, 1) (4, 4) +(4, 0) (1, 4) +(5, 0) (4, 1) +(1, 2) (2, 5) diff --git a/submodules/flowfree/puzzles/flowfree_huge.txt b/submodules/flowfree/puzzles/flowfree_huge.txt new file mode 100644 index 0000000000000000000000000000000000000000..222dfdf541f216a9591d37927e7e0b9a3f3b1c36 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_huge.txt @@ -0,0 +1,5 @@ +4 1002 1002 +(0, 0) (500, 500) +(0, 1001) (500, 501) +(501, 500) (1001, 0) +(501, 501) (1001, 1001) diff --git a/submodules/flowfree/puzzles/flowfree_killer.txt b/submodules/flowfree/puzzles/flowfree_killer.txt new file mode 100644 index 0000000000000000000000000000000000000000..e457417eee663b8f052ab1589bb7a9c5203b4e02 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_killer.txt @@ -0,0 +1,61 @@ +60 51 8 +(1, 1) (3, 2) +(3, 1) (1, 2) +(4, 0) (0, 3) +(6, 1) (8, 2) +(8, 1) (6, 2) +(9, 0) (5, 3) +(11, 1) (13, 2) +(13, 1) (11, 2) +(14, 0) (10, 3) +(16, 1) (18, 2) +(18, 1) (16, 2) +(19, 0) (15, 3) +(21, 1) (23, 2) +(23, 1) (21, 2) +(24, 0) (20, 3) +(26, 1) (28, 2) +(28, 1) (26, 2) +(29, 0) (25, 3) +(31, 1) (33, 2) +(33, 1) (31, 2) +(34, 0) (30, 3) +(36, 1) (38, 2) +(38, 1) (36, 2) +(39, 0) (35, 3) +(41, 1) (43, 2) +(43, 1) (41, 2) +(44, 0) (40, 3) +(46, 1) (48, 2) +(48, 1) (46, 2) +(49, 0) (45, 3) +(1, 5) (3, 6) +(3, 5) (1, 6) +(4, 4) (0, 7) +(6, 5) (8, 6) +(8, 5) (6, 6) +(9, 4) (5, 7) +(11, 5) (13, 6) +(13, 5) (11, 6) +(14, 4) (10, 7) +(16, 5) (18, 6) +(18, 5) (16, 6) +(19, 4) (15, 7) +(21, 5) (23, 6) +(23, 5) (21, 6) +(24, 4) (20, 7) +(26, 5) (28, 6) +(28, 5) (26, 6) +(29, 4) (25, 7) +(31, 5) (33, 6) +(33, 5) (31, 6) +(34, 4) (30, 7) +(36, 5) (38, 6) +(38, 5) (36, 6) +(39, 4) (35, 7) +(41, 5) (43, 6) +(43, 5) (41, 6) +(44, 4) (40, 7) +(46, 5) (48, 6) +(48, 5) (46, 6) +(49, 4) (45, 7) diff --git a/submodules/flowfree/puzzles/flowfree_large.txt b/submodules/flowfree/puzzles/flowfree_large.txt new file mode 100644 index 0000000000000000000000000000000000000000..913e7bd4eff1f9ddb0c491df3f53ab5b7fe36986 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_large.txt @@ -0,0 +1,63 @@ +62 122 123 +(61, 60) (61, 62) +(62, 60) (62, 62) +(63, 60) (63, 62) +(64, 60) (64, 62) +(65, 60) (65, 62) +(66, 60) (66, 62) +(67, 60) (67, 62) +(68, 60) (68, 62) +(69, 60) (69, 62) +(70, 60) (70, 62) +(71, 60) (71, 62) +(72, 60) (72, 62) +(73, 60) (73, 62) +(74, 60) (74, 62) +(75, 60) (75, 62) +(76, 60) (76, 62) +(77, 60) (77, 62) +(78, 60) (78, 62) +(79, 60) (79, 62) +(80, 60) (80, 62) +(81, 60) (81, 62) +(82, 60) (82, 62) +(83, 60) (83, 62) +(84, 60) (84, 62) +(85, 60) (85, 62) +(86, 60) (86, 62) +(87, 60) (87, 62) +(88, 60) (88, 62) +(89, 60) (89, 62) +(90, 60) (90, 62) +(91, 60) (91, 62) +(92, 60) (92, 62) +(93, 60) (93, 62) +(94, 60) (94, 62) +(95, 60) (95, 62) +(96, 60) (96, 62) +(97, 60) (97, 62) +(98, 60) (98, 62) +(99, 60) (99, 62) +(100, 60) (100, 62) +(101, 60) (101, 62) +(102, 60) (102, 62) +(103, 60) (103, 62) +(104, 60) (104, 62) +(105, 60) (105, 62) +(106, 60) (106, 62) +(107, 60) (107, 62) +(108, 60) (108, 62) +(109, 60) (109, 62) +(110, 60) (110, 62) +(111, 60) (111, 62) +(112, 60) (112, 62) +(113, 60) (113, 62) +(114, 60) (114, 62) +(115, 60) (115, 62) +(116, 60) (116, 62) +(117, 60) (117, 62) +(118, 60) (118, 62) +(119, 60) (119, 62) +(120, 60) (120, 62) +(121, 60) (121, 62) +(61, 61) (121, 61) diff --git a/submodules/flowfree/puzzles/flowfree_mini.txt b/submodules/flowfree/puzzles/flowfree_mini.txt new file mode 100644 index 0000000000000000000000000000000000000000..b8cb146ebac228f5a87caea5e557d32d2fb12b46 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_mini.txt @@ -0,0 +1,2 @@ +1 2 1 +(0, 0) (1, 0) diff --git a/submodules/flowfree/puzzles/flowfree_nikoli_2010_88.txt b/submodules/flowfree/puzzles/flowfree_nikoli_2010_88.txt new file mode 100644 index 0000000000000000000000000000000000000000..8c9d1bbef5c87d63fcc2c561518840649ed2b7f4 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_nikoli_2010_88.txt @@ -0,0 +1,41 @@ +40 36 20 +(2, 2) (5, 7) +(10, 2) (12, 8) +(11, 2) (7, 6) +(15, 2) (5, 12) +(20, 2) (12, 6) +(24, 2) (28, 12) +(25, 2) (28, 7) +(33, 2) (29, 4) +(6, 3) (20, 17) +(15, 3) (12, 7) +(17, 3) (23, 6) +(18, 3) (28, 13) +(20, 3) (6, 4) +(29, 3) (30, 7) +(3, 4) (31, 7) +(32, 4) (30, 12) +(3, 5) (23, 11) +(32, 5) (33, 17) +(16, 6) (15, 16) +(19, 6) (15, 17) +(28, 6) (23, 13) +(4, 7) (6, 16) +(7, 7) (4, 12) +(23, 7) (17, 8) +(18, 8) (17, 11) +(23, 8) (18, 11) +(15, 9) (20, 10) +(20, 9) (25, 17) +(15, 10) (12, 11) +(7, 12) (11, 17) +(12, 12) (17, 16) +(23, 12) (32, 14) +(31, 12) (32, 15) +(7, 13) (10, 17) +(12, 13) (19, 13) +(16, 13) (18, 16) +(3, 14) (2, 17) +(3, 15) (6, 15) +(29, 15) (20, 16) +(29, 16) (24, 17) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_aiko.txt b/submodules/flowfree/puzzles/flowfree_oxford_aiko.txt new file mode 100644 index 0000000000000000000000000000000000000000..93dd7efe78a1b4ef1cdfb4448a2a5d87c55f2914 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_aiko.txt @@ -0,0 +1,8 @@ +7 10 10 +(2, 1) (2, 8) +(2, 2) (3, 7) +(3, 1) (7, 8) +(3, 2) (7, 7) +(3, 8) (6, 7) +(4, 4) (9, 0) +(6, 8) (8, 1) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_extra.txt b/submodules/flowfree/puzzles/flowfree_oxford_extra.txt new file mode 100644 index 0000000000000000000000000000000000000000..3327166864fd851f955767a5efa1129b3fcbc0ac --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_extra.txt @@ -0,0 +1,29 @@ +28 36 20 +(8, 15) (6, 19) +(0, 0) (35, 19) +(3, 2) (0, 19) +(6, 0) (1, 5) +(1, 14) (10, 16) +(2, 9) (7, 11) +(2, 10) (17, 16) +(21, 9) (3, 17) +(21, 1) (4, 9) +(18, 8) (4, 10) +(25, 3) (20, 7) +(25, 10) (28, 11) +(10, 3) (34, 5) +(32, 2) (25, 16) +(27, 4) (31, 9) +(33, 10) (27, 15) +(14, 10) (15, 12) +(34, 14) (32, 17) +(33, 9) (29, 19) +(31, 10) (14, 18) +(25, 9) (17, 11) +(29, 0) (7, 8) +(28, 8) (10, 9) +(23, 10) (21, 18) +(35, 0) (10, 10) +(14, 1) (18, 3) +(17, 3) (8, 4) +(12, 9) (18, 16) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_loopy.txt b/submodules/flowfree/puzzles/flowfree_oxford_loopy.txt new file mode 100644 index 0000000000000000000000000000000000000000..f637ca70eb10371fec48bed068503bfeb4ebee19 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_loopy.txt @@ -0,0 +1,6 @@ +5 8 8 +(2, 1) (5, 1) +(2, 2) (2, 5) +(3, 1) (3, 5) +(4, 1) (4, 5) +(5, 2) (5, 5) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_minispi.txt b/submodules/flowfree/puzzles/flowfree_oxford_minispi.txt new file mode 100644 index 0000000000000000000000000000000000000000..096b9ee7fab8eb4b4cbd3338269f178afc9e4258 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_minispi.txt @@ -0,0 +1,3 @@ +2 9 9 +(4, 4) (8, 0) +(5, 5) (8, 1) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_nyoroppyi.txt b/submodules/flowfree/puzzles/flowfree_oxford_nyoroppyi.txt new file mode 100644 index 0000000000000000000000000000000000000000..4b88eb105835b63f972572bc815b81cb8d7fe9d0 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_nyoroppyi.txt @@ -0,0 +1,10 @@ +9 18 10 +(0, 0) (17, 9) +(2, 1) (15, 8) +(2, 3) (14, 0) +(2, 7) (11, 1) +(4, 8) (12, 6) +(6, 2) (12, 4) +(6, 8) (16, 3) +(8, 5) (13, 2) +(14, 7) (16, 1) diff --git a/submodules/flowfree/puzzles/flowfree_oxford_spiral10.txt b/submodules/flowfree/puzzles/flowfree_oxford_spiral10.txt new file mode 100644 index 0000000000000000000000000000000000000000..9ad59b11f031dd569c09869325f23176572076b7 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_oxford_spiral10.txt @@ -0,0 +1,3 @@ +2 10 10 +(0, 9) (5, 5) +(4, 4) (9, 0) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_110a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_110a.txt new file mode 100644 index 0000000000000000000000000000000000000000..257cdbc02b8b16b2f20adf8a088374c0696d8ee6 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_110a.txt @@ -0,0 +1,63 @@ +62 42 25 +(41, 0) (0, 24) +(1, 20) (3, 22) +(14, 8) (2, 21) +(3, 6) (15, 20) +(2, 2) (7, 11) +(7, 14) (5, 17) +(5, 7) (6, 16) +(6, 14) (5, 15) +(5, 14) (8, 18) +(13, 2) (5, 10) +(5, 9) (6, 11) +(13, 1) (5, 8) +(5, 6) (16, 7) +(5, 5) (12, 18) +(17, 4) (9, 18) +(14, 5) (11, 14) +(15, 2) (14, 6) +(21, 2) (16, 5) +(15, 5) (19, 11) +(20, 18) (20, 20) +(24, 10) (21, 17) +(19, 16) (21, 16) +(26, 16) (36, 19) +(39, 3) (36, 18) +(32, 1) (36, 17) +(33, 10) (36, 16) +(36, 15) (25, 17) +(36, 14) (27, 19) +(29, 13) (29, 20) +(27, 15) (29, 19) +(27, 16) (29, 18) +(23, 8) (23, 14) +(25, 5) (23, 7) +(23, 3) (23, 6) +(25, 6) (26, 9) +(17, 15) (18, 17) +(18, 18) (22, 20) +(20, 15) (24, 19) +(38, 2) (25, 19) +(26, 19) (25, 22) +(15, 8) (18, 16) +(16, 8) (21, 13) +(25, 16) (27, 18) +(24, 15) (21, 18) +(32, 9) (30, 13) +(29, 4) (36, 10) +(31, 4) (37, 8) +(30, 6) (24, 20) +(36, 2) (40, 4) +(28, 2) (25, 15) +(28, 10) (24, 14) +(22, 8) (19, 12) +(21, 6) (20, 8) +(20, 7) (20, 11) +(20, 6) (19, 10) +(18, 2) (25, 4) +(25, 7) (29, 8) +(36, 9) (35, 11) +(31, 3) (32, 5) +(20, 2) (18, 4) +(19, 2) (18, 3) +(16, 2) (16, 4) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_127a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_127a.txt new file mode 100644 index 0000000000000000000000000000000000000000..2f4ceb1533689a5dc401aa9942e33532279f2e92 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_127a.txt @@ -0,0 +1,8 @@ +7 15 15 +(8, 1) (3, 11) +(2, 2) (12, 4) +(1, 2) (7, 14) +(3, 3) (13, 8) +(1, 1) (11, 3) +(12, 3) (4, 10) +(10, 0) (8, 11) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_158a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_158a.txt new file mode 100644 index 0000000000000000000000000000000000000000..1a1b36144949208ab964df864e57579a95898834 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_158a.txt @@ -0,0 +1,7 @@ +6 12 12 +(8, 4) (5, 9) +(3, 0) (11, 11) +(0, 4) (6, 8) +(11, 0) (4, 7) +(0, 5) (6, 7) +(1, 1) (3, 10) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_160a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_160a.txt new file mode 100644 index 0000000000000000000000000000000000000000..202a50405e063aa894feb64d6ffb59190c3dab8c --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_160a.txt @@ -0,0 +1,6 @@ +5 12 12 +(11, 0) (0, 11) +(0, 0) (10, 10) +(2, 7) (11, 8) +(0, 1) (8, 4) +(3, 1) (3, 7) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_179a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_179a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c9c88b93df4fa5e8918f00a8d8b1b5aa9bc89f85 --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_179a.txt @@ -0,0 +1,14 @@ +13 15 15 +(9, 4) (1, 9) +(9, 5) (12, 5) +(9, 6) (10, 9) +(9, 7) (12, 12) +(7, 3) (5, 7) +(3, 2) (5, 8) +(2, 2) (5, 9) +(13, 5) (5, 10) +(4, 5) (2, 9) +(5, 5) (9, 9) +(12, 2) (6, 5) +(7, 11) (11, 12) +(8, 9) (2, 12) diff --git a/submodules/flowfree/puzzles/flowfree_raetsel_190a.txt b/submodules/flowfree/puzzles/flowfree_raetsel_190a.txt new file mode 100644 index 0000000000000000000000000000000000000000..c335693475912f348df3d6c9ab93d0675863851b --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_raetsel_190a.txt @@ -0,0 +1,41 @@ +40 48 35 +(8, 8) (27, 19) +(11, 2) (0, 24) +(11, 3) (6, 23) +(14, 0) (6, 22) +(10, 7) (7, 23) +(11, 8) (16, 18) +(15, 13) (27, 18) +(17, 13) (28, 18) +(19, 4) (20, 21) +(20, 6) (24, 22) +(20, 9) (25, 18) +(30, 3) (22, 21) +(22, 16) (18, 17) +(7, 22) (20, 22) +(0, 22) (5, 22) +(0, 23) (5, 23) +(7, 24) (6, 25) +(2, 27) (10, 27) +(5, 25) (5, 29) +(9, 27) (10, 28) +(12, 26) (12, 31) +(12, 28) (20, 28) +(21, 28) (29, 28) +(29, 30) (26, 31) +(12, 25) (12, 27) +(34, 26) (29, 29) +(30, 32) (35, 33) +(35, 26) (35, 32) +(36, 31) (45, 31) +(36, 30) (45, 30) +(38, 30) (43, 30) +(44, 3) (37, 19) +(44, 4) (36, 19) +(44, 5) (36, 22) +(44, 6) (43, 25) +(44, 7) (37, 24) +(44, 8) (44, 28) +(44, 9) (36, 29) +(44, 10) (38, 19) +(37, 27) (44, 27) diff --git a/submodules/flowfree/puzzles/flowfree_wikipedia.txt b/submodules/flowfree/puzzles/flowfree_wikipedia.txt new file mode 100644 index 0000000000000000000000000000000000000000..6ca1fa316b19ace447ecfeacbf7397f17de6709c --- /dev/null +++ b/submodules/flowfree/puzzles/flowfree_wikipedia.txt @@ -0,0 +1,6 @@ +5 7 7 +(3, 0) (4, 6) +(1, 1) (3, 2) +(4, 1) (0, 6) +(5, 1) (3, 3) +(4, 2) (2, 5) diff --git a/submodules/flowfree/solve_generated.py b/submodules/flowfree/solve_generated.py new file mode 100644 index 0000000000000000000000000000000000000000..425c390d38aadf120b606fff96d81ff713388ea7 --- /dev/null +++ b/submodules/flowfree/solve_generated.py @@ -0,0 +1,248 @@ +#!/usr/bin/env python3 +import argparse +import os +import platform +import re +import subprocess +from pathlib import Path +from typing import Optional, Tuple +import sys + +RAW_HEADER_RE = re.compile(r'^\s*#\s*----\s*raw\s*puzzle\s*block', re.IGNORECASE) + +def detect_solver_bin_name() -> str: + return "flowfree.exe" if platform.system().lower().startswith("win") else "flowfree" + +def needs_rebuild(src: Path, bin_: Path) -> bool: + if not bin_.exists(): + return True + try: + return src.stat().st_mtime > bin_.stat().st_mtime + except FileNotFoundError: + return True + +def build_solver(src: Path, bin_: Path) -> None: + print(f"[build] compiling {src.name} -> {bin_.name}") + if platform.system().lower().startswith("win"): + # Prefer gcc from MSYS2/MinGW if available + cmd = ["gcc", "-std=c11", "-O2", "-Wall", "-Wextra", "-o", str(bin_), str(src)] + else: + cmd = ["gcc", "-std=c11", "-O2", "-Wall", "-Wextra", "-o", str(bin_), str(src)] + try: + subprocess.run(cmd, check=True) + except FileNotFoundError as e: + raise SystemExit( + "Error: C compiler not found (gcc). Install gcc or build the solver manually." + ) from e + except subprocess.CalledProcessError as e: + raise SystemExit(f"Build failed with exit code {e.returncode}") + +def extract_puzzle_block(text: str) -> Optional[str]: + """ + Returns the exact text to feed the solver in solver mode: + " \n" + "\n" + ... + "\n" + """ + lines = text.splitlines() + n = len(lines) + i = 0 + while i < n: + if RAW_HEADER_RE.search(lines[i]): + i += 1 + # Skip blank lines after the header + while i < n and not lines[i].strip(): + i += 1 + if i >= n: + return None + # Expect " " + header_match = re.match(r'^\s*(\d+)\s+(\d+)\s+(\d+)\s*$', lines[i]) + if not header_match: + return None + colors_n = int(header_match.group(1)) + cols_n = int(header_match.group(2)) + rows_n = int(header_match.group(3)) + i += 1 + + # Collect the next colors_n non-empty lines that look like coordinate pairs + pairs = [] + while i < n and len(pairs) < colors_n: + line = lines[i].strip() + if line: + # Accept anything that starts with '(' as a pair line + if line.startswith("("): + pairs.append(line) + else: + # If we encounter something else before collecting enough pairs, abort + return None + i += 1 + + if len(pairs) != colors_n: + return None + + puzzle = f"{colors_n} {cols_n} {rows_n}\n" + "\n".join(pairs) + "\n" + return puzzle + i += 1 + return None + +def already_has_solution(text: str) -> bool: + return "# ---- solution (appended by solve_generated.py) ----" in text + +def run_solver(bin_path: Path, puzzle_text: str) -> Tuple[str, str, int]: + """Return (stdout, stderr, returncode).""" + try: + proc = subprocess.run( + [str(bin_path)], + input=puzzle_text, + text=True, + capture_output=True, + check=False, + ) + return proc.stdout, proc.stderr, proc.returncode + except FileNotFoundError: + raise SystemExit(f"Solver binary not found: {bin_path}") + + + + + +def convert_with_freeflow(raw_block: str, converter_path='./convert_freeflow.py') -> str: + """ + Pipe the raw block to convert_freeflow.py and capture the human-readable grid. + """ + proc = subprocess.run( + [sys.executable, converter_path], + input=raw_block.encode("utf-8"), + stdout=subprocess.PIPE, + stderr=subprocess.PIPE, + check=False, + ) + if proc.returncode != 0: + # If conversion fails, include stderr for debugging in the saved file + pretty = f'"""CONVERSION FAILED (exit {proc.returncode})"""\n{proc.stderr.decode("utf-8", "replace")}' + else: + pretty = proc.stdout.decode("utf-8", "replace").strip() + return pretty + + +# def process_file(path: Path, solver_bin: Path, dry_run: bool=False) -> str: +# content = path.read_text(encoding="utf-8") +# if already_has_solution(content): +# return f"[skip] {path.name}: solution already appended" + +# puzzle = extract_puzzle_block(content) +# if not puzzle: +# return f"[warn] {path.name}: could not find a valid raw puzzle block" + +# out, err, rc = run_solver(solver_bin, puzzle) +# if rc != 0: +# return f"[fail] {path.name}: solver exit code {rc}\nstderr:\n{err}" + +# append_block = ( +# "\n# ---- solution (appended by solve_generated.py) ----\n" +# "## Solver input:\n" +# + puzzle +# + "\n## Solver output:\n" +# + out.strip() +# + ("\n\n## Solver stderr:\n" + err.strip() if err.strip() else "") +# + "\n" +# ) + +# print(append_block) # For visibility in dry-run mode +# asd + +# if dry_run: +# return f"[dry-run] {path.name}: would append solution" +# else: +# with path.open("a", encoding="utf-8") as f: +# f.write(append_block) +# return f"[ok] {path.name}: solution appended" + + + +def process_file(path: Path, solver_bin: Path, converter_path='./convert_freeflow.py', dry_run: bool=False) -> str: + content = path.read_text(encoding="utf-8") + if already_has_solution(content): + return f"[skip] {path.name}: solution already appended" + + puzzle = extract_puzzle_block(content) + if not puzzle: + return f"[warn] {path.name}: could not find a valid raw puzzle block" + + out, err, rc = run_solver(solver_bin, puzzle) + if rc != 0: + return f"[fail] {path.name}: solver exit code {rc}\nstderr:\n{err}" + + # Make a pretty (human-readable) grid of the solver output + # Note: we pass solver stdout (the solution paths) to the converter. + # print('puzzle') + header = puzzle.splitlines()[0] + # print(puzzle) + # print('soln') + out = header + out + # print(out) + # asd + pretty_solution = convert_with_freeflow(out, str(converter_path)) + + append_block = ( + "\n# ---- solution (appended by solve_generated.py) ----\n" + "## Human-readable solution:\n" + f"{pretty_solution}\n" + "\n## Raw solver output:\n" + f"{out.strip()}\n" + + (f"\n\n## Solver stderr:\n{err.strip()}\n" if err.strip() else "\n") + + "## Solver input (raw puzzle block):\n" + f"{puzzle}" + ) + # print('append_block') + # print(append_block) # For visibility in dry-run mode + # asd + + if dry_run: + # Show what we would append (useful for checking formatting) + print(append_block) + return f"[dry-run] {path.name}: would append solution" + else: + with path.open("a", encoding="utf-8") as f: + f.write(append_block) + return f"[ok] {path.name}: solution appended" + +def main(): + ap = argparse.ArgumentParser(description="Extract raw puzzle blocks, run solver, append solutions to files in generated/") + ap.add_argument("--generated-dir", default="generated", help="Directory with input files (default: generated)") + ap.add_argument("--solver-src", default="flowfree.c", help="C source file for the solver (default: flowfree.c)") + ap.add_argument("--solver-bin", default=None, help="Solver binary name/path (default: auto: flowfree or flowfree.exe)") + ap.add_argument("--dry-run", action="store_true", help="Show what would happen without writing") + args = ap.parse_args() + + gen_dir = Path(args.generated_dir) + if not gen_dir.is_dir(): + raise SystemExit(f"Directory not found: {gen_dir}") + + solver_src = Path(args.solver_src) + solver_bin = Path(args.solver_bin) if args.solver_bin else Path(detect_solver_bin_name()) + + # # Build solver if needed + # if solver_src.exists() and needs_rebuild(solver_src, solver_bin): + # build_solver(solver_src, solver_bin) + # elif not solver_bin.exists(): + # # If no src to build but also no binary, stop + # raise SystemExit(f"Solver binary not found: {solver_bin}. Put it next to this script or provide --solver-bin.") + + # Process all regular files in generated/ + results = [] + for p in sorted(gen_dir.iterdir(), reverse=True): + # temp_path = '/notebooks/multimodal_cot/FlowFree/generated/5x5_3c_1_3b79ecca.txt' + # p = Path(temp_path) + if p.is_file(): + try: + results.append(process_file(p, solver_bin, dry_run=args.dry_run)) + except Exception as e: + results.append(f"[error] {p.name}: {e}") + # break + + print("\n".join(results)) + +if __name__ == "__main__": + main() diff --git a/submodules/flowfree/tests/test_valid_5x5.txt b/submodules/flowfree/tests/test_valid_5x5.txt new file mode 100644 index 0000000000000000000000000000000000000000..b56bddc4ed62231036b5ee8e9f7ce7e5632791f5 --- /dev/null +++ b/submodules/flowfree/tests/test_valid_5x5.txt @@ -0,0 +1,11 @@ +5 5 5 +(1, 0) (0, 3) +(2, 0) (0, 4) +(3, 0) (3, 4) +(3, 1) (2, 2) +(2, 4) (3, 3) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(2, 0) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (0, 4) +(3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (3, 4) +(3, 1) (3, 2) (2, 2) +(2, 4) (2, 3) (3, 3) diff --git a/submodules/flowfree/tests/test_valid_5x5_alt.txt b/submodules/flowfree/tests/test_valid_5x5_alt.txt new file mode 100644 index 0000000000000000000000000000000000000000..a69d25dbc7418abe3eef0b3674277a83be1bb1ef --- /dev/null +++ b/submodules/flowfree/tests/test_valid_5x5_alt.txt @@ -0,0 +1,12 @@ +5 5 5 +(1, 0) (0, 3) +(2, 0) (0, 4) +(3, 0) (3, 4) +(3, 1) (2, 2) +(2, 4) (3, 3) +(1, 0) (0, 0) (0, 1) (0, 2) (0, 3) +(2, 0) (2, 1) (1, 1) (1, 2) (1, 3) (1, 4) (0, 4) +(3, 0) (4, 0) (4, 1) (4, 2) (4, 3) (4, 4) (3, 4) +(3, 1) (3, 2) (2, 2) +(2, 4) (2, 3) (3, 3) + diff --git a/submodules/flowfree/tests/test_valid_8x8.txt b/submodules/flowfree/tests/test_valid_8x8.txt new file mode 100644 index 0000000000000000000000000000000000000000..2fad4656e08f732a3781a62dc986f589a7eec9fa --- /dev/null +++ b/submodules/flowfree/tests/test_valid_8x8.txt @@ -0,0 +1,18 @@ +8 8 8 +(7, 0) (1, 1) +(2, 2) (0, 4) +(3, 2) (1, 6) +(4, 2) (5, 6) +(0, 3) (6, 3) +(2, 3) (2, 7) +(5, 5) (7, 5) +(6, 6) (3, 7) +(7, 0) (7, 1) (7, 2) (7, 3) (7, 4) (6, 4) (5, 4) (5, 3) (5, 2) (5, 1) (4, 1) (3, 1) (2, 1) (1, 1) +(2, 2) (1, 2) (1, 3) (1, 4) (0, 4) +(3, 2) (3, 3) (3, 4) (3, 5) (3, 6) (2, 6) (1, 6) +(4, 2) (4, 3) (4, 4) (4, 5) (4, 6) (5, 6) +(0, 3) (0, 2) (0, 1) (0, 0) (1, 0) (2, 0) (3, 0) (4, 0) (5, 0) (6, 0) (6, 1) (6, 2) (6, 3) +(2, 3) (2, 4) (2, 5) (1, 5) (0, 5) (0, 6) (0, 7) (1, 7) (2, 7) +(5, 5) (6, 5) (7, 5) +(6, 6) (7, 6) (7, 7) (6, 7) (5, 7) (4, 7) (3, 7) + diff --git a/submodules/flowfree/verifier.py b/submodules/flowfree/verifier.py new file mode 100644 index 0000000000000000000000000000000000000000..11513afdd24825eeff9d04794446c885eb87e40b --- /dev/null +++ b/submodules/flowfree/verifier.py @@ -0,0 +1,437 @@ +#!/usr/bin/env python3 +""" +verifier.py + +Verify if a given ASCII board state is a valid solution to a FlowFree puzzle. +Uses the modified solver (flowfree_all_solutions.c) to find all solutions and +compares the given solution against them. +""" + +import argparse +import platform +import re +import subprocess +import sys +from collections import defaultdict +from itertools import chain +from pathlib import Path +from typing import Dict, List, Optional, Tuple + +# Reuse patterns from convert_freeflow.py +HEADER_RE = re.compile(r"^\s*(\d+)\s+(\d+)\s+(\d+)\s*$") +COORD_RE = re.compile(r"\(\s*(\d+)\s*,\s*(\d+)\s*\)") +SOLUTIONS_RE = re.compile(r"^\s*Solutions\s+(\d+)\s*$", re.IGNORECASE) + + +def letter_labels(n): + """Generate letter labels for colors (A, B, C, ..., Z, a, b, ..., z, AA, AB, ...).""" + base = [chr(i) for i in range(ord('A'), ord('Z')+1)] + extra = [chr(i) for i in range(ord('a'), ord('z')+1)] + if n <= len(base) + len(extra): + return list(chain(base, extra))[:n] + labels = list(chain(base, extra)) + i = 0 + while len(labels) < n: + for ch in base: + labels.append(base[i % len(base)] + ch) + if len(labels) == n: + break + i += 1 + return labels + + +def build_all_solutions_solver(src: Path, bin_: Path) -> None: + """Compile the modified solver that outputs all solutions.""" + print(f"[build] compiling {src.name} -> {bin_.name}") + if platform.system().lower().startswith("win"): + cmd = ["gcc", "-std=c11", "-O2", "-Wall", "-Wextra", "-o", str(bin_), str(src)] + else: + cmd = ["gcc", "-std=c11", "-O2", "-Wall", "-Wextra", "-o", str(bin_), str(src)] + try: + subprocess.run(cmd, check=True) + except FileNotFoundError as e: + raise SystemExit( + "Error: C compiler not found (gcc). Install gcc or build the solver manually." + ) from e + except subprocess.CalledProcessError as e: + raise SystemExit(f"Build failed with exit code {e.returncode}") + + +def parse_ascii_board(ascii_str: str) -> Tuple[List[List[str]], int, int]: + """ + Parse ASCII board string to 2D grid. + Returns: (grid as 2D list, cols, rows) + """ + lines = ascii_str.strip().split('\n') + grid = [] + for line in lines: + line = line.strip() + if line: + grid.append(list(line)) + + if not grid: + raise ValueError("Empty board") + + rows = len(grid) + cols = len(grid[0]) if rows > 0 else 0 + + # Validate all rows have same length + for i, row in enumerate(grid): + if len(row) != cols: + raise ValueError(f"Row {i} has length {len(row)}, expected {cols}") + + return grid, cols, rows + + +def extract_endpoints(grid: List[List[str]], cols: int, rows: int) -> Dict[str, List[Tuple[int, int]]]: + """ + Find all endpoint pairs for each color. + Endpoints are cells that appear exactly once or twice per color (the two endpoints). + Returns: dict mapping color labels to list of (x, y) coordinates (col, row, zero-based). + """ + color_positions = defaultdict(list) + + # Find all positions for each color + for y in range(rows): + for x in range(cols): + cell = grid[y][x] + if cell != '.' and cell.strip(): + color_positions[cell].append((x, y)) + + endpoints = {} + for color, positions in color_positions.items(): + if len(positions) == 2: + # Exactly 2 cells - these are the endpoints + endpoints[color] = positions + elif len(positions) == 1: + # Only one cell found - might be a single endpoint visible + # In problem boards, we expect exactly 2 endpoints per color + endpoints[color] = positions + else: + # More than 2 cells - this is a solution board, not a problem board + # For problem boards, we should only have endpoints + raise ValueError(f"Color '{color}' appears {len(positions)} times, expected 2 for problem board") + + return endpoints + + +def convert_to_solver_input(endpoints: Dict[str, List[Tuple[int, int]]], cols: int, rows: int) -> str: + """ + Convert endpoints to solver input format. + Format: + + (x1, y1) (x2, y2) + ... + """ + # Sort colors to ensure consistent ordering + sorted_colors = sorted(endpoints.keys()) + num_colors = len(sorted_colors) + + lines = [f"{num_colors} {cols} {rows}"] + for color in sorted_colors: + positions = endpoints[color] + if len(positions) == 2: + (x1, y1), (x2, y2) = positions + lines.append(f"({x1}, {y1}) ({x2}, {y2})") + elif len(positions) == 1: + # Only one endpoint found - this shouldn't happen in valid puzzles + # But handle it gracefully + (x1, y1) = positions[0] + lines.append(f"({x1}, {y1}) ({x1}, {y1})") # Duplicate as fallback + else: + raise ValueError(f"Color '{color}' has {len(positions)} endpoints, expected 2") + + return "\n".join(lines) + "\n" + + +def run_solver(solver_bin: str, puzzle_input: str) -> Tuple[str, str, int]: + """ + Run the modified C solver with puzzle input. + Returns: (stdout, stderr, returncode) + """ + # Resolve path to absolute + solver_path = Path(solver_bin).resolve() + if not solver_path.exists(): + raise SystemExit(f"Solver binary not found: {solver_path}") + + try: + proc = subprocess.run( + [str(solver_path)], + input=puzzle_input, + text=True, + capture_output=True, + check=False, + ) + return proc.stdout, proc.stderr, proc.returncode + except FileNotFoundError: + raise SystemExit(f"Solver binary not found: {solver_path}") + + +def parse_all_solutions(solver_output: str, cols: int, rows: int) -> List[List[List[str]]]: + """ + Parse solver output to extract ALL solution blocks. + Each solution block contains paths: (x1, y1) (x2, y2) ... (xn, yn) per color. + Solutions are separated by empty lines. + Returns: List of 2D grids (one per solution found). + """ + lines = solver_output.splitlines() + solutions = [] + i = 0 + + # Find the number of colors from the first solution block + # We'll infer it from the first complete solution we find + num_colors = None + + while i < len(lines): + # Skip status lines + if (SOLUTIONS_RE.match(lines[i]) or + "Touching" in lines[i] or + "Nodes" in lines[i] or + "Attempts" in lines[i] or + HEADER_RE.match(lines[i])): # Skip header lines if present + i += 1 + continue + + # Look for a solution block starting at an empty line or coordinate line + # Solutions start with an empty line (from puts("") in the solver) + # or directly with coordinate lines + if not lines[i].strip(): + i += 1 + # Next lines should be coordinate lines for a solution + + # Collect coordinate lines for one solution + paths = [] + j = i + + while j < len(lines): + line = lines[j].strip() + + # Stop at status lines + if (SOLUTIONS_RE.match(lines[j]) or + "Touching" in lines[j] or + "Nodes" in lines[j] or + "Attempts" in lines[j]): + break + + # Stop at empty line if we already have paths (next solution) + if not line: + if paths: + break + j += 1 + continue + + # Try to parse coordinates + coords = COORD_RE.findall(line) + if coords: + path = [(int(x), int(y)) for x, y in coords] + paths.append(path) + j += 1 + else: + # Non-coordinate line - might be end of solution or start of next + if paths: + break + j += 1 + + # If we found paths, it's a solution + if paths: + # Infer num_colors from first solution + if num_colors is None: + num_colors = len(paths) + + # Only process if we have the expected number of colors + if len(paths) == num_colors: + try: + labels = letter_labels(num_colors) + grid = build_grid(cols, rows) + grid = place_paths_on_grid(cols, rows, paths, labels) + solutions.append(grid) + except Exception as e: + # Skip invalid solutions + pass + + i = j + else: + i += 1 + + return solutions + + +def build_grid(cols: int, rows: int) -> List[List[str]]: + """Build an empty grid.""" + return [['.' for _ in range(cols)] for _ in range(rows)] + + +def place_paths_on_grid(cols: int, rows: int, paths: List[List[Tuple[int, int]]], labels: List[str]) -> List[List[str]]: + """ + Fill the grid with labels along paths. + Reused from convert_freeflow.py logic. + """ + grid = build_grid(cols, rows) + for label, path in zip(labels, paths): + for (x, y) in path: + if not (0 <= x < cols and 0 <= y < rows): + raise ValueError(f"Coordinate {(x,y)} out of bounds for {cols}x{rows}") + if grid[y][x] != '.' and grid[y][x] != label: + raise ValueError(f"Cell {(x,y)} already occupied by '{grid[y][x]}' (overlap).") + grid[y][x] = label + return grid + + +def convert_solution_to_ascii(grid: List[List[str]]) -> str: + """Convert 2D grid back to ASCII string format.""" + return '\n'.join(''.join(row) for row in grid) + + +def normalize_ascii_board(ascii_str: str) -> str: + """Normalize ASCII board for comparison (handle whitespace, newlines).""" + lines = [line.strip() for line in ascii_str.strip().split('\n') if line.strip()] + return '\n'.join(lines) + + +def verify_solution( + problem_ascii: str, + solution_ascii: str, + solver_src: str = "./flowfree_all_solutions.c", + solver_bin: str = "./flowfree_all_solutions", + print_solutions: bool = False +) -> Tuple[bool, List[List[List[str]]]]: + """ + Main verification function. + Returns: (is_valid, all_solutions) where: + - is_valid: True if solution matches any valid solution, False otherwise + - all_solutions: List of all valid solutions found by the solver (as 2D grids) + """ + solver_src_path = Path(solver_src) + solver_bin_path = Path(solver_bin) + + # Build solver if needed + if not solver_bin_path.exists(): + if not solver_src_path.exists(): + raise SystemExit(f"Solver source not found: {solver_src_path}") + build_all_solutions_solver(solver_src_path, solver_bin_path) + + # Parse problem board + try: + problem_grid, cols, rows = parse_ascii_board(problem_ascii) + except Exception as e: + print(f"Error parsing problem board: {e}", file=sys.stderr) + return False, [] + + # Extract endpoints + try: + endpoints = extract_endpoints(problem_grid, cols, rows) + except Exception as e: + print(f"Error extracting endpoints: {e}", file=sys.stderr) + return False, [] + + # Convert to solver input + try: + puzzle_input = convert_to_solver_input(endpoints, cols, rows) + except Exception as e: + print(f"Error converting to solver input: {e}", file=sys.stderr) + return False, [] + + # Run solver + try: + stdout, stderr, returncode = run_solver(str(solver_bin_path), puzzle_input) + if returncode != 0: + print(f"Solver failed with exit code {returncode}", file=sys.stderr) + if stderr: + print(f"Stderr: {stderr}", file=sys.stderr) + return False, [] + except Exception as e: + print(f"Error running solver: {e}", file=sys.stderr) + return False, [] + + # Parse all solutions + try: + solutions = parse_all_solutions(stdout, cols, rows) + except Exception as e: + print(f"Error parsing solutions: {e}", file=sys.stderr) + return False, [] + + if not solutions: + print("No solutions found by solver", file=sys.stderr) + return False, [] + + # Print all solutions if requested + if print_solutions: + print(f"\nFound {len(solutions)} solution(s):", file=sys.stderr) + for i, sol_grid in enumerate(solutions, 1): + sol_ascii = convert_solution_to_ascii(sol_grid) + print(f"\nSolution {i}:", file=sys.stderr) + print(sol_ascii, file=sys.stderr) + + # Normalize the given solution + normalized_solution = normalize_ascii_board(solution_ascii) + + # Compare against all solutions + for sol_grid in solutions: + sol_ascii = convert_solution_to_ascii(sol_grid) + normalized_sol = normalize_ascii_board(sol_ascii) + if normalized_solution == normalized_sol: + return True, solutions + + return False, solutions + + +def main(): + ap = argparse.ArgumentParser( + description="Verify if an ASCII board state is a valid solution to a FlowFree puzzle", + epilog=""" +Example usage: + python verifier.py \\ + --problem "BBBBBBBB\\nBFFFFFFB\\nFFGGGGFB\\nFGGAAGFB\\nFGAAGGBB\\nEGGGGDBC\\nEGGGDDBC\\nEEEEEBBC" \\ + --solution "BBBBBBBB\\nBFFFFFFB\\nFFGGGGFB\\nFGGAAGFB\\nFGAAGGBB\\nEGGGGDBC\\nEGGGDDBC\\nEEEEEBBC" + """ + ) + ap.add_argument("--problem", required=True, help="Problem board as ASCII string (with \\n for newlines)") + ap.add_argument("--solution", required=True, help="Solution board as ASCII string (with \\n for newlines)") + ap.add_argument("--solver-src", default="./flowfree_all_solutions.c", help="Path to solver source") + ap.add_argument("--solver-bin", default="./flowfree_all_solutions", help="Path to solver binary") + ap.add_argument("--print-solutions", action="store_true", help="Print all solutions found by the solver") + args = ap.parse_args() + + # Convert \n escape sequences to actual newlines + problem = args.problem.replace('\\n', '\n') + solution = args.solution.replace('\\n', '\n') + + is_valid, all_solutions = verify_solution(problem, solution, args.solver_src, args.solver_bin, args.print_solutions) + + if is_valid: + print("VALID: Solution matches a valid solution found by the solver") + sys.exit(0) + else: + print("INVALID: Solution does not match any valid solution") + if args.print_solutions and all_solutions: + print(f"\nNote: The solver found {len(all_solutions)} valid solution(s) (printed above).", file=sys.stderr) + sys.exit(1) + + +# Example usage as a Python function: +# +# problem = '''BBBBBBBB +# BFFFFFFB +# FFGGGGFB +# FGGAAGFB +# FGAAGGBB +# EGGGGDBC +# EGGGDDBC +# EEEEEBBC''' +# +# solution = '''BBBBBBBB +# BFFFFFFB +# FFGGGGFB +# FGGAAGFB +# FGAAGGBB +# EGGGGDBC +# EGGGDDBC +# EEEEEBBC''' +# +# is_valid = verify_solution(problem, solution) +# print(f"Solution is valid: {is_valid}") + + +if __name__ == "__main__": + main() + diff --git a/submodules/rlp/.gitignore b/submodules/rlp/.gitignore new file mode 100644 index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 diff --git a/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_GUIDE_new.md b/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_GUIDE_new.md new file mode 100644 index 0000000000000000000000000000000000000000..b2615140f9b3bc0e6e6c04f35e3d0a1e8e1055b0 --- /dev/null +++ b/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_GUIDE_new.md @@ -0,0 +1,590 @@ +# ASCII Parser Implementation Guide for Bridges Puzzles + +This document provides a comprehensive guide to implementing ASCII parsers for puzzle games, using the Bridges puzzle as a reference implementation. This guide can be used to create similar parsers for other puzzles (undead, loopy, etc.). + +## Table of Contents + +1. [Overview](#overview) +2. [Architecture](#architecture) +3. [Implementation Structure](#implementation-structure) +4. [Key Components](#key-components) +5. [Testing Strategy](#testing-strategy) +6. [Gotchas and Lessons Learned](#gotchas-and-lessons-learned) +7. [Integration Points](#integration-points) +8. [Step-by-Step Implementation Checklist](#step-by-step-implementation-checklist) + +--- + +## Overview + +### Purpose + +The ASCII parser converts ASCII text representations of puzzle states into Python dictionaries that match the format produced by `get_puzzle_state_()` functions. This enables: + +- **Verification**: Check if an ASCII state (from LLM or other sources) is solved +- **State Loading**: Load arbitrary puzzle states from ASCII text +- **Round-trip Testing**: Verify ASCII → state dict → load → format → ASCII works correctly +- **Integration**: Use ASCII states with existing `load_state_dict` functionality + +### Pipeline + +The complete pipeline follows this flow: + +``` +ASCII Text → Parse (Python) → State Dict → Load (C) → Game State → Verify/Format +``` + +1. **Parse ASCII** (Python): Convert ASCII text to state dictionary +2. **Load State Dict** (C): Use existing `load_state_dict_()` function +3. **Verify/Format** (C): Check `completed` flag or format back to ASCII + +--- + +## Architecture + +### Three-Layer Design + +1. **Python Parser Layer** (`rlp/ascii_parser.py`) + - Pure Python implementation + - Parses ASCII text into state dictionaries + - No C dependencies for parsing logic + +2. **State Dict Format Layer** (`rlp/specific_api.py`) + - Must match `get_puzzle_state_()` format exactly + - Defines the canonical state representation + +3. **C Loading Layer** (existing `load_state_dict_()`) + - Reconstructs C game state from state dict + - Computes derived fields (possibles, max arrays, etc.) + - Validates and checks if solved + +### Key Design Principle + +**The parser only needs to produce the minimal canonical fields required for reconstruction.** The C code will: +- Recompute derived arrays (possibles, max arrays, etc.) +- Rebuild internal structures (island adjacencies, etc.) +- Validate the state and set `completed`/`solved` flags + +--- + +## Implementation Structure + +### File Organization + +``` +rlp/ + ascii_parser.py # Main parser module (puzzle-specific functions) + specific_api.py # State dict format definitions + puzzle.py # Puzzle class (load_state_dict method) +verifier.py # Verification script using new pipeline +test_ascii_parser.py # Parser-specific tests +test_verifier.py # Integration tests +``` + +### Parser Function Signature + +```python +def parse_ascii_(ascii_text: str) -> dict: + """ + Parse ASCII text representation of a puzzle and return a state dict. + + Args: + ascii_text: The ASCII representation of the puzzle state + + Returns: + dict: State dictionary matching get_puzzle_state_ format + + Raises: + ValueError: If the ASCII text is invalid or empty + """ +``` + +### State Dict Format + +The parser must produce a dictionary that **exactly matches** the format from `get_puzzle_state_()`. For bridges, this includes: + +```python +{ + "w": int, # Width + "h": int, # Height + "completed": bool, # Will be computed by C code (set to False) + "solved": bool, # Will be computed by C code (set to False) + "grid": List[int], # Grid flags array (w*h elements) + "lines": List[int], # Lines array (w*h elements) + "islands": List[dict], # Island structures + "n_islands": int, # Number of islands + "n_islands_alloc": int, # Allocation size (same as n_islands for parsed) + "params": { # Minimal params (only for verification/printing) + "w": int, + "h": int, + "maxb": int, # Default: 2 for bridges + "allowloops": bool, # Default: True for bridges + }, + # Derived arrays - initialized to zeros, computed by C code + "wha": List[int], # w*h elements + "possv": List[int], # w*h elements + "possh": List[int], # w*h elements + "maxv": List[int], # w*h elements + "maxh": List[int], # w*h elements +} +``` + +--- + +## Key Components + +### 1. ASCII Format Understanding + +**For Bridges:** +- Islands: `'0'-'9'` (count 0-9) or `'A'-'G'` (count 10-16) +- Vertical bridges: `'|'` (single), `'"'` (double) +- Horizontal bridges: `'-'` (single), `'='` (double) +- Empty cells: `'.'` + +**Key Insight**: Study the C `game_text_format()` function to understand the exact ASCII format. This is the inverse operation. + +### 2. Dimension Inference + +```python +# First pass: infer dimensions +lines = ascii_text.strip().split('\n') +h = len(lines) +max_w = max(len(line.rstrip()) for line in lines) +w = max_w +``` + +**Important**: Handle variable line lengths gracefully. Shorter lines are treated as empty cells. + +### 3. Grid Flags + +Define constants matching the C definitions: + +```python +# Grid flags matching .c definitions +G_ISLAND = 0x0001 +G_LINEV = 0x0002 # contains a vertical line +G_LINEH = 0x0004 # contains a horizontal line +``` + +**Critical**: These must match the C `#define` values exactly. + +### 4. State Dict Construction + +```python +# Initialize arrays +wh = w * h +grid = [0] * wh +lines_array = [0] * wh +islands = [] + +# Parse each cell +for y, line in enumerate(lines): + for x in range(w): + c = stripped[x] if x < len(stripped) else None + idx = y * w + x + + if c is island_char: + grid[idx] |= G_ISLAND + islands.append({"x": x, "y": y, "count": count}) + elif c is line_char: + grid[idx] |= G_LINE_FLAG + lines_array[idx] = line_count # 1 or 2 + # Empty cells remain 0 +``` + +### 5. Minimal Params + +Only include params needed for verification/printing: + +```python +"params": { + "w": w, + "h": h, + # Only include fields needed for load_state_dict + # Omit generation params: islands, expansion, difficulty +} +``` + +--- + +## Testing Strategy + +### 1. Unit Tests (Parser-Specific) + +**File**: `test_ascii_parser.py` + +Test cases: +- **Problem states** (initial puzzle, no solution) +- **Solution states** (complete solution with all elements) +- **Edge cases**: Empty states, single cell, maximum size +- **Special characters**: Letter islands (A-G), double bridges +- **Round-trip**: ASCII → parse → load → format → ASCII (must match) + +### 2. Integration Tests (Verifier) + +**File**: `test_verifier.py` + +Test cases: +- **CSV predictions**: Verify problems return `solved=False`, solutions return `solved=True` +- **State comparison**: Compare two similar ASCII states +- **Large-scale testing**: Test all problems/solutions from dataset + +### 3. Round-Trip Testing + +The most important test pattern: + +```python +# 1. Get ASCII from a puzzle state +ascii_original = game.text_format(state).decode('utf-8') + +# 2. Parse with Python parser +state_dict = parse_ascii_bridges(ascii_original) + +# 3. Load into C +loaded_state_ptr = puzzle.load_state_dict(state_dict) + +# 4. Format back to ASCII +ascii_loaded = game.text_format(loaded_state_ptr).decode('utf-8') + +# 5. Compare (should match exactly) +assert ascii_original.strip() == ascii_loaded.strip() +``` + +### 4. Structural Validity (Optional but Recommended) + +For puzzles with connectivity requirements (like bridges), add a structural validity check: + +```python +def check__structural_validity(ascii_text: str) -> bool: + """ + Check structural validity before parsing. + + Validates: + - Lines are contiguous (no breaks) + - Clues haven't been modified + - Basic sanity checks + """ +``` + +This catches common errors early (broken lines, modified clues, etc.). + +--- + +## Gotchas and Lessons Learned + +### 1. Grid Flags Must Match C Exactly + +**Problem**: Grid flag values must match C `#define` values exactly. + +**Solution**: Copy the exact hex values from the C source file. + +```python +# From bridges.c: +#define G_ISLAND 0x0001 +#define G_LINEV 0x0002 +#define G_LINEH 0x0004 + +# In Python: +G_ISLAND = 0x0001 # Must match exactly +G_LINEV = 0x0002 +G_LINEH = 0x0004 +``` + +### 2. Derived Arrays Can Be Zeros + +**Problem**: Don't try to compute derived arrays (possibles, max arrays) in Python. + +**Solution**: Initialize to zeros. The C code will recompute them: + +```python +# Derived arrays - initialized to zeros, will be computed by C code +"wha": [0] * wh, +"possv": [0] * wh, +"possh": [0] * wh, +"maxv": [0] * wh, +"maxh": [0] * wh, +``` + +### 3. Only Include Canonical Fields + +**Problem**: Including non-canonical fields (generation params, solver flags) causes issues. + +**Solution**: Only include fields needed for reconstruction. Omit: +- Generation params: `islands`, `expansion`, `difficulty` +- Solver flags: `G_SWEEP`, `G_WARN` (these are computed by C) +- Allocation details: `n_islands_alloc` can be set to `n_islands` for parsed states + +### 4. Handle Variable Line Lengths + +**Problem**: ASCII text may have lines of different lengths. + +**Solution**: Use maximum width, treat shorter lines as having empty cells: + +```python +max_w = max(len(line.rstrip()) for line in lines) +# For cells beyond line length, treat as empty (already 0) +``` + +### 5. Memory Management + +**Problem**: Must free loaded states to avoid memory leaks. + +**Solution**: Always use try/finally: + +```python +loaded_state_ptr = puzzle.load_state_dict(state_dict) +try: + # Use the state + is_solved = loaded_state_ptr.contents.completed +finally: + if loaded_state_ptr: + free_game_func(loaded_state_ptr) +``` + +### 6. State Dict Format Must Match Exactly + +**Problem**: Even small differences in state dict format cause failures. + +**Solution**: +- Copy the exact structure from `get_puzzle_state_()` +- Use the same field names and types +- Test with round-trip verification + +### 7. Letter Islands (A-G) + +**Problem**: Islands can have counts 10-16 represented as letters. + +**Solution**: Handle both digits and letters: + +```python +if c >= '0' and c <= '9': + count = ord(c) - ord('0') +elif c >= 'A' and c <= 'G': + count = (ord(c) - ord('A')) + 10 +``` + +### 8. Double Bridges + +**Problem**: Double bridges use different characters (`"` for vertical, `=` for horizontal). + +**Solution**: Check for both single and double bridge characters: + +```python +elif c == '|': + lines_array[idx] = 1 +elif c == '"': + lines_array[idx] = 2 +elif c == '-': + lines_array[idx] = 1 +elif c == '=': + lines_array[idx] = 2 +``` + +### 9. Empty Cells vs Missing Cells + +**Problem**: Need to distinguish between empty cells (`.`) and cells beyond line length. + +**Solution**: Both are treated the same (grid=0, lines=0), but handle bounds checking: + +```python +if x >= len(stripped): + continue # Beyond line length, already initialized to 0 +elif c == '.': + pass # Empty cell, already initialized to 0 +``` + +### 10. Testing with Real Data + +**Problem**: Unit tests may not catch all edge cases. + +**Solution**: Test with real dataset: +- Parse all problems and solutions from CSV +- Verify round-trip works for all +- Check that problems are unsolved and solutions are solved + +--- + +## Integration Points + +### 1. Verifier Script + +The verifier uses the parser in a complete pipeline: + +```python +def verify_ascii_state(puzzle, ascii_text: str) -> str: + # 1. Optional: Check structural validity + if not check_bridges_structural_validity(ascii_text): + return "NOT SOLVED" + + # 2. Parse ASCII + state_dict = parse_ascii_bridges(ascii_text) + + # 3. Load state dict + loaded_state_ptr = puzzle.load_state_dict(state_dict) + + # 4. Check completed flag + is_solved = loaded_state_ptr.contents.completed + return "SOLVED" if is_solved else "NOT SOLVED" +``` + +### 2. Load State Dict Function + +The parser output must be compatible with existing `load_state_dict_()`: + +```python +# In rlp/specific_api.py +def load_state_dict_bridges(state_dict: dict, lib: c.PyDLL) -> c.POINTER(GameState): + # Validates required fields + # Creates C structures + # Calls bridges_state_from_repr() +``` + +### 3. Puzzle Class + +The Puzzle class provides the interface: + +```python +# In rlp/puzzle.py +puzzle = Puzzle('bridges', arg='5x5de', headless=True) +puzzle.new_game() +state_dict = parse_ascii_bridges(ascii_text) +loaded_state = puzzle.load_state_dict(state_dict) +``` + +--- + +## Step-by-Step Implementation Checklist + +### Phase 1: Research and Understanding + +- [ ] Study the C `game_text_format()` function to understand ASCII format +- [ ] Review `get_puzzle_state_()` to understand state dict format +- [ ] Identify all ASCII characters and their meanings +- [ ] Identify grid flags and their values from C source +- [ ] Understand the puzzle's state structure + +### Phase 2: Parser Implementation + +- [ ] Create `rlp/ascii_parser.py` (or add to existing file) +- [ ] Define grid flag constants matching C +- [ ] Implement dimension inference +- [ ] Implement cell-by-cell parsing +- [ ] Build grid array with correct flags +- [ ] Build lines/connections array +- [ ] Extract puzzle-specific structures (islands, etc.) +- [ ] Construct state dict matching `get_puzzle_state_()` format +- [ ] Add error handling and validation + +### Phase 3: Structural Validity (Optional) + +- [ ] Implement structural validity checker +- [ ] Validate connectivity (if applicable) +- [ ] Validate clues haven't been modified +- [ ] Add sanity checks + +### Phase 4: Testing + +- [ ] Create `test_ascii_parser.py` +- [ ] Test problem states (unsolved) +- [ ] Test solution states (solved) +- [ ] Test edge cases (empty, single cell, max size) +- [ ] Test special characters/features +- [ ] Implement round-trip tests +- [ ] Test with real dataset (CSV) + +### Phase 5: Integration + +- [ ] Update `verifier.py` to use new parser +- [ ] Create/update `test_verifier.py` +- [ ] Test CSV predictions (problems vs solutions) +- [ ] Verify memory management (no leaks) + +### Phase 6: Documentation + +- [ ] Document ASCII format +- [ ] Document parser function +- [ ] Document state dict format +- [ ] Add examples and usage + +--- + +## Example: Bridges Parser Structure + +```python +# rlp/ascii_parser.py + +# 1. Grid flags (must match C) +G_ISLAND = 0x0001 +G_LINEV = 0x0002 +G_LINEH = 0x0004 + +# 2. Structural validity (optional) +def check_bridges_structural_validity(ascii_text: str) -> bool: + # Validates line continuity, clue integrity, etc. + pass + +# 3. Main parser +def parse_ascii_bridges(ascii_text: str) -> dict: + # Dimension inference + lines = ascii_text.strip().split('\n') + h = len(lines) + w = max(len(line.rstrip()) for line in lines) + + # Initialize arrays + wh = w * h + grid = [0] * wh + lines_array = [0] * wh + islands = [] + + # Parse cells + for y, line in enumerate(lines): + for x in range(w): + c = line[x] if x < len(line.rstrip()) else None + idx = y * w + x + + if c in '0-9A-G': # Island + grid[idx] |= G_ISLAND + islands.append({"x": x, "y": y, "count": ...}) + elif c in '|"': # Vertical line + grid[idx] |= G_LINEV + lines_array[idx] = 2 if c == '"' else 1 + elif c in '-=': # Horizontal line + grid[idx] |= G_LINEH + lines_array[idx] = 2 if c == '=' else 1 + + # Build state dict + return { + "w": w, + "h": h, + "grid": grid, + "lines": lines_array, + "islands": islands, + # ... rest of fields + } +``` + +--- + +## Key Takeaways + +1. **Study the C code first**: Understand `game_text_format()` and state structure +2. **Match formats exactly**: State dict must match `get_puzzle_state_()` exactly +3. **Minimal canonical fields**: Only include what's needed for reconstruction +4. **Let C compute derived fields**: Initialize derived arrays to zeros +5. **Round-trip testing is critical**: ASCII → parse → load → format → ASCII must match +6. **Handle edge cases**: Variable line lengths, special characters, empty states +7. **Memory management**: Always free loaded states +8. **Test with real data**: Use actual problems and solutions from datasets + +--- + +## References + +- Bridges parser: `rlp/ascii_parser.py` +- State dict format: `rlp/specific_api.py` (lines 2576-2585) +- C text format: `puzzles/bridges.c` (lines 234-266) +- C state structure: `puzzles/bridges.c` (lines 177-189) +- Load state dict: `rlp/specific_api.py` (lines 2588-2686) +- Tests: `test_ascii_parser.py`, `test_verifier.py` +- Verifier: `verifier.py` + diff --git a/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_TEMPLATE.md b/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_TEMPLATE.md new file mode 100644 index 0000000000000000000000000000000000000000..36aaa9847a3b6eccb192c539d3be7898fcd5f95d --- /dev/null +++ b/submodules/rlp/ASCII_PARSER_IMPLEMENTATION_TEMPLATE.md @@ -0,0 +1,822 @@ +# ASCII Parser Implementation Template + +This template provides step-by-step instructions for implementing ASCII parsers for puzzle games. Use this guide to create parsers for new puzzle types following the established pattern from bridges and undead implementations. + +## Table of Contents + +1. [Overview](#overview) +2. [Prerequisites](#prerequisites) +3. [Step-by-Step Implementation](#step-by-step-implementation) +4. [Code Structure](#code-structure) +5. [Testing Strategy](#testing-strategy) +6. [Integration Checklist](#integration-checklist) +7. [Common Patterns and Examples](#common-patterns-and-examples) +8. [Troubleshooting](#troubleshooting) + +--- + +## Overview + +### Purpose + +The ASCII parser converts ASCII text representations of puzzle states into Python dictionaries that match the format produced by `get_puzzle_state_()` functions. This enables: + +- **Verification**: Check if an ASCII state (from LLM or other sources) is solved +- **State Loading**: Load arbitrary puzzle states from ASCII text +- **Round-trip Testing**: Verify ASCII → state dict → load → format → ASCII works correctly +- **Integration**: Use ASCII states with existing `load_state_dict` functionality + +### Pipeline + +``` +ASCII Text → Structural Validation → Parse (Python) → State Dict → Load (C) → Game State → Verify/Format +``` + +1. **Structural Validation** (Python): Quick check if ASCII looks valid +2. **Parse ASCII** (Python): Convert ASCII text to state dictionary +3. **Load State Dict** (C): Use existing `load_state_dict_()` function +4. **Verify/Format** (C): Check `completed`/`solved` flag or format back to ASCII + +--- + +## Prerequisites + +Before starting, you need: + +1. **Access to C source code**: `puzzles/.c` +2. **Understanding of ASCII format**: Study `game_text_format()` function in C +3. **Understanding of state dict format**: Review `get_puzzle_state_()` in `rlp/specific_api.py` +4. **Understanding of load function**: Review `load_state_dict_()` in `rlp/specific_api.py` +5. **Example ASCII states**: Have sample problem and solution states to test with + +--- + +## Step-by-Step Implementation + +### Phase 1: Research and Understanding + +#### Step 1.1: Study the C ASCII Format Function + +**Location**: `puzzles/.c` + +**Function**: `game_text_format()` + +**What to look for**: +- How the function formats the puzzle state to ASCII +- What characters represent different cell types +- How dimensions are represented +- What the header/prefix looks like (if any) +- How multi-line structures are formatted + +**Example questions to answer**: +- What characters represent different cell states? +- Are there special characters for different values? +- How are dimensions encoded? +- Is there a header line (like "G: X V: Y Z: Z" for undead)? +- How are edge clues/borders represented? + +**Document your findings**: +```python +# ASCII Format for : +# - Header: +# - Cell types: +# - : +# - : +# - Grid structure: +``` + +#### Step 1.2: Study the State Dict Format + +**Location**: `rlp/specific_api.py` + +**Function**: `get_puzzle_state_()` + +**What to look for**: +- Required top-level fields +- Nested structures (like `common` for undead) +- Array types and lengths +- Field names and types +- Which fields are canonical (required) vs derived (computed by C) + +**Key insight**: Only include canonical fields in the parser output. Derived fields should be initialized to zeros/False and computed by C code. + +**Document the structure**: +```python +# State dict format for : +{ + "field1": , # Required + "field2": , # Required + "nested": { # If applicable + "subfield1": , + }, + "derived_array": [0] * size, # Will be computed by C +} +``` + +#### Step 1.3: Study Cell Type Constants + +**Location**: `puzzles/.c` + +**What to look for**: +- `#define` statements for grid flags +- `enum` definitions for cell types +- Any constants used to represent cell states + +**Example**: +```c +// From undead.c: +enum { + CELL_EMPTY, + CELL_MIRROR_L, + CELL_MIRROR_R, + CELL_GHOST, + CELL_VAMPIRE, + CELL_ZOMBIE, +}; +``` + +**Action**: Copy these exact values to Python constants in `rlp/ascii_parser.py` + +#### Step 1.4: Study the Load Function + +**Location**: `rlp/specific_api.py` + +**Function**: `load_state_dict_()` + +**What to look for**: +- Required fields validation +- Array length requirements +- Type requirements +- Which fields are optional vs required + +**This tells you**: What fields your parser MUST produce for the state dict to load successfully. + +--- + +### Phase 2: Structural Validity Checker (Optional but Recommended) + +#### Step 2.1: Implement `check__structural_validity()` + +**Purpose**: Quick validation before parsing to catch obviously invalid inputs. + +**Location**: `rlp/ascii_parser.py` + +**What to check**: +- [ ] Has required header/prefix (if applicable) +- [ ] Has grid structure present +- [ ] Grid has minimum dimensions +- [ ] Not empty text +- [ ] Not just long unstructured text +- [ ] Basic format sanity checks + +**Template**: +```python +def check__structural_validity(ascii_text: str) -> bool: + """ + Check structural validity of a ASCII state. + + Validates: + 1. + 2. + 3. + + Args: + ascii_text: The ASCII representation of the puzzle state + + Returns: + bool: True if structurally valid, False otherwise + """ + if not ascii_text or not ascii_text.strip(): + return False + + lines = ascii_text.strip().split('\n') + if len(lines) == 0: + return False + + # Check for required header/prefix + # + + # Check for grid structure + # + + # Check minimum dimensions + # + + # Check for invalid patterns (long text, etc.) + # + + return True +``` + +**Testing**: Create test cases with valid and invalid inputs. + +--- + +### Phase 3: Parser Implementation + +#### Step 3.1: Add Constants + +**Location**: `rlp/ascii_parser.py` + +Add cell type constants matching C definitions: + +```python +# Cell types matching .c enum/defines +CONSTANT_NAME_1 = +CONSTANT_NAME_2 = +# ... etc +``` + +**Important**: Values must match C exactly (copy hex values, enum values, etc.) + +#### Step 3.2: Implement Dimension Inference + +**Pattern**: +```python +# First pass: infer dimensions +lines = ascii_text.strip().split('\n') +h = len(lines) +if h == 0: + raise ValueError("ASCII text must contain at least one line") + +# Find maximum width (handle variable line lengths) +max_w = 0 +for line in lines: + stripped = line.rstrip() + w = len(stripped) + if w > max_w: + max_w = w + +if max_w == 0: + raise ValueError("ASCII text must contain at least one non-whitespace character") + +w = max_w +``` + +**Variations**: +- Some puzzles have fixed-width cells (e.g., undead: 2 characters per cell) +- Some puzzles have headers to skip +- Some puzzles have border cells to account for + +#### Step 3.3: Implement Cell-by-Cell Parsing + +**Pattern**: +```python +# Initialize arrays +wh = w * h # or (w+2)*(h+2) if including border +grid = [0] * wh +other_array = [0] * wh +structures = [] # For puzzle-specific structures (islands, etc.) + +# Parse each cell +for y, line in enumerate(lines): + stripped = line.rstrip() + for x in range(w): + if x >= len(stripped): + # Line is shorter, treat as empty + continue + + c = stripped[x] # or cell_str = stripped[x*2:(x+1)*2] for fixed-width + idx = y * w + x # or y * grid_w + x if including border + + # Parse based on character/cell + if c == '': + grid[idx] = CONSTANT_1 + # ... set other fields + elif c == '': + grid[idx] = CONSTANT_2 + # ... set other fields + # ... etc +``` + +**Key considerations**: +- Handle variable line lengths gracefully +- Map ASCII characters to cell type constants +- Build puzzle-specific structures (islands, monsters, etc.) +- Track indices correctly (especially if grid includes border) + +#### Step 3.4: Build State Dict + +**Pattern**: +```python +state_dict = { + # Required top-level fields + "field1": value1, + "field2": value2, + + # Nested structures (if applicable) + "nested": { + "params": { + "w": w, + "h": h, + # Only include canonical params, omit generation params + }, + "array1": array1, + "array2": array2, + }, + + # Derived arrays - initialized to zeros, computed by C code + "derived_array": [0] * size, + + # Status flags - will be computed by C code + "completed": False, + "solved": False, +} +``` + +**Important**: +- Only include canonical fields (required for `load_state_dict`) +- Initialize derived arrays to zeros +- Set `completed`/`solved` to False (C will compute) +- Omit generation params (islands, expansion, difficulty, etc.) + +#### Step 3.5: Add Error Handling + +**Pattern**: +```python +def parse_ascii_(ascii_text: str) -> dict: + """ + Parse ASCII text representation of a puzzle and return a state dict. + + Args: + ascii_text: The ASCII representation of the puzzle state + + Returns: + dict: State dictionary matching get_puzzle_state_ format + + Raises: + ValueError: If the ASCII text is invalid or empty + """ + if not ascii_text or not ascii_text.strip(): + raise ValueError("ASCII text cannot be empty") + + # ... parsing logic ... + + # Validate dimensions + if w < 1 or h < 1: + raise ValueError(f"Invalid grid dimensions: w={w}, h={h}") + + # ... return state_dict ... +``` + +--- + +### Phase 4: Testing + +#### Step 4.1: Create Test File + +**Location**: `test_ascii_parser_.py` + +**Template structure**: +```python +""" +Test script for ASCII parser round-trip functionality. +""" +import sys +import os +import pandas as pd +from rlp import puzzle as rp +from rlp.ascii_parser import parse_ascii_, check__structural_validity + + +def test_parse_example(): + """Test parsing with a known example.""" + # + # ... test logic ... + + +def test_structural_validity(): + """Test structural validity checker.""" + # Valid examples + # Invalid examples + # ... test logic ... + + +def test_round_trip(): + """Test round-trip: ASCII → parse → load → format → ASCII.""" + # ... test logic ... + + +def test_csv_predictions_round_trip(): + """Test round-trip for all problems and solutions in CSV.""" + # ... test logic ... + + +if __name__ == "__main__": + # Run all tests + # ... test runner ... +``` + +#### Step 4.2: Test Cases to Include + +1. **Basic parsing test**: Known valid ASCII state +2. **Structural validity test**: Valid and invalid examples +3. **Round-trip test**: Generate puzzle → get ASCII → parse → load → format → compare +4. **Edge cases**: Empty states, single cell, maximum size, special characters +5. **CSV round-trip**: Test all problems/solutions from dataset + +#### Step 4.3: Round-Trip Test Pattern + +**Critical test**: +```python +# 1. Get ASCII from a puzzle state +ascii_original = game.text_format(state).decode('utf-8') + +# 2. Parse with Python parser +state_dict = parse_ascii_(ascii_original) + +# 3. Load into C +loaded_state_ptr = puzzle.load_state_dict(state_dict) + +# 4. Format back to ASCII +ascii_loaded = game.text_format(loaded_state_ptr.contents).decode('utf-8') + +# 5. Compare (should match exactly) +assert ascii_original.strip() == ascii_loaded.strip() +``` + +--- + +### Phase 5: Integration + +#### Step 5.1: Update Verifier + +**Location**: `verifier.py` + +**Changes needed**: +1. Import parser function: `from rlp.ascii_parser import parse_ascii_, check__structural_validity` +2. Add puzzle type case in `verify_ascii_state()`: +```python +elif puzzle_type == "": + # First check structural validity + if not check__structural_validity(str(ascii_text)): + return "NOT SOLVED" + + # Parse ASCII with Python parser + state_dict = parse_ascii_(str(ascii_text)) + + # Load state dict + loaded_state_ptr = puzzle.load_state_dict(state_dict) + + # Get free_game function + me = puzzle.fe.contents.me.contents + game = me.ourgame.contents + free_game_func = game.free_game + + try: + # Check if solved (use correct field: completed or solved) + is_solved = loaded_state_ptr.contents. # completed or solved + + if is_solved: + return "SOLVED" + else: + return "NOT SOLVED" + finally: + if loaded_state_ptr: + free_game_func(loaded_state_ptr) +``` + +**Important**: Check which field the puzzle uses (`completed` for bridges, `solved` for undead) + +#### Step 5.2: Update Test Verifier + +**Location**: `test_verifier.py` + +**Changes needed**: +1. Add puzzle type parameter to test functions +2. Add puzzle-specific configuration (difficulty args, puzzle name in CSV) +3. Add puzzle type to command-line argument choices + +#### Step 5.3: Update Evaluate Predictions (if applicable) + +**Location**: `evaluate-predictions.py` + +**Changes needed**: +1. Add puzzle type to command-line arguments +2. Add puzzle-specific configuration +3. Update puzzle name filtering + +--- + +## Code Structure + +### File: `rlp/ascii_parser.py` + +**Structure**: +```python +# Constants for puzzle 1 +CONSTANT_1 = value1 +CONSTANT_2 = value2 + +# Structural validity for puzzle 1 +def check_puzzle1_structural_validity(ascii_text: str) -> bool: + ... + +# Parser for puzzle 1 +def parse_ascii_puzzle1(ascii_text: str) -> dict: + ... + +# Constants for puzzle 2 +CONSTANT_3 = value3 + +# Structural validity for puzzle 2 +def check_puzzle2_structural_validity(ascii_text: str) -> bool: + ... + +# Parser for puzzle 2 +def parse_ascii_puzzle2(ascii_text: str) -> dict: + ... +``` + +### Function Signature Template + +```python +def parse_ascii_(ascii_text: str) -> dict: + """ + Parse ASCII text representation of a puzzle and return a state dict. + + ASCII Format: + - + - + - + + Args: + ascii_text: The ASCII representation of the puzzle state + + Returns: + dict: State dictionary matching get_puzzle_state_ format + + Raises: + ValueError: If the ASCII text is invalid or empty + """ + # Implementation +``` + +--- + +## Testing Strategy + +### Unit Tests (Parser-Specific) + +**File**: `test_ascii_parser_.py` + +**Test categories**: +1. **Basic parsing**: Valid ASCII states parse correctly +2. **Structural validity**: Valid vs invalid inputs +3. **Edge cases**: Empty, single cell, max size, special characters +4. **Round-trip**: ASCII → parse → load → format → ASCII (must match) +5. **CSV integration**: Test with real dataset + +### Integration Tests (Verifier) + +**File**: `test_verifier.py` + +**Test categories**: +1. **CSV predictions**: Problems return `solved=False`, solutions return `solved=True` +2. **State comparison**: Compare two similar ASCII states +3. **Large-scale testing**: Test all problems/solutions from dataset + +--- + +## Integration Checklist + +### Parser Implementation +- [ ] Constants defined matching C values +- [ ] Structural validity checker implemented (optional but recommended) +- [ ] Parser function implemented +- [ ] State dict format matches `get_puzzle_state_()` exactly +- [ ] Error handling added +- [ ] Documentation added + +### Testing +- [ ] Unit tests created (`test_ascii_parser_.py`) +- [ ] Structural validity tests pass +- [ ] Round-trip tests pass +- [ ] Edge case tests pass +- [ ] CSV round-trip tests pass (if applicable) + +### Integration +- [ ] Verifier updated (`verifier.py`) +- [ ] Test verifier updated (`test_verifier.py`) +- [ ] Evaluate predictions updated (if applicable) +- [ ] All tests pass + +--- + +## Common Patterns and Examples + +### Pattern 1: Simple Grid (like bridges) + +```python +# Dimension inference +lines = ascii_text.strip().split('\n') +h = len(lines) +w = max(len(line.rstrip()) for line in lines) + +# Cell-by-cell parsing +for y, line in enumerate(lines): + for x in range(w): + c = line[x] if x < len(line.rstrip()) else None + idx = y * w + x + # Parse character +``` + +### Pattern 2: Grid with Border (like undead) + +```python +# Grid is (w+2) x (h+2) including border +grid_w = max_cells # from parsing +grid_h = len(grid_lines) +w = grid_w - 2 +h = grid_h - 2 + +# Cell-by-cell parsing with border +for y, line in enumerate(grid_lines): + for x in range(grid_w): + cell_str = line[x*2:(x+1)*2] # 2-character cells + idx = y * grid_w + x + # Parse cell +``` + +### Pattern 3: Header + Grid + +```python +# Parse header +first_line = lines[0].strip() +# Extract header information + +# Find grid start +grid_start = 1 +if len(lines) > 1 and lines[1].strip() == '': + grid_start = 2 + +grid_lines = lines[grid_start:] +# Parse grid +``` + +### Pattern 4: Helper Functions + +```python +def helper_function_for_puzzle(x, y, w, h): + """ + Helper function ported from C. + + Args: + x, y: Coordinates + w, h: Dimensions + + Returns: + + """ + # Ported logic from C + pass +``` + +--- + +## Troubleshooting + +### Common Issues and Solutions + +#### Issue 1: State Dict Format Mismatch + +**Symptom**: `load_state_dict()` raises ValueError about missing fields + +**Solution**: +- Compare your state dict with output from `get_puzzle_state_()` +- Ensure all required fields are present +- Check field names match exactly (case-sensitive) +- Verify array lengths match requirements + +#### Issue 2: Round-Trip Mismatch + +**Symptom**: ASCII after round-trip doesn't match original + +**Solution**: +- Check dimension inference is correct +- Verify cell parsing maps characters correctly +- Ensure border cells are handled correctly (if applicable) +- Check if whitespace differences matter (use `.strip()` for comparison) + +#### Issue 3: Grid Flags Don't Match + +**Symptom**: Parsed state doesn't behave correctly + +**Solution**: +- Verify constants match C `#define` values exactly +- Check hex values are correct (0x0001 vs 0x001, etc.) +- Ensure bitwise operations are correct + +#### Issue 4: Derived Arrays Issues + +**Symptom**: Errors about array access or computation + +**Solution**: +- Initialize derived arrays to zeros (don't try to compute in Python) +- Let C code recompute them +- Ensure array lengths are correct + +#### Issue 5: Memory Leaks + +**Symptom**: Memory usage grows over time + +**Solution**: +- Always use try/finally to free loaded states +- Call `free_game_func(loaded_state_ptr)` in finally block +- Don't forget to free states in test loops + +#### Issue 6: Structural Validity Too Strict/Loose + +**Symptom**: Valid states rejected or invalid states accepted + +**Solution**: +- Adjust validation criteria +- Test with edge cases +- Balance between catching errors and being lenient + +--- + +## Quick Reference + +### Key Files + +- **Parser implementation**: `rlp/ascii_parser.py` +- **State dict format**: `rlp/specific_api.py` (`get_puzzle_state_()`) +- **Load function**: `rlp/specific_api.py` (`load_state_dict_()`) +- **C ASCII format**: `puzzles/.c` (`game_text_format()`) +- **C state structure**: `puzzles/.c` (struct definitions) +- **Verifier**: `verifier.py` +- **Tests**: `test_ascii_parser_.py`, `test_verifier.py` + +### Key Functions + +- `parse_ascii_(ascii_text: str) -> dict`: Main parser +- `check__structural_validity(ascii_text: str) -> bool`: Quick validation +- `verify_ascii_state(puzzle, ascii_text: str) -> str`: Verifier integration +- `puzzle.load_state_dict(state_dict: dict)`: Load state into C + +### Key Principles + +1. **Match formats exactly**: State dict must match `get_puzzle_state_()` exactly +2. **Minimal canonical fields**: Only include what's needed for reconstruction +3. **Let C compute derived fields**: Initialize derived arrays to zeros +4. **Round-trip testing is critical**: ASCII → parse → load → format → ASCII must match +5. **Handle edge cases**: Variable line lengths, special characters, empty states +6. **Memory management**: Always free loaded states +7. **Test with real data**: Use actual problems and solutions from datasets + +--- + +## Example: Complete Implementation Checklist + +For a new puzzle called "example": + +### Phase 1: Research +- [ ] Study `puzzles/example.c` `game_text_format()` function +- [ ] Review `get_puzzle_state_example()` in `rlp/specific_api.py` +- [ ] Review `load_state_dict_example()` in `rlp/specific_api.py` +- [ ] Identify all ASCII characters and their meanings +- [ ] Identify cell type constants from C source +- [ ] Understand the puzzle's state structure + +### Phase 2: Implementation +- [ ] Add constants to `rlp/ascii_parser.py` +- [ ] Implement `check_example_structural_validity()` (optional) +- [ ] Implement `parse_ascii_example()` function +- [ ] Test with known examples + +### Phase 3: Testing +- [ ] Create `test_ascii_parser_example.py` +- [ ] Test structural validity (if implemented) +- [ ] Test basic parsing +- [ ] Test round-trip +- [ ] Test edge cases +- [ ] Test with CSV (if applicable) + +### Phase 4: Integration +- [ ] Update `verifier.py` to use new parser +- [ ] Update `test_verifier.py` to test example puzzle +- [ ] Update `evaluate-predictions.py` (if applicable) +- [ ] Verify all tests pass + +--- + +## References + +- Bridges parser: `rlp/ascii_parser.py` (`parse_ascii_bridges`, `check_bridges_structural_validity`) +- Undead parser: `rlp/ascii_parser.py` (`parse_ascii_undead`, `check_undead_structural_validity`) +- Original guide: `ASCII_PARSER_IMPLEMENTATION_GUIDE_new.md` +- State dict format: `rlp/specific_api.py` +- C text format: `puzzles/.c` (`game_text_format()`) +- Tests: `test_ascii_parser.py`, `test_ascii_parser_undead.py`, `test_verifier.py` + +--- + +## Notes + +- This template is based on successful implementations for bridges and undead puzzles +- Adapt patterns to your specific puzzle's requirements +- When in doubt, refer to existing implementations (bridges, undead) as examples +- Test thoroughly with real data before considering implementation complete +- Round-trip testing is the most important validation + diff --git a/submodules/rlp/ASCII_PARSING_IMPLEMENTATION_GUIDE_ascii_parsing_in_c.md b/submodules/rlp/ASCII_PARSING_IMPLEMENTATION_GUIDE_ascii_parsing_in_c.md new file mode 100644 index 0000000000000000000000000000000000000000..a9f6051cb71028d0881a8b953a965430e4d8f809 --- /dev/null +++ b/submodules/rlp/ASCII_PARSING_IMPLEMENTATION_GUIDE_ascii_parsing_in_c.md @@ -0,0 +1,313 @@ +# ASCII Parsing Implementation Guide Old + +This document summarizes the implementation of ASCII-to-state-dict () parsing functionality for puzzles, using the Bridges puzzle as a reference implementation. + +## Overview + +The goal is to create an inverse function to `game_text_format()` that can parse an ASCII representation of a puzzle state and recreate the internal game state. This enables: +- Verifying if an arbitrary ASCII state is solved +- Converting ASCII states to state dictionaries +- Validating puzzle states from external sources + +## Implementation Steps + +### 1. Add C-Level Parsing Function + +**Location**: In the puzzle's `.c` file (e.g., `puzzles/bridges.c`) + +**Function Signature**: +```c +static game_state *game_text_parse(const char *text) +``` + +**Key Responsibilities**: +- Parse ASCII text to infer dimensions (width, height) +- Initialize game parameters with defaults +- Create a new game state +- Parse islands/clues from ASCII +- Parse lines/connections from ASCII +- Validate the parsed state +- Check if the state is solved + +**Wrapper Function** (for Python exposure): +```c +game_state *puzzle_name_text_parse(const char *text) +{ + return game_text_parse(text); +} +``` + +**Placement**: Place these functions after all helper functions they depend on (e.g., `new_state`, `island_add`, `map_find_orthogonal`, etc.) to avoid implicit declaration warnings. + +### 2. Add Python Wrapper + +**Location**: `rlp/puzzle.py` in the `Puzzle.__init__` method + +**Code Pattern**: +```python +self._text_parse = None +if self.puzzle_name == "puzzle_name": + self._text_parse = wrap_function( + self._lib, "puzzle_name_text_parse", api.specific.GAMESTATE_PTR, [c.c_char_p] + ) +``` + +### 3. Add Python Methods + +**Location**: `rlp/puzzle.py` in the `Puzzle` class + +**Methods to Add**: + +#### `check_ascii_solved(ascii_text: str) -> bool` +- Parses ASCII and checks if the state is solved +- Returns `True` if solved, `False` otherwise +- Handles memory cleanup properly + +#### `get_state_dict_from_ascii(ascii_text: str) -> dict` +- Parses ASCII and returns the state dictionary +- Uses `specific.get_puzzle_state_dict()` to convert C state to Python dict +- Handles memory cleanup properly + +### 4. Recompile the Library + +**Command**: +```bash +cd /home/ubuntu/projects/rlp/rlp/lib +cmake --build . --target libpuzzle_name --clean-first +``` + +Or use the full install script: +```bash +cd /home/ubuntu/projects/rlp +./install_new.sh +``` + +## Bridges Implementation Details + +### ASCII Format + +The Bridges puzzle uses the following ASCII characters: +- `0-9`, `A-G`: Island with count (0-16) +- `|`: Single vertical bridge +- `"`: Double vertical bridge +- `-`: Single horizontal bridge +- `=`: Double horizontal bridge +- `.`: Empty cell +- `\n`: Row separator + +### Parsing Logic + +1. **Dimension Inference**: Parse ASCII to determine width and height +2. **Island Parsing**: Extract islands and their counts from digits/letters +3. **Line Parsing**: Extract bridges from line characters (`|`, `"`, `-`, `=`) +4. **Validation**: Ensure all bridge paths are complete in ASCII +5. **Solved Check**: Verify all islands have correct bridge counts + +### Critical Validation Function + +**`path_has_all_lines()`**: Validates that all cells in a bridge path have corresponding line characters in the ASCII. This prevents creating bridges when the ASCII has gaps. + +**Why it's needed**: Without this, `island_join()` would fill all cells between two islands, even if the ASCII doesn't show line characters in all those cells. + +### Explicit Bridge Count Check + +After parsing, explicitly verify each island has the correct number of bridges: +```c +bool all_islands_correct = true; +for (int i = 0; i < state->n_islands; i++) { + struct island *is = &state->islands[i]; + int bridge_count = island_countbridges(is); + if (bridge_count != is->count) { + all_islands_correct = false; + break; + } +} +``` + +## Important Caveats and Considerations + +### 1. Memory Management + +**Critical**: Always free the parsed state after use: +```python +try: + # Use state_ptr + ... +finally: + if state_ptr: + free_game_func(state_ptr) +``` + +**Important**: Get `free_game` function pointer BEFORE accessing `state_ptr.contents` to avoid use-after-free issues. + +### 2. Function Declaration Order + +**Problem**: Implicit declaration warnings if functions are called before they're defined. + +**Solution**: Place `game_text_parse` after all helper functions it depends on. Check for: +- `new_state()` +- Island manipulation functions (`island_add`, `island_join`, etc.) +- Map functions (`map_find_orthogonal`, `map_update_possibles`, `map_check`) +- Any other helper functions used + +### 3. Parameter Defaults + +When parsing ASCII, you may need to infer or default parameters: +- **Dimensions**: Infer from ASCII structure +- **Difficulty**: Default to 0 (not needed for parsing) +- **Game-specific params**: Use sensible defaults (e.g., `allowloops = true` for Bridges) +- **Island/expansion params**: Not needed for parsing (set to 0) + +### 4. Path Validation + +**Critical for Bridges**: Always validate that bridge paths are complete in ASCII before creating bridges. This prevents: +- Creating bridges when ASCII has gaps +- Incorrectly marking incomplete states as solved +- Different ASCII states producing the same internal representation + +### 5. State Validation + +**Always verify**: +- All required elements are present (islands, connections, etc.) +- All counts match (bridge counts, clue counts, etc.) +- Connectivity is correct +- State is actually solved (not just connected) + +### 6. ASCII Format Consistency + +**Ensure**: +- The ASCII format matches what `game_text_format()` produces +- Character encoding is consistent (UTF-8) +- Newline handling is correct (`\n`, `\r`, or both) +- Edge cases are handled (trailing newlines, empty lines, etc.) + +### 7. Puzzle-Specific Considerations + +**Bridges-specific**: +- `allowloops` parameter affects solved check (default to `true`) +- Bridge paths must be validated before joining +- Island counts must match bridge counts exactly + +**For other puzzles**, consider: +- What constitutes a valid state? +- What parameters need to be inferred vs. defaulted? +- What validation is required? +- How does the ASCII format represent the puzzle state? + +### 8. Testing Strategy + +**Test Cases to Include**: +1. **Valid solved state**: Should parse correctly and return `solved = True` +2. **Valid unsolved state**: Should parse correctly and return `solved = False` +3. **Incomplete state**: Should parse but not mark as solved +4. **Invalid ASCII**: Should handle gracefully (return NULL or raise error) +5. **Edge cases**: Empty state, single island, maximum size, etc. +6. **Round-trip test**: Parse ASCII → get state → format to ASCII → should match original + +### 9. Error Handling + +**In C**: +- Return `NULL` if parsing fails +- Validate inputs (non-null text, valid dimensions) +- Check for memory allocation failures + +**In Python**: +- Raise `ValueError` for unsupported puzzles +- Handle `None` returns from C functions +- Ensure proper cleanup in `finally` blocks + +### 10. Performance Considerations + +**Path validation** can be expensive if done naively: +- Consider building a lookup table/map of ASCII characters +- Cache parsed dimensions +- Optimize the validation loop + +**For Bridges**: The `path_has_all_lines()` function parses the entire ASCII for each bridge, which is O(n*m) where n is ASCII length and m is number of bridges. For large puzzles, consider optimizing. + +## Implementation Checklist for New Puzzles + +- [ ] Understand the ASCII format from `game_text_format()` +- [ ] Identify required parameters and defaults +- [ ] Implement dimension inference +- [ ] Implement element parsing (islands, clues, etc.) +- [ ] Implement connection parsing (bridges, links, etc.) +- [ ] Add validation functions (path validation, count checks, etc.) +- [ ] Add explicit solved state verification +- [ ] Create wrapper function for Python exposure +- [ ] Add Python wrapper in `puzzle.py` +- [ ] Add `check_ascii_solved()` method +- [ ] Add `get_state_dict_from_ascii()` method +- [ ] Recompile library +- [ ] Write comprehensive tests +- [ ] Test edge cases and error conditions +- [ ] Document puzzle-specific considerations + +## Example: Bridges Implementation Summary + +### Files Modified + +1. **`puzzles/bridges.c`**: + - Added `path_has_all_lines()` helper function + - Added `game_text_parse()` function + - Added `bridges_text_parse()` wrapper function + - Changed `params.allowloops = true` (was `false`) + +2. **`rlp/puzzle.py`**: + - Added `_text_parse` loading in `__init__` + - Added `check_ascii_solved()` method + - Added `get_state_dict_from_ascii()` method + +3. **Test files**: + - Created `test_verifier.py` with comprehensive tests + - Created `verifier.py` standalone script + +### Key Functions + +- `path_has_all_lines()`: Validates bridge paths in ASCII +- `game_text_parse()`: Main parsing function +- `bridges_text_parse()`: Python-exposed wrapper +- `check_ascii_solved()`: Python method to check solved status +- `get_state_dict_from_ascii()`: Python method to get state dict + +### Critical Fixes Applied + +1. **Path validation**: Prevents creating bridges with gaps +2. **Explicit bridge count check**: Ensures all islands are correct +3. **Memory management**: Proper cleanup in Python wrappers +4. **Function order**: Moved functions after dependencies +5. **Parameter defaults**: Set `allowloops = true` for Bridges + +## Notes for Future Implementations + +1. **Start with understanding the ASCII format**: Study `game_text_format()` carefully +2. **Identify puzzle-specific elements**: What needs to be parsed? (islands, bridges, clues, etc.) +3. **Consider validation needs**: What can go wrong? What needs checking? +4. **Test thoroughly**: Especially edge cases and error conditions +5. **Document puzzle-specific quirks**: Each puzzle may have unique requirements + +## Common Pitfalls to Avoid + +1. **Memory leaks**: Always free parsed states +2. **Implicit declarations**: Order functions correctly +3. **Missing validation**: Don't trust ASCII blindly +4. **Incorrect defaults**: Understand what parameters mean +5. **Incomplete parsing**: Ensure all elements are parsed +6. **Wrong solved check**: Verify actual solved state, not just connectivity + +## Questions to Answer for Each Puzzle + +1. What does the ASCII format look like? +2. What parameters need to be inferred vs. defaulted? +3. What elements need to be parsed? (islands, bridges, clues, etc.) +4. What validation is required? +5. How is "solved" determined? +6. Are there puzzle-specific constraints? (e.g., no loops, connectivity requirements) +7. What edge cases exist? +8. How should errors be handled? + +--- + +**Last Updated**: Based on Bridges puzzle implementation +**Status**: Bridges implementation complete and tested + diff --git a/submodules/rlp/GALAXIES_LOAD_STATE_DICT_PLAN.md b/submodules/rlp/GALAXIES_LOAD_STATE_DICT_PLAN.md new file mode 100644 index 0000000000000000000000000000000000000000..abce726a837e69799e3df5b3e97f94b3b64d32fb --- /dev/null +++ b/submodules/rlp/GALAXIES_LOAD_STATE_DICT_PLAN.md @@ -0,0 +1,352 @@ +# Galaxies Load State Dict Implementation Plan + +This document outlines the plan for implementing `load_state_dict` functionality for the Galaxies puzzle, following the template from `LOAD_STATE_DICT_IMPLEMENTATION_GUIDE.md`. + +## Clarifying Questions + +Before proceeding with implementation, we need to clarify the following: + +### 1. Canonical Fields Identification + +**Question**: Which fields from `get_puzzle_state_galaxies()` are truly canonical vs derived? + +Current `get_puzzle_state_galaxies()` returns: +- `w`, `h` - **Canonical** (from params) +- `sx`, `sy` - **Derived** (computed as `(w*2)+1`, `(h*2)+1`) +- `grid` - **Canonical** (array of space structs with flags, dotx, doty, nassoc) +- `completed` - **Derived** (computed by `check_complete()`) +- `used_solve` - **UI state** (not canonical) +- `ndots` - **Derived** (computed by `game_update_dots()`) +- `dots_indices` - **Derived** (computed from grid by scanning for F_DOT flags) +- `cdiff` - **Derived** (difficulty of current puzzle, not needed for reconstruction) + +**Proposed canonical fields for repr struct**: +- `w`, `h` - dimensions +- `grid` - array of space structs (only canonical fields: x, y, type, flags, dotx, doty, nassoc) + +**Questions**: +- Should we include `sx`, `sy` in the repr, or always compute them from `w`, `h`? compute from w,h +- Should we store `dots_indices` or reconstruct the `dots` array from grid by calling `game_update_dots()`? +- Which flags in the `space.flags` field are canonical vs solver/UI flags? (F_DOT, F_EDGE_SET, F_TILE_ASSOC are canonical; F_MARK, F_REACHABLE, F_SCRATCH, F_MULTIPLE, F_DOT_HOLD, F_GOOD, F_DOT_BLACK are likely not) + +### 2. Space Struct Fields + +**Question**: Which fields in the `space` struct are canonical? + +The `space` struct has: +- `x`, `y` - position (can be recomputed from index) +- `type` - s_tile, s_edge, s_vertex (can be recomputed from x, y position) +- `flags` - bitfield (needs careful filtering) +- `dotx`, `doty` - if F_TILE_ASSOC is set (canonical) +- `nassoc` - if F_DOT is set (canonical) + +**Proposed approach**: +- Store only: `flags` (filtered), `dotx`, `doty`, `nassoc` +- Recompute `x`, `y`, `type` during reconstruction + +### 3. Solver Flags to Clear + +**Question**: Which flags need to be cleared after verification? + +From the code, solver flags that should be cleared: +- `F_MARK` (0x10) - scratch flag +- `F_REACHABLE` (0x20) +- `F_SCRATCH` (0x40) +- `F_MULTIPLE` (0x80) +- `F_DOT_HOLD` (0x100) +- `F_GOOD` (0x200) + +**Canonical flags to preserve**: +- `F_DOT` (0x1) +- `F_EDGE_SET` (0x2) +- `F_TILE_ASSOC` (0x4) +- `F_DOT_BLACK` (0x8) - UI flag, but might be needed? + +### 4. Reconstruction Steps + +**Question**: What internal structures need to be rebuilt? + +From analyzing the code: +1. `dots` array - needs to be rebuilt from grid using `game_update_dots()` +2. `ndots` - computed by `game_update_dots()` +3. `completed` - computed by `check_complete()` +4. `sx`, `sy` - computed from `w`, `h` in `blank_game()` + +**Proposed reconstruction order**: +1. Create params from repr (w, h, diff=0) +2. Create blank state using `blank_game()` or similar +3. Copy grid array (filtering flags) +4. Call `game_update_dots()` to rebuild dots array +5. Call `check_complete()` to set `completed` flag +6. Clear solver flags from grid + +### 5. Validation Requirements + +**Question**: What validation is needed in the Python layer? + +- Validate `w`, `h` are integers and within reasonable bounds +- Validate `grid` is a list with length `sx * sy` where `sx = (w*2)+1`, `sy = (h*2)+1` +- Validate each space in grid has required fields (flags, dotx, doty, nassoc) +- Validate `dotx`, `doty` are within bounds if `F_TILE_ASSOC` is set +- Validate `nassoc` is non-negative if `F_DOT` is set + +## Implementation Plan + +### Phase 1: C Layer - Repr Structs + +**File**: `puzzles/galaxies.c` + +**Location**: Before `game_state` struct (around line 178) + +```c +/* Repr structs for Python state dict loading */ +typedef struct galaxies_space_repr { + unsigned int flags; /* Only canonical flags: F_DOT, F_EDGE_SET, F_TILE_ASSOC */ + int dotx, doty; /* If flags & F_TILE_ASSOC */ + int nassoc; /* If flags & F_DOT */ +} galaxies_space_repr; + +typedef struct galaxies_state_repr { + int w; + int h; + const galaxies_space_repr *grid; /* Length: (w*2+1) * (h*2+1) */ +} galaxies_state_repr; +``` + +**Key Decisions**: +- Only store canonical flags (F_DOT, F_EDGE_SET, F_TILE_ASSOC) +- Store dotx, doty, nassoc as they are part of the game state +- Do NOT store x, y, type (recomputed from position) +- Do NOT store sx, sy (recomputed from w, h) + +### Phase 2: C Layer - Reconstruction Function + +**File**: `puzzles/galaxies.c` + +**Location**: After `load_game()` function (around line 1757) + +**Function**: `galaxies_state_from_repr()` + +**Implementation steps**: +1. Validate input (check r != NULL) +2. Create params: `w = r->w`, `h = r->h`, `diff = 0` +3. Create blank state using `blank_game(w, h)` +4. Compute `sx = (w*2)+1`, `sy = (h*2)+1`, `sz = sx * sy` +5. Copy grid array: + - For each space in repr->grid: + - Set `flags` (only canonical flags) + - Set `dotx`, `doty` if `F_TILE_ASSOC` is set + - Set `nassoc` if `F_DOT` is set + - Preserve `x`, `y`, `type` from blank_game +6. Call `game_update_dots(state)` to rebuild dots array +7. Call `check_complete(state, NULL, NULL)` to set `completed` flag +8. Clear solver flags from grid: + ```c + for (i = 0; i < sz; i++) { + state->grid[i].flags &= ~(F_MARK | F_REACHABLE | F_SCRATCH | + F_MULTIPLE | F_DOT_HOLD | F_GOOD); + } + ``` +9. Set `used_solve = false`, `cdiff = -1` +10. Return state pointer + +### Phase 3: Python ctypes Layer - Struct Definitions + +**File**: `rlp/specific_api.py` + +**Location**: In `set_api_structures_puzzle()` function, add before the function: + +```python +class GalaxiesSpaceRepr(c.Structure): + pass + +class GalaxiesStateRepr(c.Structure): + pass +``` + +**Inside `set_api_structures_puzzle()` function**: + +```python +if puzzle_name == "galaxies": + GalaxiesSpaceRepr._fields_ = [ + ("flags", c.c_uint), + ("dotx", c.c_int), + ("doty", c.c_int), + ("nassoc", c.c_int), + ] + + GalaxiesStateRepr._fields_ = [ + ("w", c.c_int), + ("h", c.c_int), + ("grid", CT_PTR(GalaxiesSpaceRepr)), + ] +``` + +### Phase 4: Python API Layer - Wire C Function + +**File**: `rlp/puzzle.py` + +**Location**: In `Puzzle.__init__()` method, add after undead section (around line 188): + +```python +elif self.puzzle_name == "galaxies": + # Add state_from_repr function + from rlp import specific_api as specific + self._state_from_repr = wrap_function( + self._lib, "galaxies_state_from_repr", + api.specific.GAMESTATE_PTR, + [c.POINTER(specific.GalaxiesStateRepr)] + ) +else: + self._text_parse = None + self._state_from_repr = None +``` + +### Phase 5: Python API Layer - Load Function + +**File**: `rlp/specific_api.py` + +**Location**: After `load_state_dict_undead()` function (around line 3460) + +**Function**: `load_state_dict_galaxies()` + +**Implementation**: +1. Validate required fields: `w`, `h`, `grid` +2. Validate types: `w`, `h` are ints, `grid` is a list +3. Compute `sx = (w*2)+1`, `sy = (h*2)+1`, `sz = sx * sy` +4. Validate `grid` length matches `sz` +5. Validate each space in grid: + - Has `flags`, `dotx`, `doty`, `nassoc` fields + - `flags` is an integer + - `dotx`, `doty`, `nassoc` are integers + - If `F_TILE_ASSOC` is set, validate `dotx`, `doty` are within bounds + - If `F_DOT` is set, validate `nassoc >= 0` +6. Create ctypes arrays: + - `grid_arr = (GalaxiesSpaceRepr * sz)(...)` +7. Build `GalaxiesStateRepr` struct +8. Call C function `galaxies_state_from_repr()` +9. Return state pointer + +### Phase 6: Python API Layer - Add Puzzle Method + +**File**: `rlp/puzzle.py` + +**Location**: In `Puzzle` class, add `load_state_dict()` method (around line 530) + +**Update existing method** to handle galaxies: + +```python +def load_state_dict(self, state_dict: dict) -> api.specific.GAMESTATE_PTR: + """ + Load a puzzle game state from a Python state dict. + + Args: + state_dict: Dictionary containing state information (from get_puzzle_state) + + Returns: + GameState pointer (caller must free it using game.free_game()) + + Raises: + ValueError: If puzzle doesn't support this or if state dict is invalid + """ + if self.puzzle_name not in ("bridges", "undead", "galaxies"): + raise ValueError(f"load_state_dict is only supported for bridges, undead, and galaxies puzzles, not {self.puzzle_name}") + + if self._state_from_repr is None: + raise ValueError("puzzle_state_from_repr function not available") + + from rlp import specific_api as specific + + # Call the load function + if self.puzzle_name == "galaxies": + state_ptr = specific.load_state_dict_galaxies(state_dict, self._lib) + elif self.puzzle_name == "undead": + state_ptr = specific.load_state_dict_undead(state_dict, self._lib) + elif self.puzzle_name == "bridges": + state_ptr = specific.load_state_dict_bridges(state_dict, self._lib) + + return state_ptr +``` + +### Phase 7: Testing + +**File**: `test_load_state_dict_galaxies.py` (new file) + +**Test cases**: +1. `test_load_problem_state` - Load initial problem state, verify it matches +2. `test_load_solution_state` - Load solved state, verify `completed=True` +3. `test_round_trip_problem` - Problem state → dict → load → dict → compare +4. `test_round_trip_solution` - Solution state → dict → load → dict → compare +5. `test_multiple_sizes` - Test with different puzzle sizes (5x5, 7x7, 10x10) +6. `test_state_verification` - Verify `check_complete()` results match +7. `test_swap_states_between_instances` - Swap states between two puzzle instances +8. `test_validation_errors` - Test invalid state dicts raise appropriate exceptions +9. `test_dots_reconstruction` - Verify dots array is correctly rebuilt +10. `test_solver_flags_cleared` - Verify solver flags are cleared after loading + +**Ignore fields for comparison**: +- `sx`, `sy` (computed from w, h) +- `ndots` (computed from grid) +- `dots_indices` (computed from grid) +- `completed` (computed by check_complete, but should match) +- `used_solve` (UI state) +- `cdiff` (derived) + +## Open Questions Requiring Answers + +1. **Should `F_DOT_BLACK` be considered canonical?** It's a UI flag but might affect puzzle state representation. + +2. **Should we validate that `dots_indices` in the state dict matches the actual dots found in grid?** This could catch inconsistencies. + +3. **How should we handle the `dots` array pointer comparison?** The pointers will be different after reconstruction, but the contents should match. + +4. **Should `sx`, `sy` be included in the repr for validation purposes, even though they're derived?** + +5. **What are the bounds for `dotx`, `doty`?** Should they be validated against `sx`, `sy` or `w`, `h`? + +## Implementation Checklist + +- [ ] Define C repr structs (`galaxies_space_repr`, `galaxies_state_repr`) +- [ ] Implement C reconstruction function (`galaxies_state_from_repr`) + - [ ] Create params from repr + - [ ] Create blank state + - [ ] Copy grid array (filtering flags) + - [ ] Rebuild dots array (`game_update_dots`) + - [ ] Run verification (`check_complete`) + - [ ] Clear solver flags +- [ ] Define Python ctypes structs (match C exactly) +- [ ] Wire C function in `puzzle.py` +- [ ] Implement Python load function with validation +- [ ] Update `Puzzle.load_state_dict()` method +- [ ] Create comprehensive tests +- [ ] Recompile library (`cmake --build rlp/lib --target libgalaxies`) +- [ ] Run tests and verify all pass + +## Files to Modify + +1. **puzzles/galaxies.c**: + - Add repr structs + - Implement `galaxies_state_from_repr()` function + +2. **rlp/specific_api.py**: + - Add `GalaxiesSpaceRepr` and `GalaxiesStateRepr` ctypes structures + - Implement `load_state_dict_galaxies()` function + +3. **rlp/puzzle.py**: + - Wire `galaxies_state_from_repr` in `__init__()` + - Update `load_state_dict()` method to handle galaxies + +4. **test_load_state_dict_galaxies.py** (new): + - Create comprehensive test suite + +## Next Steps + +1. **Answer clarifying questions** above +2. **Review and approve** this plan +3. **Implement Phase 1-2** (C layer) +4. **Test C layer** with simple test cases +5. **Implement Phase 3-6** (Python layer) +6. **Create and run tests** (Phase 7) +7. **Fix any issues** found during testing +8. **Document** any deviations from the plan + diff --git a/submodules/rlp/LICENSE b/submodules/rlp/LICENSE new file mode 100644 index 0000000000000000000000000000000000000000..1b30647c925becdfab120c66d57c60271f060030 --- /dev/null +++ b/submodules/rlp/LICENSE @@ -0,0 +1,21 @@ +MIT License + +Copyright (c) 2024 ETH Zurich Distributed Computing Group + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. diff --git a/submodules/rlp/LOAD_STATE_DICT_IMPLEMENTATION_GUIDE.md b/submodules/rlp/LOAD_STATE_DICT_IMPLEMENTATION_GUIDE.md new file mode 100644 index 0000000000000000000000000000000000000000..a15b37eb136264eedc0d70bdee61ffdf03cd1abd --- /dev/null +++ b/submodules/rlp/LOAD_STATE_DICT_IMPLEMENTATION_GUIDE.md @@ -0,0 +1,515 @@ +# Load State Dict Implementation Guide + +This document summarizes the implementation of `load_state_dict` functionality for Bridges puzzle, which allows loading a Python state dict into a C game state. This can be used as a guide for implementing the same functionality for other puzzles (e.g., undead). + +## Overview + +The `load_state_dict` feature enables: +- Loading arbitrary puzzle states from Python dictionaries +- Verifying if an ASCII board state (from LLM or other sources) is solved +- Swapping states between puzzle instances +- Round-trip testing: state → dict → load → dict → compare + +## Architecture + +The implementation follows a three-layer architecture: + +1. **C Layer**: Defines repr structs and reconstruction function +2. **Python ctypes Layer**: Defines Python structs matching C structs +3. **Python API Layer**: Provides user-facing functions with validation + +## Implementation Steps + +### 1. C Layer: Define Repr Structs + +**Location**: In the puzzle's `.c` file (e.g., `puzzles/bridges.c`) + +**Add before the `game_state` struct**: + +```c +/* Repr structs for Python state dict loading */ +typedef struct puzzle_island_repr { /* Adjust name for puzzle */ + int x; + int y; + int count; /* or other relevant fields */ +} puzzle_island_repr; + +typedef struct puzzle_state_repr { + int w; + int h; + /* Add puzzle-specific canonical fields */ + int maxb; /* Example: bridges-specific */ + bool allowloops; /* Example: bridges-specific */ + int n_islands; /* Adjust for puzzle structure */ + const puzzle_island_repr *islands; /* Adjust type */ + const grid_type *grid; /* Adjust type */ + const unsigned char *lines; /* Adjust type */ + /* Only include fields needed for reconstruction */ +} puzzle_state_repr; +``` + +**Key Points**: +- Only include **canonical fields** needed for reconstruction +- Do NOT include derived fields (computed by backend) +- Do NOT include generation parameters (islands, expansion, difficulty) +- Do NOT include UI/solver flags + +### 2. C Layer: Implement Reconstruction Function + +**Location**: After existing parse functions (e.g., after `puzzle_text_parse`) + +**Function signature**: +```c +game_state *puzzle_state_from_repr(const puzzle_state_repr *r) +``` + +**Implementation pattern**: +```c +game_state *puzzle_state_from_repr(const puzzle_state_repr *r) +{ + game_params params; + game_state *st; + int wh, i; + + if (!r) { + return NULL; + } + + /* Fill params from repr - only canonical fields */ + params.w = r->w; + params.h = r->h; + /* Add puzzle-specific params */ + params.maxb = r->maxb; + params.allowloops = r->allowloops; + + /* Generation parameters - set to 0 (not needed for verification) */ + params.islands = 0; + params.expansion = 0; + params.difficulty = 0; + + /* Create new state */ + st = new_state(¶ms); + if (!st) { + return NULL; + } + + wh = r->w * r->h; + + /* Copy canonical arrays */ + if (r->grid) { + for (i = 0; i < wh; i++) { + st->grid[i] = r->grid[i]; + } + } + + if (r->lines) { + for (i = 0; i < wh; i++) { + st->lines[i] = r->lines[i]; + } + } + + /* Rebuild puzzle-specific structures */ + /* Example for bridges: rebuild islands */ + sfree(st->islands); + st->islands = NULL; + st->n_islands = 0; + st->n_islands_alloc = 0; + + /* Clear flags first */ + for (i = 0; i < wh; i++) { + st->grid[i] &= ~G_ISLAND; /* Adjust for puzzle */ + } + + /* Add structures from repr */ + if (r->islands && r->n_islands > 0) { + for (i = 0; i < r->n_islands; i++) { + const puzzle_island_repr *ir = &r->islands[i]; + puzzle_add_island(st, ir->x, ir->y, ir->count); /* Adjust function name */ + } + } + + /* Fix up internal structures */ + puzzle_fixup_internal(st); /* Adjust function name */ + puzzle_find_connections(st); /* Adjust function name */ + + /* Recompute derived fields */ + puzzle_update_derived(st); /* Adjust function name */ + + /* Verify state */ + st->completed = puzzle_check(st); /* Adjust function name */ + st->solved = false; + + /* IMPORTANT: Clear solver flags that verification might set */ + for (i = 0; i < wh; i++) { + st->grid[i] &= ~(G_SWEEP | G_WARN); /* Adjust flags for puzzle */ + } + + return st; +} +``` + +**Critical Steps**: +1. Create params from repr (only canonical fields) +2. Create new state +3. Copy canonical arrays +4. Rebuild puzzle-specific structures (islands, etc.) +5. Fix up internal structures (pointers, indices) +6. Recompute derived fields (possibles, max values, etc.) +7. Run verification (`puzzle_check`) to set `completed` flag +8. **Clear solver flags** (G_SWEEP, G_WARN, etc.) - these are not part of game state + +### 3. Python ctypes Layer: Define Structs + +**Location**: `rlp/specific_api.py` in `set_api_structures_puzzle()` function + +**Add at module level** (before the function): +```python +class PuzzleIslandRepr(c.Structure): + pass + +class PuzzleStateRepr(c.Structure): + pass +``` + +**Inside `set_api_structures_puzzle()` function**: +```python +PuzzleIslandRepr._fields_ = [ + ("x", c.c_int), + ("y", c.c_int), + ("count", c.c_int), # Adjust fields for puzzle +] + +PuzzleStateRepr._fields_ = [ + ("w", c.c_int), + ("h", c.c_int), + ("maxb", c.c_int), # Adjust for puzzle + ("allowloops", c.c_bool), # Adjust for puzzle + ("n_islands", c.c_int), + ("islands", CT_PTR(PuzzleIslandRepr)), + ("grid", CT_UINT_PTR), + ("lines", CT_PTR(c.c_ubyte)), +] +``` + +**Key Points**: +- Struct fields must match C struct exactly (order, types) +- Use `CT_PTR` for pointers +- Use appropriate ctypes types (`c.c_int`, `c.c_bool`, `c.c_ubyte`, etc.) + +### 4. Python API Layer: Wire C Function + +**Location**: `rlp/puzzle.py` in `Puzzle.__init__()` method + +**Add near other puzzle-specific function wrappers**: +```python +if self.puzzle_name == "puzzle_name": + # ... existing code ... + + # Add state_from_repr function + from rlp import specific_api as specific + self._state_from_repr = wrap_function( + self._lib, "puzzle_state_from_repr", + api.specific.GAMESTATE_PTR, + [c.POINTER(specific.PuzzleStateRepr)] + ) +``` + +### 5. Python API Layer: Implement Load Function + +**Location**: `rlp/specific_api.py` after `get_puzzle_state_puzzle()` function + +**Function**: +```python +def load_state_dict_puzzle(state_dict: dict, lib: c.PyDLL) -> c.POINTER(GameState): + """ + Load a puzzle game state from a Python state dict. + + Args: + state_dict: Dictionary containing state information (from get_puzzle_state_puzzle) + lib: PyDLL instance for the puzzle library + + Returns: + GameState pointer (caller must free it using game.free_game()) + + Raises: + ValueError: If required fields are missing or have wrong types + """ + # Validate required fields exist + required_fields = ["w", "h", "params", "grid", "lines", "islands"] # Adjust for puzzle + for field in required_fields: + if field not in state_dict: + raise ValueError(f"Missing required field: {field}") + + # Validate types + if not isinstance(state_dict["w"], int) or not isinstance(state_dict["h"], int): + raise ValueError("w and h must be integers") + if not isinstance(state_dict["grid"], list) or not isinstance(state_dict["lines"], list): + raise ValueError("grid and lines must be lists") + if not isinstance(state_dict["islands"], list): + raise ValueError("islands must be a list") + if not isinstance(state_dict["params"], dict): + raise ValueError("params must be a dict") + + # Extract values + w = state_dict["w"] + h = state_dict["h"] + wh = w * h + + # Validate params (adjust for puzzle) + if "maxb" not in state_dict["params"]: + raise ValueError("params.maxb is required") + if "allowloops" not in state_dict["params"]: + raise ValueError("params.allowloops is required") + + maxb = state_dict["params"]["maxb"] + allowloops = bool(state_dict["params"]["allowloops"]) + + # Validate array lengths + if len(state_dict["grid"]) != wh: + raise ValueError(f"grid length ({len(state_dict['grid'])}) does not match w*h ({wh})") + if len(state_dict["lines"]) != wh: + raise ValueError(f"lines length ({len(state_dict['lines'])}) does not match w*h ({wh})") + + # Validate islands (adjust for puzzle structure) + islands_list = state_dict["islands"] + n_islands = len(islands_list) + for i, island in enumerate(islands_list): + if not isinstance(island, dict): + raise ValueError(f"islands[{i}] must be a dict") + if "x" not in island or "y" not in island or "count" not in island: + raise ValueError(f"islands[{i}] must have x, y, and count fields") + if not isinstance(island["x"], int) or not isinstance(island["y"], int) or not isinstance(island["count"], int): + raise ValueError(f"islands[{i}] x, y, and count must be integers") + + # Create ctypes arrays + grid_arr = (c.c_uint * wh)(*state_dict["grid"]) + lines_arr = (c.c_ubyte * wh)(*state_dict["lines"]) + + # Create islands repr array (extract only needed fields, ignore adj/computed fields) + islands_arr = (PuzzleIslandRepr * n_islands)( + *[PuzzleIslandRepr( + x=island["x"], + y=island["y"], + count=island["count"] + ) for island in islands_list] + ) + + # Build PuzzleStateRepr struct + repr_obj = PuzzleStateRepr( + w=w, + h=h, + maxb=maxb, + allowloops=allowloops, + n_islands=n_islands, + islands=islands_arr, + grid=grid_arr, + lines=lines_arr, + ) + + # Get the function from lib + state_from_repr_func = lib.puzzle_state_from_repr + state_from_repr_func.restype = GAMESTATE_PTR + state_from_repr_func.argtypes = [c.POINTER(PuzzleStateRepr)] + + # Call C function + state_ptr = state_from_repr_func(c.byref(repr_obj)) + + if not state_ptr: + raise ValueError("Failed to create game state from repr") + + # Return the pointer (caller must free it) + return state_ptr +``` + +### 6. Python API Layer: Add Puzzle Method + +**Location**: `rlp/puzzle.py` in `Puzzle` class + +**Method**: +```python +def load_state_dict(self, state_dict: dict) -> api.specific.GAMESTATE_PTR: + """ + Load a puzzle game state from a Python state dict. + + Args: + state_dict: Dictionary containing state information (from get_puzzle_state) + + Returns: + GameState pointer (caller must free it using game.free_game()) + + Raises: + ValueError: If puzzle doesn't support this or if state dict is invalid + """ + if self.puzzle_name != "puzzle_name": + raise ValueError(f"load_state_dict is only supported for puzzle_name puzzle, not {self.puzzle_name}") + + if self._state_from_repr is None: + raise ValueError("puzzle_state_from_repr function not available") + + from rlp import specific_api as specific + + # Call the load function + state_ptr = specific.load_state_dict_puzzle(state_dict, self._lib) + + return state_ptr +``` + +## Critical Gotchas and Important Notes + +### 1. Memory Management +- **Always return a pointer** from C function (not contents) +- **Caller must free** the returned state using `game.free_game(state_ptr)` +- Use try/finally blocks in Python to ensure cleanup +- Pattern: `state_ptr = puzzle.load_state_dict(dict)` → use → `game.free_game(state_ptr)` + +### 2. Solver Flags Must Be Cleared +- After calling verification (`puzzle_check`), **clear solver flags** (G_SWEEP, G_WARN, etc.) +- These flags are set during verification but are NOT part of the game state +- If not cleared, round-trip tests will fail with grid value mismatches +- Example: `st->grid[i] &= ~(G_SWEEP | G_WARN);` + +### 3. Only Include Canonical Fields +- **DO include**: w, h, grid, lines, islands (x, y, count), puzzle-specific rules (maxb, allowloops) +- **DON'T include**: + - Derived fields (wha, possv, possh, maxv, maxh) - recomputed by backend + - Generation parameters (islands, expansion, difficulty) - not needed for verification + - UI flags (G_MARK, etc.) + - Solver state (dsf, tmpdsf, etc.) + - Computed adjacency data (adj) - recomputed by `puzzle_find_connections` + +### 4. Test Comparison Logic +- Use `ignore_fields` in test comparisons to ignore: + - Generation parameters (`params.islands`, `params.expansion`, `params.difficulty`) + - Allocation details (`n_islands_alloc`) + - Solver flags in grid values (mask out G_SWEEP, G_WARN when comparing) +- Compare grid values with flags masked: `val1 & ~(0x1000 | 0x0080)` + +### 5. Pointer Dereferencing +- When accessing state fields: use `.contents` (e.g., `state_ptr.contents.completed`) +- When passing to functions expecting GameState: use `.contents` +- When freeing: pass the pointer directly (e.g., `game.free_game(state_ptr)`) + +### 6. Validation is Critical +- Validate all required fields exist +- Validate types (int, list, dict) +- Validate array lengths match w*h +- Validate island structures have required fields +- Raise clear ValueError messages for debugging + +### 7. Function Naming Convention +- C function: `puzzle_name_state_from_repr` (e.g., `bridges_state_from_repr`) +- Python function: `load_state_dict_puzzle_name` (e.g., `load_state_dict_bridges`) +- Struct names: `PuzzleNameIslandRepr`, `PuzzleNameStateRepr` + +### 8. Recompilation Required +- After modifying C code, must recompile: `cmake --build rlp/lib --target libpuzzle_name` +- Python changes don't require recompilation (unless ctypes structs change) + +## Testing Strategy + +### Essential Tests + +1. **test_load_problem_state**: Load initial problem state, verify it matches +2. **test_load_solution_state**: Load solved state, verify `completed=True` +3. **test_round_trip_problem**: Problem state → dict → load → dict → compare +4. **test_round_trip_solution**: Solution state → dict → load → dict → compare +5. **test_multiple_sizes**: Test with different puzzle sizes +6. **test_state_verification**: Verify `map_check()` results match +7. **test_swap_states_between_instances**: Swap states between two puzzle instances +8. **test_validation_errors**: Test invalid state dicts raise appropriate exceptions + +### Test Pattern + +```python +def test_example(): + puzzle = rp.Puzzle('puzzle_name', arg='5x5de', headless=True) + puzzle.new_game() + + # Get state dict + original_dict = puzzle.get_puzzle_state() + + # Load state dict + me = puzzle.fe.contents.me.contents + game = me.ourgame.contents + free_game_func = game.free_game + + loaded_state_ptr = puzzle.load_state_dict(original_dict) + + try: + # Use loaded state + helper = getattr(puzzle, "_get_puzzle_state_helper", None) + loaded_dict = specific.get_puzzle_state_dict( + puzzle.puzzle_name, loaded_state_ptr.contents, helper + ) + + # Compare (with ignore_fields) + ignore_fields = { + 'params.difficulty', + 'params.islands', # If applicable + 'params.expansion', # If applicable + 'n_islands_alloc', # If applicable + } + differences = deep_compare_dicts(original_dict, loaded_dict, ignore_fields=ignore_fields) + assert len(differences) == 0, f"State dicts differ: {differences}" + finally: + # Always free + if loaded_state_ptr: + free_game_func(loaded_state_ptr) +``` + +## Files Modified (Bridges Example) + +1. **puzzles/bridges.c**: + - Added `bridges_island_repr` and `bridges_state_repr` structs + - Implemented `bridges_state_from_repr()` function + +2. **rlp/specific_api.py**: + - Added `BridgesIslandRepr` and `BridgesStateRepr` ctypes structures + - Implemented `load_state_dict_bridges()` function + +3. **rlp/puzzle.py**: + - Wired `bridges_state_from_repr` in `__init__()` + - Added `load_state_dict()` method + +4. **test_load_state_dict.py**: + - Created comprehensive test suite + +## Checklist for New Puzzle Implementation + +- [ ] Define C repr structs (only canonical fields) +- [ ] Implement C reconstruction function + - [ ] Create params from repr + - [ ] Create new state + - [ ] Copy canonical arrays + - [ ] Rebuild puzzle-specific structures + - [ ] Fix up internal structures + - [ ] Recompute derived fields + - [ ] Run verification + - [ ] Clear solver flags +- [ ] Define Python ctypes structs (match C exactly) +- [ ] Wire C function in puzzle.py +- [ ] Implement Python load function with validation +- [ ] Add Puzzle.load_state_dict() method +- [ ] Create comprehensive tests +- [ ] Recompile library +- [ ] Run tests and verify all pass + +## Common Pitfalls + +1. **Forgetting to clear solver flags** → Grid value mismatches in tests +2. **Including non-canonical fields** → Unnecessary complexity, potential bugs +3. **Not validating input** → Runtime crashes with unclear errors +4. **Memory leaks** → Not freeing loaded states in tests +5. **Pointer vs contents confusion** → AttributeError or incorrect behavior +6. **Struct field order mismatch** → Silent corruption or crashes +7. **Not recompiling after C changes** → Old code runs, tests fail mysteriously + +## Success Criteria + +- All tests pass +- Round-trip tests show no differences (except ignored fields) +- State swapping works correctly +- Memory is properly managed (no leaks) +- Validation catches invalid inputs +- ASCII strings match after loading + diff --git a/submodules/rlp/PATTERN_LOAD_STATE_DICT_IMPLEMENTATION_PLAN.md b/submodules/rlp/PATTERN_LOAD_STATE_DICT_IMPLEMENTATION_PLAN.md new file mode 100644 index 0000000000000000000000000000000000000000..57f8248910b792070fd23a979bec748410cf9d65 --- /dev/null +++ b/submodules/rlp/PATTERN_LOAD_STATE_DICT_IMPLEMENTATION_PLAN.md @@ -0,0 +1,612 @@ +# Pattern Puzzle Load State Dict Implementation Plan + +This document provides a detailed implementation plan for adding `load_state_dict` functionality to the Pattern puzzle, following the template from Bridges puzzle implementation. + +## Overview + +The `load_state_dict` feature for Pattern puzzle will enable: +- Loading arbitrary puzzle states from Python dictionaries +- Verifying if an ASCII board state (from LLM or other sources) is solved +- Swapping states between puzzle instances +- Round-trip testing: state → dict → load → dict → compare + +## Pattern Puzzle Structure + +### Canonical Fields (Must Include in Repr) +- `w`, `h` - grid dimensions +- `rowdata` - flattened array of clue values (size: `rowsize * (w + h)`) +- `rowlen` - array of clue lengths for each row/column (size: `w + h`) +- `immutable` - boolean array marking which cells are immutable clues (size: `w * h`) +- `grid` - player's current marks (size: `w * h`, values: GRID_UNKNOWN=2, GRID_FULL=1, GRID_EMPTY=0) + +### Non-Canonical / Derived Fields (Recompute) +- `rowsize` - `max(w, h)` - recompute +- `refcount` - internal, set to 1 +- `fontsize` - recompute from rowdata (FS_LARGE if all clues < 10, else FS_SMALL) +- `completed` - recompute via `compute_rowdata` comparison (like `execute_move` does) +- `cheated` - set to false + +## Implementation Steps + +### 1. C Layer: Define Repr Structs + +**Location**: `puzzles/pattern.c` - Add before the `game_state` struct (around line 60) + +```c +/* Repr structs for Python state dict loading */ +typedef struct pattern_state_repr { + int w; + int h; + int rowsize; /* max(w, h) - for array sizing */ + int n_rowcol; /* w + h - number of rows + columns */ + const int *rowdata; /* flattened, size rowsize * n_rowcol */ + const int *rowlen; /* size n_rowcol */ + const bool *immutable; /* size w * h */ + const unsigned char *grid; /* size w * h */ +} pattern_state_repr; +``` + +**Key Points**: +- No separate "island" struct needed (unlike Bridges) +- `rowdata` is flattened: `rowdata[rowsize * i + j]` for row/column `i`, clue `j` +- `rowlen[i]` gives the number of clues for row/column `i` +- `n_rowcol = w + h` (first `w` entries are columns, next `h` entries are rows) + +### 2. C Layer: Implement Reconstruction Function + +**Location**: `puzzles/pattern.c` - Add after existing functions (after `new_game`, around line 1045) + +**Function signature**: +```c +game_state *pattern_state_from_repr(const pattern_state_repr *r) +``` + +**Implementation**: +```c +game_state *pattern_state_from_repr(const pattern_state_repr *r) +{ + game_params params; + game_state *st; + game_state_common *common; + int wh, wph, rowsize, i, j; + + if (!r) { + return NULL; + } + + /* Validate dimensions */ + if (r->w <= 0 || r->h <= 0) { + return NULL; + } + if (r->rowsize != max(r->w, r->h)) { + return NULL; /* rowsize must match max(w, h) */ + } + if (r->n_rowcol != r->w + r->h) { + return NULL; /* n_rowcol must match w + h */ + } + + /* Fill params from repr - only canonical fields */ + params.w = r->w; + params.h = r->h; + + wh = r->w * r->h; + wph = r->w + r->h; + rowsize = max(r->w, r->h); + + /* Allocate game_state */ + st = snew(game_state); + if (!st) { + return NULL; + } + + /* Allocate and initialize game_state_common */ + common = snew(game_state_common); + if (!common) { + sfree(st); + return NULL; + } + + common->w = r->w; + common->h = r->h; + common->rowsize = rowsize; + common->refcount = 1; /* Set to 1 for new state */ + + /* Allocate arrays */ + st->grid = snewn(wh, unsigned char); + common->rowdata = snewn(rowsize * wph, int); + common->rowlen = snewn(wph, int); + common->immutable = snewn(wh, bool); + + if (!st->grid || !common->rowdata || !common->rowlen || !common->immutable) { + /* Cleanup on failure */ + if (st->grid) sfree(st->grid); + if (common->rowdata) sfree(common->rowdata); + if (common->rowlen) sfree(common->rowlen); + if (common->immutable) sfree(common->immutable); + sfree(common); + sfree(st); + return NULL; + } + + st->common = common; + + /* Copy canonical arrays */ + if (r->grid) { + for (i = 0; i < wh; i++) { + st->grid[i] = r->grid[i]; + } + } else { + memset(st->grid, GRID_UNKNOWN, wh); + } + + if (r->rowdata) { + for (i = 0; i < rowsize * wph; i++) { + common->rowdata[i] = r->rowdata[i]; + } + } else { + memset(common->rowdata, 0, rowsize * wph * sizeof(int)); + } + + if (r->rowlen) { + for (i = 0; i < wph; i++) { + common->rowlen[i] = r->rowlen[i]; + } + } else { + memset(common->rowlen, 0, wph * sizeof(int)); + } + + if (r->immutable) { + for (i = 0; i < wh; i++) { + common->immutable[i] = r->immutable[i]; + } + } else { + memset(common->immutable, 0, wh * sizeof(bool)); + } + + /* Recompute fontsize from rowdata */ + common->fontsize = FS_LARGE; + for (i = 0; i < r->w; i++) { + for (j = 0; j < common->rowlen[i]; j++) { + if (common->rowdata[rowsize * i + j] >= 10) { + common->fontsize = FS_SMALL; + goto fontsize_done; + } + } + } +fontsize_done: + + /* Initialize state flags */ + st->completed = false; + st->cheated = false; + + /* Verify state: recompute completed flag using same logic as execute_move */ + if (st->grid && common->rowdata && common->rowlen) { + int *rowdata_check = snewn(rowsize, int); + bool all_match = true; + + /* Check columns (first w entries) */ + for (i = 0; i < r->w && all_match; i++) { + int len = compute_rowdata(rowdata_check, st->grid + i, + r->h, r->w); + if (len != common->rowlen[i] || + memcmp(common->rowdata + rowsize * i, + rowdata_check, len * sizeof(int)) != 0) { + all_match = false; + break; + } + } + + /* Check rows (next h entries) */ + if (all_match) { + for (i = 0; i < r->h && all_match; i++) { + int len = compute_rowdata(rowdata_check, + st->grid + i * r->w, + r->w, 1); + int row_idx = r->w + i; + if (len != common->rowlen[row_idx] || + memcmp(common->rowdata + rowsize * row_idx, + rowdata_check, len * sizeof(int)) != 0) { + all_match = false; + break; + } + } + } + + st->completed = all_match; + sfree(rowdata_check); + } + + return st; +} +``` + +**Critical Steps**: +1. Validate input dimensions and array sizes +2. Allocate `game_state` and `game_state_common` separately +3. Copy all canonical arrays: `grid`, `rowdata`, `rowlen`, `immutable` +4. Recompute `fontsize` from `rowdata` +5. Recompute `completed` using `compute_rowdata` comparison (same as `execute_move`) +6. Set `refcount = 1` and `cheated = false` + +### 3. Python ctypes Layer: Define Structs + +**Location**: `rlp/specific_api.py` + +**Add at module level** (around line 128, after other repr structs): +```python +class PatternStateRepr(c.Structure): + pass +``` + +**Inside `set_api_structures_pattern()` function** (around line 1571, after `GameState._fields_`): +```python +PatternStateRepr._fields_ = [ + ("w", c.c_int), + ("h", c.c_int), + ("rowsize", c.c_int), + ("n_rowcol", c.c_int), + ("rowdata", CT_INT_PTR), + ("rowlen", CT_INT_PTR), + ("immutable", CT_BOOL_PTR), + ("grid", CT_UCHAR_PTR), +] +``` + +**Key Points**: +- Struct fields must match C struct exactly (order, types) +- Use `CT_INT_PTR` for `int*` pointers +- Use `CT_BOOL_PTR` for `bool*` pointers +- Use `CT_UCHAR_PTR` for `unsigned char*` pointers + +### 4. Python API Layer: Wire C Function + +**Location**: `rlp/puzzle.py` in `Puzzle.__init__()` method (around line 163) + +**Add in the puzzle-specific section**: +```python +elif self.puzzle_name == "pattern": + # Add state_from_repr function + from rlp import specific_api as specific + self._state_from_repr = wrap_function( + self._lib, "pattern_state_from_repr", + api.specific.GAMESTATE_PTR, + [c.POINTER(specific.PatternStateRepr)] + ) + self._text_parse = None +``` + +### 5. Python API Layer: Implement Load Function + +**Location**: `rlp/specific_api.py` after `get_puzzle_state_pattern()` function (around line 3047) + +**Function**: +```python +def load_state_dict_pattern(state_dict: dict, lib: c.PyDLL) -> c.POINTER(GameState): + """ + Load a Pattern puzzle game state from a Python state dict. + + Args: + state_dict: Dictionary containing state information (from get_puzzle_state_pattern) + lib: PyDLL instance for the puzzle library + + Returns: + GameState pointer (caller must free it using game.free_game()) + + Raises: + ValueError: If required fields are missing or have wrong types + """ + # Validate required fields exist + required_fields = ["common", "grid", "completed", "cheated"] + for field in required_fields: + if field not in state_dict: + raise ValueError(f"Missing required field: {field}") + + # Validate types + if not isinstance(state_dict["common"], dict): + raise ValueError("common must be a dict") + if not isinstance(state_dict["grid"], list): + raise ValueError("grid must be a list") + + # Extract common fields + common = state_dict["common"] + required_common_fields = ["w", "h", "rowsize", "rowdata", "rowlen", "immutable"] + for field in required_common_fields: + if field not in common: + raise ValueError(f"Missing required common field: {field}") + + w = common["w"] + h = common["h"] + rowsize = common["rowsize"] + wh = w * h + wph = w + h + + # Validate dimensions + if not isinstance(w, int) or not isinstance(h, int): + raise ValueError("w and h must be integers") + if w <= 0 or h <= 0: + raise ValueError("w and h must be positive") + if rowsize != max(w, h): + raise ValueError(f"rowsize ({rowsize}) must equal max(w, h) ({max(w, h)})") + + # Validate array types and lengths + if not isinstance(common["rowdata"], list): + raise ValueError("common.rowdata must be a list") + if not isinstance(common["rowlen"], list): + raise ValueError("common.rowlen must be a list") + if not isinstance(common["immutable"], list): + raise ValueError("common.immutable must be a list") + if not isinstance(state_dict["grid"], list): + raise ValueError("grid must be a list") + + # Validate array lengths + expected_rowdata_len = rowsize * wph + if len(common["rowdata"]) != expected_rowdata_len: + raise ValueError( + f"rowdata length ({len(common['rowdata'])}) does not match " + f"rowsize * (w + h) ({expected_rowdata_len})" + ) + if len(common["rowlen"]) != wph: + raise ValueError( + f"rowlen length ({len(common['rowlen'])}) does not match w + h ({wph})" + ) + if len(common["immutable"]) != wh: + raise ValueError( + f"immutable length ({len(common['immutable'])}) does not match w * h ({wh})" + ) + if len(state_dict["grid"]) != wh: + raise ValueError( + f"grid length ({len(state_dict['grid'])}) does not match w * h ({wh})" + ) + + # Validate array element types + for i, val in enumerate(common["rowdata"]): + if not isinstance(val, int): + raise ValueError(f"rowdata[{i}] must be an integer") + for i, val in enumerate(common["rowlen"]): + if not isinstance(val, int): + raise ValueError(f"rowlen[{i}] must be an integer") + if val < 0 or val > rowsize: + raise ValueError(f"rowlen[{i}] ({val}) must be between 0 and rowsize ({rowsize})") + for i, val in enumerate(common["immutable"]): + if not isinstance(val, bool): + raise ValueError(f"immutable[{i}] must be a boolean") + for i, val in enumerate(state_dict["grid"]): + if not isinstance(val, int): + raise ValueError(f"grid[{i}] must be an integer") + if val not in (0, 1, 2): # GRID_EMPTY, GRID_FULL, GRID_UNKNOWN + raise ValueError(f"grid[{i}] ({val}) must be 0, 1, or 2") + + # Create ctypes arrays + rowdata_arr = (c.c_int * (rowsize * wph))(*common["rowdata"]) + rowlen_arr = (c.c_int * wph)(*common["rowlen"]) + immutable_arr = (c.c_bool * wh)(*common["immutable"]) + grid_arr = (c.c_ubyte * wh)(*state_dict["grid"]) + + # Build PatternStateRepr struct + repr_obj = PatternStateRepr( + w=w, + h=h, + rowsize=rowsize, + n_rowcol=wph, + rowdata=rowdata_arr, + rowlen=rowlen_arr, + immutable=immutable_arr, + grid=grid_arr, + ) + + # Get the function from lib + state_from_repr_func = lib.pattern_state_from_repr + state_from_repr_func.restype = GAMESTATE_PTR + state_from_repr_func.argtypes = [c.POINTER(PatternStateRepr)] + + # Call C function + state_ptr = state_from_repr_func(c.byref(repr_obj)) + + if not state_ptr: + raise ValueError("Failed to create game state from repr") + + # Return the pointer (caller must free it) + return state_ptr +``` + +### 6. Python API Layer: Add Puzzle Method + +**Location**: `rlp/puzzle.py` in `Puzzle` class (check if method already exists, add if not) + +**Method** (add if not already present): +```python +def load_state_dict(self, state_dict: dict) -> api.specific.GAMESTATE_PTR: + """ + Load a puzzle game state from a Python state dict. + + Args: + state_dict: Dictionary containing state information (from get_puzzle_state) + + Returns: + GameState pointer (caller must free it using game.free_game()) + + Raises: + ValueError: If puzzle doesn't support this or if state dict is invalid + """ + if self.puzzle_name != "pattern": + raise ValueError(f"load_state_dict is only supported for pattern puzzle, not {self.puzzle_name}") + + if self._state_from_repr is None: + raise ValueError("pattern_state_from_repr function not available") + + from rlp import specific_api as specific + + # Call the load function + state_ptr = specific.load_state_dict_pattern(state_dict, self._lib) + + return state_ptr +``` + +## Critical Gotchas and Important Notes + +### 1. Memory Management +- **Always return a pointer** from C function (not contents) +- **Caller must free** the returned state using `game.free_game(state_ptr)` +- Pattern uses refcounted `game_state_common` - `free_game` handles refcounting +- Use try/finally blocks in Python to ensure cleanup +- Pattern: `state_ptr = puzzle.load_state_dict(dict)` → use → `game.free_game(state_ptr)` + +### 2. Rowdata Array Layout +- `rowdata` is **flattened**: `rowdata[rowsize * i + j]` where: + - `i` is row/column index (0 to w+h-1) + - First `w` entries (i=0 to w-1) are **columns** + - Next `h` entries (i=w to w+h-1) are **rows** + - `j` is clue index within that row/column (0 to rowlen[i]-1) +- When copying, must preserve this flattened layout + +### 3. Only Include Canonical Fields +- **DO include**: w, h, rowdata, rowlen, immutable, grid +- **DON'T include**: + - `rowsize` - recompute as `max(w, h)` + - `refcount` - set to 1 + - `fontsize` - recompute from rowdata + - `completed`, `cheated` - recompute + +### 4. Completion Verification +- Pattern's completion check uses `compute_rowdata` to compute actual row/column patterns +- Compare computed patterns against stored `rowdata` and `rowlen` +- Same logic as `execute_move` in `pattern.c` (lines 1477-1506) +- Must check all columns (first w entries) and all rows (next h entries) + +### 5. Fontsize Recomputation +- Check all column clues (first w entries in rowlen) +- If any clue value >= 10, set `fontsize = FS_SMALL` +- Otherwise `fontsize = FS_LARGE` +- See `new_game` in `pattern.c` (lines 1019-1023) + +### 6. Validation is Critical +- Validate all required fields exist +- Validate types (int, list, dict, bool) +- Validate array lengths match expected sizes +- Validate grid values are 0, 1, or 2 +- Validate rowlen values are between 0 and rowsize +- Raise clear ValueError messages for debugging + +### 7. Function Naming Convention +- C function: `pattern_state_from_repr` +- Python function: `load_state_dict_pattern` +- Struct name: `PatternStateRepr` + +### 8. Recompilation Required +- After modifying C code, must recompile: `cmake --build rlp/lib --target libpattern` +- Python changes don't require recompilation (unless ctypes structs change) + +## Testing Strategy + +### Essential Tests + +1. **test_load_problem_state**: Load initial problem state, verify it matches +2. **test_load_solution_state**: Load solved state, verify `completed=True` +3. **test_round_trip_problem**: Problem state → dict → load → dict → compare +4. **test_round_trip_solution**: Solution state → dict → load → dict → compare +5. **test_multiple_sizes**: Test with different puzzle sizes (5x5, 10x10, 15x15) +6. **test_state_verification**: Verify completion check results match +7. **test_swap_states_between_instances**: Swap states between two puzzle instances +8. **test_validation_errors**: Test invalid state dicts raise appropriate exceptions +9. **test_immutable_preservation**: Verify immutable cells are preserved correctly +10. **test_clue_arrays**: Verify rowdata and rowlen arrays are correctly preserved + +### Test Pattern + +```python +def test_pattern_example(): + puzzle = rp.Puzzle('pattern', arg='5x5', headless=True) + puzzle.new_game() + + # Get state dict + original_dict = puzzle.get_puzzle_state() + + # Load state dict + me = puzzle.fe.contents.me.contents + game = me.ourgame.contents + free_game_func = game.free_game + + loaded_state_ptr = puzzle.load_state_dict(original_dict) + + try: + # Use loaded state + helper = getattr(puzzle, "_get_puzzle_state_helper", None) + loaded_dict = specific.get_puzzle_state_dict( + puzzle.puzzle_name, loaded_state_ptr.contents, helper + ) + + # Compare (with ignore_fields) + ignore_fields = { + 'common.refcount', # Internal refcounting + 'common.fontsize', # Recomputed from rowdata + } + differences = deep_compare_dicts(original_dict, loaded_dict, ignore_fields=ignore_fields) + assert len(differences) == 0, f"State dicts differ: {differences}" + finally: + # Always free + if loaded_state_ptr: + free_game_func(loaded_state_ptr) +``` + +## Files to Modify + +1. **puzzles/pattern.c**: + - Add `pattern_state_repr` struct definition + - Implement `pattern_state_from_repr()` function + +2. **rlp/specific_api.py**: + - Add `PatternStateRepr` ctypes structure in `set_api_structures_pattern()` + - Implement `load_state_dict_pattern()` function + +3. **rlp/puzzle.py**: + - Wire `pattern_state_from_repr` in `__init__()` + - Add/update `load_state_dict()` method to support pattern + +4. **test_load_state_dict.py** (or create new test file): + - Create comprehensive test suite for pattern puzzle + +## Checklist for Implementation + +- [ ] Define C repr struct (`pattern_state_repr`) with canonical fields +- [ ] Implement C reconstruction function (`pattern_state_from_repr`) + - [ ] Validate input dimensions and sizes + - [ ] Allocate game_state and game_state_common + - [ ] Copy canonical arrays (grid, rowdata, rowlen, immutable) + - [ ] Recompute fontsize from rowdata + - [ ] Recompute completed flag using compute_rowdata comparison + - [ ] Set refcount = 1 and cheated = false +- [ ] Define Python ctypes struct (`PatternStateRepr`) matching C exactly +- [ ] Wire C function in puzzle.py `__init__()` +- [ ] Implement Python load function (`load_state_dict_pattern`) with validation +- [ ] Add/update `Puzzle.load_state_dict()` method +- [ ] Create comprehensive tests +- [ ] Recompile library: `cmake --build rlp/lib --target libpattern` +- [ ] Run tests and verify all pass + +## Common Pitfalls + +1. **Incorrect rowdata layout** → Clues don't match rows/columns +2. **Forgetting to recompute fontsize** → UI display issues +3. **Wrong completion check logic** → States marked complete when they shouldn't be +4. **Not validating array lengths** → Crashes or corruption +5. **Memory leaks** → Not freeing loaded states in tests +6. **Pointer vs contents confusion** → AttributeError or incorrect behavior +7. **Struct field order mismatch** → Silent corruption or crashes +8. **Not recompiling after C changes** → Old code runs, tests fail mysteriously +9. **Mixing up columns and rows** → First w entries are columns, next h are rows + +## Success Criteria + +- All tests pass +- Round-trip tests show no differences (except ignored fields: refcount, fontsize) +- State swapping works correctly +- Memory is properly managed (no leaks) +- Validation catches invalid inputs +- Completion verification works correctly +- Immutable cells are preserved +- Clue arrays (rowdata, rowlen) are correctly preserved + + + + + diff --git a/submodules/rlp/README.md b/submodules/rlp/README.md new file mode 100644 index 0000000000000000000000000000000000000000..6a36cf7a5959ffc19dd5a2981a4e3c1379ff2f5a --- /dev/null +++ b/submodules/rlp/README.md @@ -0,0 +1,156 @@ + +## Dataset Generation Pipeline + +This repository includes a unified pipeline for generating ASCII puzzle datasets for training and evaluation. The pipeline generates puzzles, creates DataFrames with train/test splits, and can optionally upload to HuggingFace Hub. + +### Quick Start + +```bash +# Generate 100 samples of bridges puzzle (5x5, easy difficulty) +python run_ascii_puzzle_generation_pipeline.py --puzzles "bridges:5x5de" --n_samples 100 + +# Generate multiple puzzle configurations +python run_ascii_puzzle_generation_pipeline.py --puzzles "bridges:5x5de,bridges:7x7dm,loopy:5x5de" --n_samples 500 + +# Generate with a custom suffix and upload to HuggingFace +python run_ascii_puzzle_generation_pipeline.py --puzzles "bridges:5x5de" --suffix "grpo_train" --n_samples 1000 +``` + +### Puzzle Configuration Format + +Puzzles are specified using the format `puzzle_name:size_difficulty`: + +| Component | Description | Examples | +|-----------|-------------|----------| +| `puzzle_name` | Name of the puzzle type | `bridges`, `galaxies`, `loopy`, `pattern`, `undead` | +| `size` | Grid dimensions | `5x5`, `7x7`, `10x10` | +| `difficulty` | Difficulty level suffix | `de` (easy), `dm` (medium), `dh` (hard) | + +**Examples:** +- `bridges:5x5de` - 5x5 bridges puzzle, easy difficulty +- `galaxies:7x7dm` - 7x7 galaxies puzzle, medium difficulty +- `loopy:10x10dh` - 10x10 loopy puzzle, hard difficulty + +### Available Puzzle Types and Difficulty Mappings + +| Puzzle | Easy | Medium | Hard | Notes | +|--------|------|--------|------|-------| +| `bridges` | `d0` | `d1` | `d2` | Numeric difficulty | +| `galaxies` | `dn` (normal) | `du` (unreasonable) | `du` | Only 2 difficulty levels | +| `loopy` | `de` | `dt` (tricky) | `dh` | Uses square grid (`t0`) | +| `pattern` | N/A | N/A | N/A | No difficulty parameter | +| `undead` | `de` | `dn` (normal) | `dt` (tricky) | Grid sizes: 4x4, 5x5, 7x7 | + +### Pipeline Arguments + +```bash +python run_ascii_puzzle_generation_pipeline.py [OPTIONS] +``` + +| Argument | Description | Default | +|----------|-------------|---------| +| `--puzzles` | Comma-separated puzzle configs (required) | - | +| `--n_samples` | Number of samples per config | 1000 | +| `--n_workers` | Parallel workers for generation | 4 | +| `--output_dir` | Base output directory | `./pipeline_output` | +| `--suffix` | Suffix for dataset names | None | +| `--test_only` | Put all samples in test split | False | +| `--dedupe_test200` | Dedupe train against test200 datasets | False | +| `--skip_generation` | Skip puzzle generation step | False | +| `--skip_df` | Skip DataFrame creation step | False | +| `--skip_upload` | Skip HuggingFace upload step | False | +| `--run_folder` | Use existing run folder | None | +| `--hf_token` | HuggingFace authentication token | None | +| `--commit_message` | Commit message for HuggingFace | None | + +### Output Structure + +Each puzzle configuration gets its own timestamped folder: + +``` +pipeline_output/ +├── bridges_5x5de_grpo_train_20251217_143052/ +│ ├── txt/ # Generated puzzle files +│ │ ├── bridges_5x5de_abc123.txt +│ │ └── ... +│ └── csvs/ # CSV with train/test splits +│ └── bridges_5x5de_grpo_train_20251217_143052.csv +└── ... +``` + +### Common Use Cases + +**Generate a test dataset (all samples in test split):** +```bash +python run_ascii_puzzle_generation_pipeline.py \ + --puzzles "bridges:5x5de,bridges:7x7dm,bridges:10x10dh" \ + --n_samples 200 \ + --suffix "test200" \ + --test_only +``` + +**Generate training data with deduplication:** +```bash +python run_ascii_puzzle_generation_pipeline.py \ + --puzzles "bridges:5x5de" \ + --n_samples 5000 \ + --suffix "grpo_5k" \ + --dedupe_test200 \ + --n_workers 16 +``` + +**Reuse existing puzzles (skip generation):** +```bash +python run_ascii_puzzle_generation_pipeline.py \ + --puzzles "bridges:5x5de" \ + --skip_generation \ + --run_folder ./pipeline_output/bridges_5x5de_grpo_train_20251217_143052 +``` + +### Pre-built Generation Scripts + +The `scripts/` directory contains ready-to-use bash scripts for common dataset generation tasks: + +| Script | Description | +|--------|-------------| +| `generate_all_rsft_1k.sh` | Generate all rsft_1k datasets (15k total) | +| `generate_bridges_rsft_1k.sh` | Bridges rsft_1k (3k samples) | +| `generate_bridges_grpo_5k.sh` | Bridges grpo_5k (30k samples) | +| `generate_*_test200.sh` | Test datasets (200 samples each) | + +**Usage:** +```bash +# Generate only (no upload) +./scripts/generate_bridges_rsft_1k.sh + +# Generate and upload to HuggingFace +./scripts/generate_bridges_rsft_1k.sh --upload +``` + +### Generated Puzzle File Format + +Each generated `.txt` file contains: + +``` +Solved: True + +Problem: +[ASCII representation of the initial puzzle state] + +After move M1,0,3: +[ASCII state after move 1] + +After move M2,1,4: +[ASCII state after move 2] + +... + +Final Solution: +[ASCII representation of the solved puzzle] +``` + +## License + +The `RLP` code is released under the CC BY-NC 4.0 license. For more information, see [LICENSE](LICENSE). + +Simon Tatham's Portable Puzzle Collection is licensed under the MIT License, see [puzzles/LICENCE](puzzles/LICENCE). diff --git a/submodules/rlp/RECOMPILE_NOTE.md b/submodules/rlp/RECOMPILE_NOTE.md new file mode 100644 index 0000000000000000000000000000000000000000..9ee64d5d6f77b3a88fd5ec007079df681e0e5c9f --- /dev/null +++ b/submodules/rlp/RECOMPILE_NOTE.md @@ -0,0 +1,50 @@ +# Recompilation Required + +The bridges.c file has been modified to add the `game_text_parse` and `bridges_text_parse` functions. + +## To recompile using install_new.sh: + +The recommended approach is to use the `install_new.sh` script which handles all dependencies and builds: + +```bash +cd /home/ubuntu/projects/rlp +./install_new.sh +``` + +This will: +1. Install system dependencies (if needed and if you have sudo access) +2. Set up Python virtual environment +3. Configure and build all libraries including libbridges +4. Install Python packages + +## To recompile just libbridges (if CMake is already set up): + +If you already have cmake and the build environment configured: + +```bash +cd /home/ubuntu/projects/rlp +mkdir -p rlp/lib +cd rlp/lib + +# Configure if not already done +if [ ! -f CMakeCache.txt ]; then + cmake ../../puzzles +fi + +# Build just libbridges +cmake --build . --target libbridges +``` + +Or use the helper script: +```bash +./build_bridges.sh +``` + +## Verify the library was updated: + +```bash +ls -lh rlp/lib/libbridges.so +``` + +The library should be located at `rlp/lib/libbridges.so` and will be loaded by the Python code when creating a bridges puzzle. + diff --git a/submodules/rlp/VERIFIER_README.md b/submodules/rlp/VERIFIER_README.md new file mode 100644 index 0000000000000000000000000000000000000000..a41d9619168cbe9a81a2ac0e8779f3382ecb5d07 --- /dev/null +++ b/submodules/rlp/VERIFIER_README.md @@ -0,0 +1,293 @@ +# Puzzle Verifier - How to Use + +## Overview + +The `verifier.py` script verifies whether an ASCII representation of a puzzle state is correctly solved. It supports five puzzle types: **bridges**, **undead**, **galaxies**, **pattern**, and **loopy**. + +## Supported Puzzle Types + +| Puzzle Type | Default Argument | Solved Field | Notes | +|------------|------------------|--------------|-------| +| **bridges** | `5x5deL` | `completed` | Checks structural validity before verification | +| **undead** | `4x4` | `solved` | Checks structural validity before verification | +| **galaxies** | `4x4` | `completed` | Direct verification | +| **pattern** | `5x5` | `completed` | Direct verification | +| **loopy** | `5x5t0` | `solved` | Handles dimension validation errors gracefully | + +## How It Works + +The verifier uses a **parse → load → check** pipeline: + +1. **Parse**: Converts ASCII text to a structured state dictionary using puzzle-specific parsers +2. **Load**: Loads the state dictionary into the puzzle's C backend +3. **Check**: Queries the puzzle's solved/completed flag to determine if the state is valid + +### Verification Process + +For each puzzle type: + +1. **Bridges & Undead**: + - First performs structural validity checks (ensures no broken lines, modified clues, etc.) + - If structurally invalid, returns "NOT SOLVED" immediately + - Otherwise, parses and verifies the state + +2. **Galaxies, Pattern, Loopy**: + - Directly parses the ASCII state + - For loopy, handles dimension validation errors (treats malformed responses as "NOT SOLVED") + +3. **Error Handling**: + - Dimension validation errors (invalid canvas width/height) are treated as "NOT SOLVED" (model mistakes) + - Other parsing errors are re-raised as exceptions + +## Usage + +### Basic Usage + +#### From Command Line Argument + +```bash +# Bridges +python verifier.py bridges "3|.|2\n..." + +# Undead +python verifier.py undead "G: 3 V: 1 Z: 6\n\n 2 3 1 1 \n..." + +# Galaxies +python verifier.py galaxies "+-+-+\n|o o|\n+-+-+\n|o o|\n+-+-+\n" + +# Pattern +python verifier.py pattern " 1 2 3\n 4 5 6\n 7 8 9\n" + +# Loopy +python verifier.py loopy " x x x - x \nx x0x |3| x\n..." +``` + +#### From Standard Input + +```bash +# Read from file +python verifier.py bridges < ascii_state.txt + +# Pipe from another command +echo "3|.|2\n..." | python verifier.py bridges + +# Multi-line input +cat < bridges_solved.txt <