This is the variant of GPT-5.1 that you get on the web UI. It is unknown exactly how it correlates with the API.
Output constraints:
  • Input and output have the same size
  • Supposing background is black, input and output contain the same number of objects of each color
    • the lower right part of each object (non-diagonal) does not move
      • the rest of each object outside the lower right part moves by 1 square to the right
Input constraints:
  • inputs are 3x6
Output constraints:
  • outputs are 3x9
TODO: this one is quite challenging.
Hard input constraints:
  • inputs have two colors: green and black
Hard output constraints:
  • output has three colors: black, green and yellow
  • output has same size as input
  • green is copied from input to output
    • output differs from input by making some black pixels yellow. Which pixels are becoming yellow?
Hard input constraints:
  • inputs are 3x3
  • inputs contain only 2 colors monocolored: black and another
Hard output constraints:
  • output is 3x input width and height. Suggests that the output is a 3x3 grid based on the input.
    • stronger: if output is split as a 3x3 grid, then each 3x3 block is either black or a copy as input. Which is which?
      • stronger: each pixel of the input determines if block is black or copy (final solution)
  • output contains only two colors: black and another
Input output comparison:
  • input appears pasted on output multiple times: suggests it is being copy pasted
Hard output constraints:
  • output is 3x input width and height: suggests that the output is a 3x3 grid based on the input
    If that is the case, let's try to figure out what is placed on each output grid.
    Notice: each grid element is either blank or the input.
    OK so let's determine what in the input determines each output grid.
    Because input in 3x3 maybe there's a direct mapping.
re-arc by Ciro Santilli 37 2025-12-13
By the author of ARC-DSL.
README says:
This repository presents code to procedurally generate examples for the ARC training tasks. For each of the 400 tasks, an example generator is provided.
arxiv.org/html/2404.07353v1 says:
Each generator is a standalone Python function merely making use of the DSL and functions from the random module from the standard library. The median generator consists of 40 lines of code and uses 22 DSL primitive calls and 10 calls to the random module.
Cool!
Original:
https://web.archive.org/web/20250216160803im_/https://github.com/michaelhodel/re-arc/raw/main/00d62c1b_original.png
Generated:
https://web.archive.org/web/20250216160803im_/https://github.com/michaelhodel/re-arc/raw/main/00d62c1b_generated.png
This section is about unofficial ARC-AGI-like problem sets.
These are interesting from both a:
  • practical point of view, as they provide more training data for potential solvers. If you believe that they are representative that is of course.
  • theoretical point of view, as they might help to highlight missing or excessive presumptions of the official datasets
github.com/neoneye/arc-dataset-collection contains a fantastic collection of such datasets, with visualization at: neoneye.github.io/arc/

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact