Displaying 1 to 7 from 7 results

godot-procedural-generation - Procedural generation algorithms and demos for the Godot game engine

  •    GDScript

Godot PCG (Procedural Content Generation) is a project to build a series of algorithms and demos to learn about procedural generation. The algorithms are from our course Godot PCG Secrets. ➡ Follow us on Twitter and YouTube for free game creation tutorials, tips, and news! Get one of our Godot game creation courses to support our work on Free Software.

LambdaHack - Haskell game engine library for roguelike dungeon crawlers; try out the browser version at

  •    Haskell

As an example of the engine's capabilities, here is a showcase of shooting down explosive projectiles. A couple were shot down close enough to enemies to harm them. Others exploded closer to our party members and took out of the air the projectiles that would otherwise harm them. This was a semi-automatic stealthy speedrun of the escape scenario of the sample game that comes with the engine. Small fixed font. The enemy gang has a huge numerical and equipment superiority. Our team loots the area on auto-pilot until the first foe is spotted. Then they scout out enemy positions. Then hero 1 draws enemies and unfortunately enemy fire as well, which is when he valiantly shoots down explosives to avoid the worst damage. Then heroine 2 sneaks behind enemy lines to reach the remaining treasure. That accomplished, the captain signals retreat and leaves for the next area (the zoo).

testingRNG - Testing common random-number generators (RNG)

  •    C++

There are several benchmarks that can be used to test (pseudo-)random number generators (RNG). Of particular interest are TestU01 and PractRand. We want to easily test popular RNGs.It is fine to say that we can, in theory run these tests, but few of us will if it requires too much labor. The purpose of this project is to make it ridiculously easy to run your own tests if you have a mac or a Linux box with a recent C compiler.

pcg-random - PCG RNG for JavaScript

  •    Javascript

For information on the algorithm, see here. This implementation is based on the Minimal C Edition. Most of the complexity in the code here comes from JavaScript's lack of 64 bit arithmetic support, which is required by the algorithm.

granderl - Fast-and-loose PRNG NIF

  •    C

Experiments in fast "random" number generation for Erlang; though they have the same interface as rand:uniform/1, think of them more like phash2/2 with a timestamp -- not really random, but fast (hopefully). Specifically, some of the PRNGs here use methods that are known to be biased. They are not suitably for any application which assumes uniformity. They are also not guaranteed to produce uncorrelated streams when used in parallel.

Allure - Allure of the Stars is a near-future Sci-Fi roguelike and tactical squad game written in Haskell

  •    Haskell

Not a single picture in this game. You have to imagine everything yourself, like with a book (a grown-up book, without pictures). Once you learn to imagine things, though, you can keep exploring and mastering the world and making up stories for a long time. The game is written in Haskell1 using the LambdaHack10 roguelike game engine. Please see the changelog file for recent improvements and the issue tracker for short-term plans. Long term goals are high replayability and auto-balancing through procedural content generation and persistent content modification based on player behaviour. Contributions are welcome.

IntXLib4CPP - IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation

  •    C++

IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation. It provides all the basic arithmetic operations on Integers, comparing, bitwise shifting etc. It also allows parsing numbers in different bases and converting them to string, also in any base. The advantage of this library is its fast multiplication, division and from base/to base conversion algorithms. all the fast versions of the algorithms are based on fast multiplication of big Integers using Fast Hartley Transform which runs for O(N * log N * log log N) time instead of classic O(N^2). As you can see, IntX implements all the standard arithmetic operators using operator overloading so its usage is transparent for developers, like if you're working with usual Integers.

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.