Open Source Algorithms

Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++) and optimized for highly distributed computing environments. This makes them hardly accessible for students, researchers and hackers. Many simple Python implementations can be found on Github, but none of them is able to beat a reasonable baseline on games such as Othello or Connect Four. As an illustration, the benchmark in the README of the most popular of them only features a random baseline, along with a greedy baseline that does not appear to be significantly stronger.

Formicidae is the official simulator and visualizer for the Ant-Wars competitive programming site, written in Java and SISC. The site is hosted at www.ant-wars.net.

jChecs is an open source Java chess program, designed to introduce the basics of computer chess programming concepts.

NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.

Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks!

A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. It took something like 2 years to develop it. It's technically a view-dependent, continuous dynamic level-of-detail rendering algorithm. Main features are simplicity and documentation. Does easily a 4k x 4k terrain, but also much more.

in here will be all codes of my games made in simple j and you can use it freely just put my name on the credits

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

Fuzzy Procedural Content Generation Library (FPCGlib) is a C++ template library for game development. FPCGlib provides a unique combination of fuzzy mathematics and procedural techniques to safely generate content with simulated natural variability.

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

Joshua chess robot: a stepper motor robot interfaced with a photosensible board to play chess with an embedded artificial intelligence, a game database or and internet player. Software, robot photos, tech papers, schematics and cabling included. Enjo

VRMosaic for Lazarus a sliding cells puzzle game written using Free Pascal for Lazarus [*] now include auto mosaic resolver (Aug 2023) !! includes Lazarus sources & build project another fine SunStorm release Vincent Radio {Adrix.NT} adrixnt@hotmail.it

A rudimentary 3D computer game that utilises artificial neural networks to enable computer agents to anticipate a target's location and shoot (bullets) in the corresponding direction.

Crazy Turtle puzzle game solver utility. Other names: CRAZY TURTLE / LE JEU FOU DE LA TORTUE / NAUGHTY TURTLES / ŠAŠAVE KORNJAČE / NAGAJIVE ŽELVICE / SASAVE KORNJACE

A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!

MobileMath is a software written by using J2ME technolology. It turns mobile into calculator supporting many operations such as : evaluate expression, plotting, differentiate & integrate expression... It can run on any mobiles supporting Java.

Yaobi is a fast collision detection library for general triangulated objects. It uses a hierarchical representation based on oriented bounding boxes. Yaobi compares well with other libraries when it comes to speed and memory consumption.

ktsolver - Knight's Tour problem solver. Finds quickly a lot of solutions of the Knight's Tours problem.

These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) See: http://budshaw.ca/Download.html#complete http://budshaw.ca/Download.html#magics http://budshaw.ca/addenda/downloadNotes.html#completenotes

x86mph is an optimized library with vector, matrix, and vertex helpers (including an own TnL) It also contains memory helpers, and other stuff such as image processing (color inverting, changing bpp) taking advantage of x86's 3DNow!, MMX, and SSE

Fully playable Java game demo illustrating basic game programming technics, such as sprite animation, pixmap fonts, time or frame related game loop, affine transformations, convolution filters, sound generation and playback...

a sandbox for trying my engine ideas

It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.

Pacote de funcionalidades em FPC/Lazarus para serem utilizadas no desenvolvimento de jogos de Xadrez.