We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

‍

From Esolang
Jump to navigation Jump to search

‍ is an esoteric programming language made by User:Dragoneater67 in 2026.

Overview

The program is a list of lists of pairs of fractions. Lists and pairs are comma-separated and are enclosed in parentheses. Fractions are written in this notation: x/y, where x is the upper part and y is the lower part, both x and y are integers. Each list within the list represents a set of polygons where each pair represents a vertex, the left part of the pair is its distance from the center, which can range from -1.0 to 1.0 and the right part of the pair is its angle relative to the center specified in degrees, which can range from 0 to 360, each polygon where vertices are located in the defined positions and there are no intersecting edges nor vertices that are connected to more or less than 2 edges is appended to the set. The program then attempts a find a finite tiling of the defined polygons from all sets such that each tile continuously intersects a straight line with each polygon appearing at least once.