- Clone of The Witness by Thekla Inc. as a portable interface. C++ and Python.
- This repo attempts to add as much of the puzzle mechanics as possible.
- This is currently a work in progress.
- But one thing will remain certain: this is an interface. If you wish to attach this to some display you will have to figure that part out on your own.
- THIS REPOSITORY CONTAINS SPOILERS FOR THE WITNESS.
-
No more
std::shared_ptr! -
More helper functions and organization.
-
First Edition Here - https://github.com/WW92030-STORAGE/WITNESS_CLONE/
- Polynomino region checker - supports fixed and arbitrary rotations AND ALSO subtractive regions!
- Hexagon dots + colored blobs + triangles + stars + cancellations
- Verification of a given path - Checks if a path is solved.
- Grid solver - Automatically solves puzzle grids. Be warned that the current algorithm takes a long time to solve boards (grid cells) larger than 4x4.
- Random puzzle generator - Choose among certain presets.
- The grid is composed of Edges (also known as Paths) and enclosed Cells in a rectangular formation. Intersections of edges are special edge points we call Nodes or Intersections. Collectively they refer to as Points or Entries.
- The solution line/curve is denoted as the Line. The Line will partition the grid into one or more Regions.
- A Region is a set of grid Cells connected along the cardinal directions such that no two adjacent Cells have the Line as a border.
- The Line must begin at a Starting Point (usually denoted by a circle) and end at an End Point (usually denoted by a rounded protrusion from the grid). Starts and ends can be located anywhere in the grid on an Edge point.
- 【PATH DOTS】- The Line must intersect every one. For Grids with multiple Lines, some dots can restrict which Line(s) must go through them.
- 【COLORED BLOBS】- The color of the blob within a region must be the majority color of blobs in that region. For most cases, this is equivalent to saying each region must only have one color of blob.
- 【COLORED STARS】- The Region containing the star must have exactly one other object of the star's color. Other colors are disregarded.
- 【POLYOMINOS】 - Arrange the constituent Polyominoes such that all of their tiles lie within the bounds of the grid. Additive tiles add +1 to the value of a grid tile, subtractive tiles add -1. Tiles can lie outside the region. The region's shape must satisfy the constraint that there exists an arrangement of the Polyominoes such that the total sum of all tiles outside the region is zero, and the total sum of all tiles inside the region is the same across all such tiles, and that this sum is either zero or one. (Technically BlockGroups with other values are supported but +1 and -1 are seen most often.)
- 【TRIANGLES】- The number of triangles denotes the number of sides of the Cell the symbol lies in that must be traversed by the Line.
- 【CANCELLATION】- A Region containing N cancellations must contain exactly N symbols that would render the solution invalid otherwise. Cancellations CAN nullify each other. Dots are considered symbols if they lie inside the same Region as a cancellation.
- The grid is internally represented as a (2n + 1) ⋅ (2m + 1) array, where the grid cells are n rows and m columns.
- All points with both coordinates odd cannot have paths and must be empty or contain symbols instead.
- Polyominoes are checked by testing all feasible tile arrangements and checking their sum against a large Polyomino representing the region itself.
- The C++ version uses only the standard libraries.
- YOU MUST CREDIT ME (WW92030-STORAGE/WW92030/NORMALEXISTING) WHENEVER YOU USE THIS CODE.
- Make the Python version.
- Make the game interface.
