Free singularity gameplay software for linux

SINGULAR is a computer algebra system for polynomial computations in commutative algebra, algebraic geometry, and singularity theory.
Its main computational objects are ideals and modules over a large variety of baserings. The baserings are polynomial rings over a field (eg. finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to an ideal.
It features fast and general implementations for computing Groebner and standard bases, including Buchbergers algorithm and Moras Tangent Cone algorithm. Its interactive shell and C-like programming language can be extended by libraries written in the SINGULAR programming language.
Main features:
- Main computational objects: ideals/modules over very general polynomial rings over various ground fields.
- Large variety of algorithms implemented in kernel (written in C/C++).
- Many more algorithms implemented as SINGULAR libraries.
- Intuitive, C-like programming language.
- Extensive documentation: Manual (info, ps, and html), Publications.
- Available for most hard- and software platforms: Unix (HP-UX, SunOS, Solaris, Linux, AIX), Windows, Macintosh.
Enhancements:
- This version is mainly a bugfix release, but it also contains some new features.
- Speed was improved for 64-bit architectures.
- The dmod.lib and perron.lib libraries were added.
- center.lib was improved. ncalg.lib was revised.
- New algorithms were added in primdec.lib.
- An improved version of slimgb was incorporated into groebner.
- The module generator (modgen) was improved.
- The build process was improved to build automatically without patches on 64-bit architectures.

Gallipoli: The Game is a stunning recreation of Australias greatest military adventure. As a commander in the Great War (WWI), you take on the role of leading the prime of Australias armed forces as they launch an all-out assault on the Central Powers (the Germans, Austrians and the Ottomans).
Gameplay is similar to the hit PC game, Lemmings, except, instead of trying to save your soldiers, your mission, as an authentic WWI commander, is to wipe out as many diggers as possible ... the more gruesomely, the better!
Main features:
- Landing at Hell Spit (ANZAC cove)
- Russells Top
- The Sphinx
- Walkers Ridge
- The landing at Sulva Bay
- The third wave at the Nek
Enhancements:
- game much faster
- more options
- Battle of Pozyers level removed (no-one was playing it)

PDL::LinearAlgebra Perl module contains linear algebra utils for PDL.

SYNOPSIS

use PDL::LinearAlgebra;

$a = random (100,100);
($U, $s, $V) = mdsvd($a);

This module provides a convenient interface to PDL::LinearAlgebra::Real and PDL::LinearAlgebra::Complex.

FUNCTIONS

setlaerror

Set action type when error is encountered, returns previous type. Available values are NO, WARN and BARF (predefined constants). If, for example, in computation of the inverse, singularity is detected, the routine can silently return values from computation (see manuals), warn about singularity or barf. BARF is the default value.

$a = sequence(5,5);
$err = setlaerror(NO);
($inv, $info)= minv($a);
if ($info){
# Change the diagonal (the inverse doesnt exist but its an example)
$a->diagonal(0,1)+=1e-8;
($inv, $info)= minv($a);
}
if ($info){
print "Cant compute the inversen";
}
else{
print "Inverse of $a is $inv";
}
setlaerror($err);

getlaerror

Get error type.

0 => NO,
1 => WARN,
2 => BARF
t
PDL = t(PDL, SCALAR(conj))
conj : Conjugate Transpose = 1 | Transpose = 0, default = 1;

Convenient function for transposing real or complex 2D array(s). For PDL::Complex, if conj is true returns conjugate transpose array(s) and doesnt support dataflow. Supports threading.

issym

PDL = issym(PDL, SCALAR|PDL(tol),SCALAR(hermitian))
tol : tolerance value, default: 1e-8 for double else 1e-5
hermitian : Hermitian = 1 | Symmetric = 0, default = 1;

Check symmetricity/Hermitianicity of matrix. Supports threading.

diag

Return i-th diagonal if matrix in entry or matrix with i-th diagonal with entry. I-th diagonal returned flows data back&forth. Can be used as lvalue subs if your perl supports it. Supports threading.

PDL = diag(PDL, SCALAR(i), SCALAR(vector)))
i : i-th diagonal, default = 0
vector : create diagonal matrices by threading over row vectors, default = 0
my $a = random(5,5);
my $diag = diag($a,2);
# If your perl support lvaluable subroutines.
$a->diag(-2) .= pdl(1,2,3);
# Construct a (5,5,5) PDL (5 matrices) with
# diagonals from row vectors of $a
$a->diag(0,1)

tritosym

Return symmetric or Hermitian matrix from lower or upper triangular matrix. Supports inplace and threading. Uses tricpy or ctricpy from Lapack.

PDL = tritosym(PDL, SCALAR(uplo), SCALAR(conj))
uplo : UPPER = 0 | LOWER = 1, default = 0
conj : Hermitian = 1 | Symmetric = 0, default = 1;
# Assume $a is symmetric triangular
my $a = random(10,10);
my $b = tritosym($a);

positivise

Return entry pdl with changed sign by row so that average of positive sign > 0. In other words thread among dimension 1 and row = -row if Sum(sign(row)) < 0. Works inplace.

my $a = random(10,10);
$a -= 0.5;
$a->xchg(0,1)->inplace->positivise;

mcrossprod

Compute the cross-product of two matrix: A x B. If only one matrix is given, take B to be the same as A. Supports threading. Uses crossprod or ccrossprod.

PDL = mcrossprod(PDL(A), (PDL(B))
my $a = random(10,10);
my $crossproduct = mcrossprod($a);

mrank

Compute the rank of a matrix, using a singular value decomposition. from Lapack.

SCALAR = mrank(PDL, SCALAR(TOL))
TOL: tolerance value, default : mnorm(dims(PDL),inf) * mnorm(PDL) * EPS
my $a = random(10,10);
my $b = mrank($a, 1e-5);

mnorm

Compute norm of real or complex matrix Supports threading.
PDL(norm) = mnorm(PDL, SCALAR(ord));

ord :
0|inf : Infinity norm
1|one : One norm
2|two : norm 2 (default)
3|fro : frobenius norm
my $a = random(10,10);
my $norm = mnrom($a);

mdet

Compute determinant of a general square matrix using LU factorization. Supports threading. Uses getrf or cgetrf from Lapack.

PDL(determinant) = mdet(PDL);
my $a = random(10,10);
my $det = mdet($a);

mposdet

Compute determinant of a symmetric or Hermitian positive definite square matrix using Cholesky factorization. Supports threading. Uses potrf or cpotrf from Lapack.

(PDL, PDL) = mposdet(PDL, SCALAR)
SCALAR : UPPER = 0 | LOWER = 1, default = 0
my $a = random(10,10);
my $det = mposdet($a);

mcond

Compute the condition number (two-norm) of a general matrix.
The condition number (two-norm) is defined:

norm (a) * norm (inv (a)).

Uses a singular value decomposition. Supports threading.

PDL = mcond(PDL)
my $a = random(10,10);
my $cond = mcond($a);

mrcond

Estimate the reciprocal condition number of a general square matrix using LU factorization in either the 1-norm or the infinity-norm.
The reciprocal condition number is defined:

1/(norm (a) * norm (inv (a)))

Supports threading.

PDL = mrcond(PDL, SCALAR(ord))
ord :
0 : Infinity norm (default)
1 : One norm
my $a = random(10,10);
my $rcond = mrcond($a,1);

morth

Return an orthonormal basis of the range space of matrix A.

PDL = morth(PDL(A), SCALAR(tol))
tol : tolerance for determining rank, default: 1e-8 for double else 1e-5
my $a = random(10,10);
my $ortho = morth($a, 1e-8);

mnull

Return an orthonormal basis of the null space of matrix A.

PDL = mnull(PDL(A), SCALAR(tol))
tol : tolerance for determining rank, default: 1e-8 for double else 1e-5
my $a = random(10,10);
my $null = mnull($a, 1e-8);

minv

Compute inverse of a general square matrix using LU factorization. Supports inplace and threading. Uses getrf and getri or cgetrf and cgetri from Lapack and return inverse, info in array context.

PDL(inv) = minv(PDL)
my $a = random(10,10);
my $inv = minv($a);

mtriinv

Compute inverse of a triangular matrix. Supports inplace and threading. Uses trtri or ctrtri from Lapack. Returns inverse, info in array context.

(PDL, PDL(info))) = mtriinv(PDL, SCALAR(uplo), SCALAR|PDL(diag))
uplo : UPPER = 0 | LOWER = 1, default = 0
diag : UNITARY DIAGONAL = 1, default = 0
# Assume $a is upper triangular
my $a = random(10,10);
my $inv = mtriinv($a);

Squares project is the most feature-filled square-based puzzle game for Windows, Linux and other platforms!
Squares is the product of several months of learning C,SDL and other technologies associated with games programming.
Main features:
- Cross platform graphical interface with SDL
- Scalable interface with a myriad of supported resolutions
- Attractive graphical randomization system so you can see your game being made!
- Pause and reset buttons, keyboard shortcuts throughout the interface
- Variable board size from 3x3 to 10x10
- Competitive gameplay with display of number of moves and time
- Full statistics including best time and average
- Pleasant number-based game display or puzzle gameplay with images
- Support for sets of images with five included by default (see below)
- Ability to save and load games with quicksave
- "Shift pieces" feature ups the pace of large games
- Full configuration system with many options

Ghornons Hammer project is a 3D strategy adventure game.

Ghornons Hammer is a 3D strategy adventure game based on missions and adventure rather than on mass armies or leveling stats.

There is no gameplay in this version of Ghornons Hammer yet. The map you are on consits of a miniature village (windmills, trees, campfire) and some surrounding terrain. You are free to walk around the map to get an impression of what Ghornons Hammer might look like in future. In the next releases, we will be adding a user interface and character animation, so stay tuned!

smultroNET is a multiplayer worm-tron-kinda game.
Bored of nice looking games with no gameplay? Then smultronet is the game for you!
Even if smultronet isnt stuffed with fancy graphics, you will experience a very addicive gameplay. People have often said, "This game looks like any other worm game, why play this?". But after a few tries, they usually cant stop playing. Our biggest issue is therefore recruiting new players. Most people dont have time to try out all games that exist today, and therefore only try the best looking ones.
Main features:
- smultronet is easy to start and requires no installation.
- smultronet is a multiplayer game with a common lobby to meet other players.
- smultronet allows up to nine players simoultaneously playing.
- smultronet fits all ages.
- smultronet is free, of course.
- smultronet has versatile stats pages that show your progress.
- Personal statistics
- Game statistics
- Server statistics
- Mixed statistics
- More coming all the time. Just to satisfy your needs

Biniax is an unique arcade logic game. Simple and addictive, you can learn in a minute and play for hours.
The gaming field is a 5x7 grid filled partially with pairs of elements. Every pair consists of two different elements combined of four possible.
You control the box with an element inside and can move around the field on empty spaces. You can also remove pairs of elements if you have the same element as the one of the pair.
When you remove the pair, your element becomes the other one element of the pair and the score is increased. The gaming field scrolls down slowly and your goal is to stay on the field for as long as possible.
Enhancements:
- After months of playing, this release introduces the new time balance.
- This is an important change in the gameplay.