Skip to main content
100%

wfc in clingo?

✓ Published0🌍 Public
Aaman-tiwari
Last edited Nov 16, 2017
Created on Nov 16, 2017

This example shows a constraint-solving approach to generating a grid of tiles, where each cell is assigned one of two patterns (a or b) so that adjacent cells follow a set of legal pairings. It encodes the Wave Function Collapse algorithm as an answer-set program in Clingo, using a 5×5 grid defined by `cell(1..n, 1..n)` and rules that generate exactly one assignment per cell. The constraints check every adjacent pair via `dx` offsets and forbid any neighbor combination not listed in the `legal` facts. The output is the `assign/3` relation, which reveals the resulting tile layout.

AI-generated description

Similar vizzes

Loading thumbnail…

wfc with edge labels in clingo

This visualization generates a 3×3 tile grid using Answer Set Programming in Clingo, where each cell is assigned a tile pattern (straight, corner, or empty) with edge labels indicating path or empty connections. The grid must satisfy adjacency constraints so that neighboring tile edges are connectable, and every pattern appears at least once. The logic program defines tile rotations, legal neighbor relationships via the `legal/4` predicate, and enforces consistency through integrity constraints. The example demonstrates constraint-based procedural generation of a complete, valid wfc-style layout without external rendering libraries.

Aaman-tiwari
84% match
Loading thumbnail…

asp map generation with connectivity constraints

An Answer Set Programming (ASP) constraint solver generates a 5x5 tile map where each cell is assigned a path tile (straight, corner, plus, or empty), subject to edge-matching and global connectivity rules. The visualization renders the resulting tile grid and highlights edges between walkable adjacent tiles, using the ASP solver to enforce that all tiles appear and that the top-left and bottom-right corners are connected through a continuous path.

Aaman-tiwari
55% match
Loading thumbnail…

Cellular automata

A one-dimensional cellular automaton stands at the center of this visualization, which arranges all 256 possible nearest-neighbor rules in a grid. The display uses a tile-based procedural map via Polymaps, with a worker script (`cell-worker.js`) computing each rule’s evolution from a random initial state. Color intensity indicates cell state, and zooming reveals the structure of individual rules. The rendering leverages Polymaps’ `po.map`, `po.procedural`, and `po.hash` APIs, while the worker handles the pixel-level computation and postMessage communication, following the example from MathWorld.

Mmbostock
50% match
Loading thumbnail…

p5 wolfram CA

A p5.js sketch renders a one-dimensional cellular automaton, displaying each generation as a horizontal row of small squares that stack downward over time. The simulation starts with a single active cell in the center of the top row and applies a fixed Wolfram rule set to compute each subsequent generation from the three neighboring cells above. The code uses the p5.js `createCanvas`, `rect`, and `fill` functions to draw the grid, and the result produces a deterministic, rule-based visual pattern that evolves over the canvas height.

PPhilippe Rivière
48% match
Loading thumbnail…

Numoku solver: Solves i.e https://twitter.com/1to9puzzle/status/1255848687298740224

Numoku solver demonstrates how a constraint programming approach solves a 6x6 Numoku puzzle where row and column sums must total 30 with specific multiplicative split points. The visualization shows the solved grid with numbers 1-9 placed such that each 3x3 block, row, and column contains unique digits. Built with Julia using JuMP and the ConstraintSolver package, it employs `CS.AllDifferentSet` constraints for uniqueness and `CS.TableSet` constraints to enforce valid split patterns generated by `get_possible_splits`. The puzzle input includes fixed cells and split directions, solved via combinatorial permutation filtering.

WWikunia
48% match
Loading thumbnail…

Squares ↔ Hexagons

This example demonstrates a smooth morphing animation between two regular plane tilings: initially square cells transition into taller, non-regular hexagons. A grid of points is shifted horizontally by a changing offset each frame, and a Voronoi diagram is computed from these points using `d3.geom.voronoi`, rendering the resulting polygons as SVG paths. The offset moves point columns alternately, causing the cell shapes to transform continuously. The code uses `d3.timer` for the animation loop, with 2-pixel circles marking each generator point.

Mmbostock
48% match
Loading thumbnail…

Fork of Fork of Fork of Fork of Fork of Fork of Fork of Fork of Fork of HTML Starter

A children's crossword puzzle displays an 11-by-11 grid of letter cells with across and down clues listed alongside. The game uses plain JavaScript and the Document Object Model (DOM) to render the interactive grid, manage user input, and highlight words. Clicking a clue highlights the corresponding word in the grid, while the "Check Answers" and "Show Solution" buttons compare user entries against the embedded word list. The interface relies on CSS grid for layout and event listeners for navigation and validation.

KKareena
47% match
Loading thumbnail…

Staafjespuzzel code from Henk, tweaked. (36cube puzzle)

This visualization shows the solution search for the 36cube puzzle, a 6x6 grid where each row and column must contain each color exactly once. The code displays the board state in text form, with each cell colored and a numeric permutation showing the column order for each row. It tracks remaining colors per height level and uses a backtracking algorithm with placement statistics to explore solutions. The implementation uses C++ with the standard library, specifically the `set` container, and outputs progress markers and intermediate board states to standard output.

GGerHobbelt
47% match