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

100%

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

✓ Published0🌍 Public

Last edited Jan 2, 2013

Created on Jan 2, 2013

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.

AI-generated description

code to solve the 36cube puzzle.

Credits

Created by Henk de Leeuw; some tugging & tweaking by Ger Hobbelt (not that it got any better from that... :-) )

How to edit remotely / how to git clone to local machine

git clone git@gist.github.com:4433918.git

Similar vizzes

Loading thumbnail…

Gist 2bba23d8eda3ce767e87a6a491773372

The visualization is a scatterplot-style mosaic representing a 1000x1000 grid, plotting the positions and sizes of 234 rectangular claims from an Advent of Code puzzle. Overlapping rectangles accumulate, creating a dense heatmap-like field of colored blocks on a dark background. Built with Processing, the sketch loads the claim data from `aoc3_1.txt` and renders each rectangle using `rect()`, varying color intensity based on overlap count. The code uses `loadStrings()` to parse the input file and calls `noLoop()` to draw the static result once.

BBBischof

60% match

Loading thumbnail…

advent-of-code-05

Each row of the visualization is a horizontal line representing an element in the puzzle's input array. As the algorithm jumps through the array, darker values indicate lower numbers, and the x-axis tracks progress over time. Purple vertical columns show the rate of visits each position receives per roughly 30,000 jumps. The code uses `d3.scaleLinear` for color encoding and draws rectangles to both a Canvas and an SVG layer via `d3.conventions`.

11wheel

59% match

Loading thumbnail…

Gist 0e347a46041a01aa3c4f

This example visualizes the Collatz conjecture by mapping each integer from 0 to 5199 to a small square, where the fill color encodes the number of cycles to reach 1 and the stroke color encodes the maximum value reached during the sequence. The squares are arranged in a grid, and hovering over a square updates a text label to show the exact cycle count and maximum for that number. The visualization uses D3.js (version 3.5.5) to compute the Collatz sequences, bind the data to SVG rectangles, and apply linear color scales with HSL interpolation for the two attributes. The layout positions squares sequentially in rows of fixed width, and the code notes that changing the width parameter alters the grid pattern.

CCBasis

58% match

Loading thumbnail…

Gist b0f64c51570ca06b6602

This example demonstrates a recursive Boggle word-finding algorithm that visualizes its search process by printing the game board to the console at each step. The code uses Ruby’s `Array#each_with_index` to scan the 4x4 letter grid, and recursively calls the `checker` method to trace valid adjacent letter paths for a given word. A `draw` function outputs the board state, marking previously visited cells with the string `"NO"` to show the algorithm’s backtracking. The visualization relies on terminal text output rather than graphical rendering, using only the `p` method for display.

AAndrelton

57% match

Loading thumbnail…

Advent of Code

This visualization demonstrates the redistribution of memory blocks in the "Advent of Code" Day 6 challenge, tracking how many redistribution cycles occur before a state repeats. The code uses XQuery 3.1 with recursive functions `local:zero-out-highest` and `local:add-blocks` to reallocate blocks from the highest-value bank across the array, while `local:calculate-state` records each state as a hyphen-separated string and stops when a duplicate state appears. The data source is a hardcoded sequence of 16 integers representing the initial memory banks, and the output is the integer count of iterations performed until repetition, rendered as plain text. No external visualization libraries are used; the example focuses purely on algorithmic state computation.

CCliffordAnderson

57% 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

57% match

Loading thumbnail…

Gist d740d28ab2549ada2394dbbe9728cd71

This visualization prints an alternating checkerboard pattern of spaces and hash symbols to the console, using standard JavaScript string concatenation and a nested `for` loop structure. The outer loop controls each row, while the inner loop builds the pattern by checking whether the row and column indices are even or odd. The code defines a fixed grid size of 8, generates each line into a string variable, and logs it with `console.log` before resetting the string for the next iteration. No external libraries are used; it relies solely on core JavaScript syntax and the console API.

MMistyBlunch

56% match

Loading thumbnail…

Fork of Fork of Fork of Fork of Fork of Fork of Fork of Fork of Fork of wordsearch fun

This interactive word search puzzle presents a 15×15 grid of letters with 15 hidden words to find. Players click and drag across adjacent letters to highlight words horizontally, vertically, or diagonally; correctly selected words are marked as found with a color change in both the grid and the word list. The code uses plain DOM manipulation with `getElementById`, `createElement`, and `querySelector` to build and update the grid. Word placement uses randomized logic with collision checking, while mouse events (`mousedown`, `mouseenter`, `mouseup`) drive the selection mechanism. A New Game button regenerates the puzzle with a fresh random layout.

KKareena

56% match