Free energy solutions arena software for linux

E/AS Automation Solutions is open source software system for help automate your solutions even for personal and/or corporate ones.
E/AS written on CLIP language (CA-Clipper dialect, compiler can be obtained from ITK.ru) and uses CODB (CLIP Object Database) as data storage.
Main features:
- client-server technology (both data and interface forms)
- component infrastructure with interaction between components by messages
- interface forms on XML
- MDI
E/AS contains in typical distribution:
- client software written on clip-ui library
- server software with wrapper for run as daemon
- maintenance tools: CODB console and component manager
- base (form, auth) and example (contact) components
Enhancements:
- completely rewrite code for implement E/AS architecture
- component infrastructure
- own server program instead COBRA
- maintenance tools: CODB console and component manager
- base and example components
- autoupdate views

Infon Battle Arena is a networked multiplayer real-time programming game featuring little creatures fighting for food. You upload your Creature Code (written in Lua) to a game server using a telnet Interface.

The game server then runs your code. The graphical client can be used to watch running games or replay recorded games.

libarena library is a custom memory allocator interface and implementation. Three allocators are provided: flat "LIFO" arena allocator, object pool allocator and a malloc(3) wrapper. These can be used directly, or through their exported prototype interfaces.
libarena is meant to provide a baseline interface so allocators can be stacked, and to provide a well defined interface for libraries and applications. It is not meant to restrict or confine what custom allocators can actually accomplish. For instance, the included pool and arena allocators include a suite of string utilities which arent available in the generic exportable interface. However, they are built upon the generic interface (see util.h).
Almost no malloc(3) library "replacements" support a context pointer argument. Theyre useless for many or most of the tasks where the ability to specify an alternate malloc(3) could actually be useful, e.g. one shot dealloction of a task structure and all associated allocations. For network daemons especially this feature is useful; all allocations for a particular session can be freed simply by closing the lowest-level allocator object.
The arena allocator behaves similarly to GNU obstacks. If allocations are freed in reverse order than the underlying buffers will be freed accordingly; out-of-order deallocations will lead to fragmentation. The arena allocator also supports position marking. The state at any given instance can be stored and the allocator later reset to that state. All allocations which occured after, in time, the saved state will behave as-if they were explicitly deallocated.
The pool allocator keeps a pool of sets of fixed sized buffers. Each buffer size can be arbitrary. Allocations which cannot be met from the existing buckets will result in the creation of a new bucket. Memory returned to the pool will be reused. Currently the pool will never shrink, only grow.
Upon closing of the arena or pool allocator objects all memory used will be released back to their underlying allocator (either the one passed on instantiation, or by default `ARENA_STDLIB, the standard library wrapper.
Enhancements:
- The makefiles are no longer recursive, so this should build and install using either GNU Make or BSD pmake.

CodeInvaders Challenge project is a Java-based, real-time programming game based on the Eclipse platform.

CodeInvaders Challenge is a Java™-based, real-time programming game based on the Eclipse platform. It uses the Eclipse platform and a simple API that allows users unfamiliar with Java to easily compete while they learn the language.

CodeInvaders Challenge gives users the opportunity to pit their Java programming skills against other players in a battle of space conquest. Each player writes a Java class that represents and controls a spaceship. Each ship (class) is placed in a simulated battle along with ships from other players.

The game puts up to six spaceships together in a match and places each of them in a random location with the same amount of energy. The spaceship class allows each player to control his ships thrusters and weapons. The ship can move around to collect energy, attack opponents, and bring energy back to its home planet. Points are awarded for different actions, and the player with the most points wins.

When used in a tournament, CodeInvaders Challenge allows direct, real-time competition between teams. Each player can submit his intermediate solutions and test against the submitted ships from other players. This competition allows each player to learn from the strategies of other players and modify his ship appropriately. After the final submission from each player, the final winner can be found by running a tournament consisting of several rounds and eliminations.

RobocodeNG is an Artificial Intelligence Tanks Battle Arena.

RobocodeNG is the continuation of the excelent job done by Mathew Nelson, which is the creator of Robocode.

The NG in RobocodeNG stands for Next Generation, meaning that the intension is the extend the original Robocode game with new features.

The original robocode is a game where artificially controlled tanks battle to the death in an arena. RobocodeNG Spices up the game adding better graphics, mods, guns, armors, tank bodies, etc, to introduce the great unbalance that the Robocode community needed.

RobocodeNG is based on Robocode version 1.0.7. If Mathew will ever make new versions of Robocode, we will of course make sure that RobocodeNG is updated accordingly.