tateti-tateti VS falling-turnip

Compare tateti-tateti vs falling-turnip and see what are their differences.


Meta tic-tac-toe ncurses game. (by clrnd)


falling sand game with regular parallel arrays. (by tranma)
Our great sponsors
  • InfluxDB - Access the most powerful time series database as a service
  • SonarLint - Clean code begins in your IDE with SonarLint
  • SaaSHub - Software Alternatives and Reviews
tateti-tateti falling-turnip
0 2
4 63
- -
0.0 0.0
over 7 years ago almost 10 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.


Posts with mentions or reviews of tateti-tateti. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning tateti-tateti yet.
Tracking mentions began in Dec 2020.


Posts with mentions or reviews of falling-turnip. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-05-08.
  • Show HN: Making a Falling Sand Simulator
    3 projects | news.ycombinator.com | 8 May 2022
    If you want more performance, falling sand simulators can further be made parallel by implementing them using Margolus Neighbourhoods, as in Falling Turnip: https://github.com/tranma/falling-turnip

    The idea is that a single iteration divides the world into 2x2 squares and then applies effects sequentially within each square, but not between the squares. This means each square can be processed independently. In the next iteration, the division into squares shifts right and down by one cell each direction. This does mean you need more steps than in a sequential implementation, but I found it to be quite a principled approach to parallelizing cellular automata when I first read about it. One interesting side effect of this design is that falling particles end up being separated by blank space, as shown here: https://futhark-lang.org/static/falling-sand-2016.12.04.webm I wonder if that is fixable.

What are some alternatives?

When comparing tateti-tateti and falling-turnip you can also consider the following projects:

h2048 - An Implementation of Game 2048

Allure - Allure of the Stars is a near-future Sci-Fi roguelike and tactical squad combat game written in Haskell; please offer feedback, e.g., after trying out the web frontend version at

rattletrap - :car: Parse and generate Rocket League replays.

battleships - Angewandte Funktionale Programmierung

Nomyx - The Nomyx game

freekick2 - A simple soccer game

werewolf - A game engine for running werewolf in a chat client

gloss-game - A convenience wrapper around the Gloss library to make writing games in Haskell even easier

dominion - A Dominion simulator in Haskell

halma - Chinese Checkers Haskell library, GUI application and Telegram bot

aeson-tiled - Aeson instances for Tiled map editor types