Open Source C++ Algorithms

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.

This anti-cheating software is used by S4 League client to interface and check in real time XTRAP's features and to report the logs to their remote servers. Details: HGWC Version: 57 Protocol Version: 7

Animants are virtual ants. Their name comes from the combination of "ants" and "animats", an animat being "a sofware approximation of a living creature". Animants aim to simulate the behaviour of living animals.

A heuristic approach to solving the Knight's Tour Puzzle

Given a placement of pieces on a chessboard, find the move which forces checkmate as rapidly as possible.

CoPP is an object-oriented framework for developing algorithms for robot path planning. One of of the design goals is to make it easy to make comparisons between various path planning algorithms.

The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.

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.

The game of Cows-n-Bulls is back ! Gnu-Moo aims to provide a command line as well as GTK+ front-end for the user to play the cows-n-bulls game. Multi-game sessions and relevant session stats are provided, which can be useful to test heuristic algorithms.

This is an intelligent Sudoku solver in c++. It is intlligent, because it uses several logical deduction methods, just like a person, before resorting to guessing. I was trying to teach my kids Sudoku, and taught a computer as proof of concept.

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.

The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics related to A* algorithm are presented as well. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/a-star/ https://sourceforge.net/projects/shortest-path-graph-a-star/

Robot Warfare is a real-time strategy game that gives the user an opportunity to manage and program a team of battling robots that autonomously face opposing teams in a network-enabled environment.

This project an efficient method of solving a scrabble board.

A high-performance C++ Sudoku solver implementing Knuth's Dancing Links (DLX) algorithm — one of the fastest exact cover algorithms in the world.

Vincent Radio {Adrix.NT} VR Mosaic for C++ : C++ Builder VCL Applet - v.2.5 Smart Sliding Cells Game for Windows sources & build project included also demonstartes the use of a 2D matrix implemented as a dynamic vector (*) now it supports changing the Visual Style (*) now it includes a smart automatic resolver !! please, let me know what you think about this project adrixnt@hotmail.it skype: adrixnt

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.

aigochess is a chess-style board game and uses improved faile engine with strong AI.The feature of this game is adding two Cannon which comes from Chinese Chess into original chess. It's the official traning software for China aigo Chess Club.

The "Knight's Tour" is a puzzle the object is to move a knight, to every other square, landing on each square only once. This is usually considered to be a challenging puzzle. I will use a heuristic (hyu̇-ˈris-tik) approach to solve the 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