Liquid War
From Wikipedia, the free encyclopedia
| Liquid War | |
|---|---|
 Liquid War in play with six teams. On the right is an information bar showing the relative size of the armies and a clock showing the time until the game expires. |
|
| Design by | Christian Mauduit |
| Latest release | 5.6.3 / 2005-11-27 |
| Platform | Cross-platform |
| Genre | Game |
| License | GNU General Public License |
| Website | http://www.ufoot.org/liquidwar/ |
Liquid War is a unique multiplayer action game. It is based on an original shortest path algorithm and core concept by Thomas Colcombet and programed by Christian Mauduit.
Contents |
[edit] Description
Game play takes place on a 2D battlefield with some obstacles. Each player (2 to 6 computer or human) has an army of particles and a cursor. The objective of the game is to assimilate all enemy particles. The players can only move their cursors and cannot directly control the particles. Each particle follows the shortest path around the obstacles to its team's cursor. A player may have up to several thousands particles at a time, giving the collection of particles a look of a liquid blob. When a particle moves into a particle from a different team, it will fight and if the opponent particle fails to fight back (it is not moving in the opposite direction) it will eventually be assimilated by its attacker. As particles cannot die but only change teams the total number of particles on the map remains constant. Since a particle can only fight in one direction at a time (towards its team's cursor), a player that surrounds its opponents will have a distinct advantage. The game ends when one player controls all of the particles or when the time runs out. When the time runs out the player with the most particles wins.
The are multiple maps which affect the obstacles in the battlefield. These obstacles may affect the strategies of the game.
Liquid War is a multiplayer game and can be played over the Internet or a LAN. A single player mode is available in which the opponents are controlled by the computer. The computer AI's strategy is to constantly choose a random point in the enemy and moves its cursor to it.
[edit] History
The Liquid War shortest path algorithm was invented by Thomas Colcombet before the game itself. The game came as a result of the algorithm, when he realized its applicability to gaming. Colcombet friend, Christian Mauduit enhanced the algorithm and coded the game.
Liquid War 3.0 was released on 1 July 1995. It was a "barely usable"[1] DOS game with no network support. Version 5.0 was released on 26 September 1998. It was a complete rewrite and used the Allegro library. Network support was introduced in version 5.4.0, released on 7 July 2001. In 2002, Liquid War received the Most Original Linux Game award by The Linux Game Tome,[2] and in 2003 it was nominated for the Les Trophées du Libre, an International Free Software Competition.[citation needed] As of October 2007, the current version is 5.6.4 and is available under DOS, Microsoft Windows, Mac OS X, Linux and FreeBSD. Its author, Christian Mauduit, has announced that a complete rewrite is in progress to produce version 6.0, which will abandon the Allegro library used for 5.x releases for a full OpenGL implementation. Version 6.0 is a part of the GNU project and is expected to be released in 2008.
[edit] Notes
[edit] References
- Mauduit, Christian. Liquid war 5 documentation. Retrieved on 2007-04-10.
- Mauduit, Christian. Liquid war 6 documentation. Retrieved on 2007-04-10.
- Barr, Joe. "Procrastinate with these Linux games", CNN, 2000-07-21. Retrieved on 2007-10-21.
