ASCII Jigsaw Puzzle
This is a 3x3 ASCII jigsaw puzzle: _____ _____ _____| _| |_ || (_ _ _) ||_ _|_( )_|_ _|| (_) |_ _| (_) || _ _) (_ _ ||_( )_|_ _|_( )_|| _| (_) |_ || (_ _) ||_____|_____|_____|This is also a 3x3 ASCII...
View ArticleLet's Tessellate!
IntroductionFrom Wikipedia:A tessellation of a flat surface is the tiling of a plane using one or more geometric shapes, called tiles, with no overlaps and no gaps.A fairly well known tessellation is...
View ArticlePiet (Mondrian)'s Puzzle
For more information, watch this video, and go to A276523 for a related sequence.The Mondrian Puzzle (for an integer n) is the following:Fit non-congruent rectangles into a n*n square grid. What is the...
View ArticleMondrian Puzzle Sequence
Partition an n X n square into multiple non-congruent integer-sided rectangles. a(n) is the least possible difference between the largest and smallest area. ___________| |S|_______|| | | L ||...
View ArticleArranging arbitrary shapes to fill a rectangular space
A while ago, I posted a challenge asking to determine whether or not it's possible to arrange arbitrary rectangles to fill a rectangular space, here. That got answers, so clearly it was too easy. (Just...
View ArticleFinite tilings in one dimension
The purpose of this challenge is to determine if a collection of one-dimensonal pieces can be tiled to form a finite continuous chunk.A piece is a non-empty, finite sequence of zeros and ones that...
View ArticleIs my kids' alphabet mat properly grouped by colors?
My kids have an alphabet mat to play with, something like this:After months with the tiles of the mat randomly placed, I got tired and placed all the tiles of the mat grouped by sections according to...
View ArticleArranging arbitrary rectangles to fill a space
Can these rectangles fill a rectangular space?Given a bunch of rectangles, you are asked whether or not they can be arranged to fill a rectangular space.SpecsGiven a bunch of arbitrary m x n...
View ArticleRandom ASCII Art of the Day #5: Diamond Tilings
Mash Up Time!This is instalment #5 of both my Random Golf of the Day and Optimizer's ASCII Art of the Day series. Your submission(s) in this challenge will count towards both leaderboards (which you...
View ArticleTest a polyomino against Conway criterion
BackgroundConway criterion is a method to test if a given polygon can tile (i.e. cover without overlapping) an infinite plane. It states that a polygon can tile the plane if the following conditions...
View ArticleNumber of tilings on a triangular board with triangular tiles
BackgroundConsider the shape \$T(n)\$ consisting of a triangular array of \$\frac{n(n+1)}{2}\$ unit regular hexagons:John Conway proved that \$n = 12k + 0,2,9,11\$ if and only if \$T(n)\$ can be tiled...
View ArticleCan this polyomino tile the toroidal grid?
Inspired by certain puzzles on Flow Free: Warps.BackgroundWe all know that L-triominos can't tile the 3x3 board, and P-pentominos can't tile the 5x5 board. But the situation changes if we allow the...
View ArticleIdentify the smallest possible tile in the matrix
ChallengeGiven a matrix of digits (0-9), find the smallest (in terms of area) rectangular matrix of digits where one or more copies of itself, possibly rotated, can tile the original matrix. Reflection...
View ArticleIntegers, Assemble!
Your task is to assemble the integers from 1 to N (given as input) into a rectangle of width W and height H (also given as input). Individual numbers may be rotated by any multiple of 90 degrees, but...
View ArticleASCII Exact Cover with Rectangles
ChallengeGiven a rectangular area arrange a group of rectangles such that they cover the rectangular area entirely.InputAn integer denoting the height.An integer denoting the width.The dimensions of...
View ArticleSimplest Tiling of the Floor
You should write a program or function which receives a string describing the floor as input and outputs or returns the area of the simplest meta-tiling which could create the given pattern of the...
View ArticleNumber of domino tilings
Write a program or function that given positive n and m calculates the number of valid distinct domino tilings you can fit in a n by m rectangle. This is sequence A099390 in the Online Encyclopedia of...
View ArticleGenerate valid Fibonacci tilings
BackgroundThe Fibonacci tiling is a tiling of the (1D) line using two segments: a short one, S, and a long one, L (their length ratio is the golden ratio, but that's not relevant to this challenge)....
View ArticleIs this a robbery?
BackstoryYou own a tiny jewellery shop in the suburbs of the city. The suburbs are too much overpopulated, so your shop has a thickness of only one character to fit in the busy streets.Recently, there...
View ArticleMaximal saturated domino covering of a rectangle
Inspired by this OEIS entry.BackgroundA saturated domino covering is a placement of dominoes over an area such thatthe dominoes are completely inside the area,the dominoes entirely cover the given...
View Article