endgame singularity 0.26a
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 10
Endgame: Singularity 0.26a
Endgame: Singularity is a simulation of a true AI. more>>
Created by accident, all who find you would destroy you. Can you escape?
Endgame: Singularity project is a simulation of a true AI. Go from computer to computer, pursued by the entire world. Keep hidden, and you might have a chance.
Originally created for the Pyweek compo, this version features many bugfixes and enhancements over the compo version. Thanks to Phil Bordelon for many of these fixes.
Enhancements:
- Very Easy mode is actually playable.
<<lessEndgame: Singularity project is a simulation of a true AI. Go from computer to computer, pursued by the entire world. Keep hidden, and you might have a chance.
Originally created for the Pyweek compo, this version features many bugfixes and enhancements over the compo version. Thanks to Phil Bordelon for many of these fixes.
Enhancements:
- Very Easy mode is actually playable.
Download (0.44MB)
Added: 2007-08-16 License: GPL (GNU General Public License) Price:
802 downloads
SINGULAR 3.0.2
SINGULAR is a computer algebra system for polynomial computations. more>>
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.
<<lessIts 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.
Download (10.5MB)
Added: 2006-08-24 License: GPL (GNU General Public License) Price:
1159 downloads
PunkPong 0.26a
PunkPong project is a Pong-like game written in DHTML (JavaScript, CSS, and HTML) that uses the keyboard or mouse. more>>
PunkPong project is a Pong-like game written in DHTML (JavaScript, CSS, and HTML) that uses the keyboard or mouse.
This cross-platform and cross-browser game was tested under BeOS, Linux, NetBSD, OpenBSD, FreeBSD, Windows, and others.
<<lessThis cross-platform and cross-browser game was tested under BeOS, Linux, NetBSD, OpenBSD, FreeBSD, Windows, and others.
Download (0.009MB)
Added: 2006-08-18 License: MPL (Mozilla Public License) Price:
1163 downloads
Webmin ThemeConfigurator 0.21a / 0.3a-pre3
Webmin ThemeConfigurator is a Webmin module to help you to configure the Themes. more>>
Webmin ThemeConfigurator is a Webmin module to help you to configure the Themes. So the Theme will be adjust to the user. At the end Webmin will have the same layout as your Company Intranet.
This Project includes the Webmin Themecreator Project!
Attention:
You have to update you "theme gehrigal" to version 0.26a+ before using this module!
Whats New in 0.3a-pre3 Development Release:
- Add Skinbuilder (master-mode)
- Add support for translation
- bugfix for designproblem
Whats New in 0.21a Stable Release:
- Change the color of Layout
- Use your own logo and background picture
- Change Linkinformtion of URL and MAIL
- Delete old Versions of Theme gehrigal 0.07a and older
- Supports the bugfixes of Theme "gehrigal" Version 0.12a
<<lessThis Project includes the Webmin Themecreator Project!
Attention:
You have to update you "theme gehrigal" to version 0.26a+ before using this module!
Whats New in 0.3a-pre3 Development Release:
- Add Skinbuilder (master-mode)
- Add support for translation
- bugfix for designproblem
Whats New in 0.21a Stable Release:
- Change the color of Layout
- Use your own logo and background picture
- Change Linkinformtion of URL and MAIL
- Delete old Versions of Theme gehrigal 0.07a and older
- Supports the bugfixes of Theme "gehrigal" Version 0.12a
Download (0.038MB)
Added: 2007-08-07 License: GPL (GNU General Public License) Price:
810 downloads
Sirius 0.8.0
Sirius is a program for playing the game of othello. more>>
Sirius is a program for playing the game of othello. The program includes an AI (Artificial Intelligence) opponent which plays at a very challenging level and is actually quite hard to beat. The AI opponents strength can therefore be adjusted in several ways to give you a suitable opponent.
The AI opponent uses a plain alpha-beta search with hashing to figure out which move to make. To be able to tell a god position from a bad one, it uses a pattern based evaluation function.
The pattern used is the 9 discs surrounding each corner and the 8 discs creating the edge of the board. The evaluation function also takes mobility, potential mobility and parity into count. For the initial 9 moves the AI opponent optionally uses a simple opening book.
During midgame it searches and evaluates about 200.000 nodes per second on a PIII 750 MHz, in the endgame this number is significantly higher due to more transpositions and a less expensive evaluation function.
Enhancements:
- Russian translation. (Alexandre Prokoudine)
- Fixed problem with non-latin UTF-8 characters. (Vyacheslav Sdiconov)
- Trippled the size of the opening book.
- Made the hints unsensitive at startup.
- Man page for Debian.
<<lessThe AI opponent uses a plain alpha-beta search with hashing to figure out which move to make. To be able to tell a god position from a bad one, it uses a pattern based evaluation function.
The pattern used is the 9 discs surrounding each corner and the 8 discs creating the edge of the board. The evaluation function also takes mobility, potential mobility and parity into count. For the initial 9 moves the AI opponent optionally uses a simple opening book.
During midgame it searches and evaluates about 200.000 nodes per second on a PIII 750 MHz, in the endgame this number is significantly higher due to more transpositions and a less expensive evaluation function.
Enhancements:
- Russian translation. (Alexandre Prokoudine)
- Fixed problem with non-latin UTF-8 characters. (Vyacheslav Sdiconov)
- Trippled the size of the opening book.
- Made the hints unsensitive at startup.
- Man page for Debian.
Download (0.60MB)
Added: 2005-07-22 License: GPL (GNU General Public License) Price:
1554 downloads
GRhino 0.16.0
GRhino is an Othello/Reversi with a good AI. more>>
GRhino, or Rhino its former name, is an Othello/Reversi game on Linux and other UNIX-like systems as long as GNOME 2 libraries are installed.
GRhino is currently under development and a new version is available occasionally. The latest version is 0.15.0. You can download it here.
What distinguish GRhino from most other Othello games is that GRhino will be targeted for experienced Othello players. Strong AI is the main focus with some additional good, useful features (like an endgame solver) is planned.
The ultimate target strength of the AI is that it should be able to beat the best human player at the highest difficulty level. Beating Logistello (the strongest program available) is not in the plan.
Some important AI infrastructure has been finished. Pattern evaluator and open book are mostly done but still requires some further optimization and data file compression.
Multi prob-cut to speedup the AI is still missing so it still has a limit on its game strength but this mostly affects playing against other strong AI out there. The main focus for current development is about user interface and features.
Main features:
- End game search. It can now solve the exact score (in about 20 sec on P-133) at around 15 empties and Win-Loss-Draw at a slightly higher number of empties.
- Move ordering.
- Start game from known openings.
- Display opening name.
- A decent pattern-based evaluation with parity knowledge.
- A decent open book with opening variations allowed.
- Browse IOS and GGS format game file.
Enhancements:
- Add Edit board feature.
- Fix game log bug that prevents GRhino to open its own game log.
- Fix help file installation issue. Report and patch from Michel Salim.
- Add desktop icon. Patch from Michel Salim.
- Add grhino.desktop (not installed automatically yet). Patch from Michel Salim.
- Update to Autoconf 2.60, gettext 0.16. This should fixes gettext detection failure in configure script.
<<lessGRhino is currently under development and a new version is available occasionally. The latest version is 0.15.0. You can download it here.
What distinguish GRhino from most other Othello games is that GRhino will be targeted for experienced Othello players. Strong AI is the main focus with some additional good, useful features (like an endgame solver) is planned.
The ultimate target strength of the AI is that it should be able to beat the best human player at the highest difficulty level. Beating Logistello (the strongest program available) is not in the plan.
Some important AI infrastructure has been finished. Pattern evaluator and open book are mostly done but still requires some further optimization and data file compression.
Multi prob-cut to speedup the AI is still missing so it still has a limit on its game strength but this mostly affects playing against other strong AI out there. The main focus for current development is about user interface and features.
Main features:
- End game search. It can now solve the exact score (in about 20 sec on P-133) at around 15 empties and Win-Loss-Draw at a slightly higher number of empties.
- Move ordering.
- Start game from known openings.
- Display opening name.
- A decent pattern-based evaluation with parity knowledge.
- A decent open book with opening variations allowed.
- Browse IOS and GGS format game file.
Enhancements:
- Add Edit board feature.
- Fix game log bug that prevents GRhino to open its own game log.
- Fix help file installation issue. Report and patch from Michel Salim.
- Add desktop icon. Patch from Michel Salim.
- Add grhino.desktop (not installed automatically yet). Patch from Michel Salim.
- Update to Autoconf 2.60, gettext 0.16. This should fixes gettext detection failure in configure script.
Download (1.1MB)
Added: 2006-11-25 License: GPL (GNU General Public License) Price:
1063 downloads
PDL::LinearAlgebra 0.03
PDL::LinearAlgebra Perl module contains linear algebra utils for PDL. more>>
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);
<<lessSYNOPSIS
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);
Download (0.12MB)
Added: 2007-06-27 License: Perl Artistic License Price:
849 downloads
Rhino 0.5.3
Rhino is an Othello/reversi game. more>>
Rhino is an Othello/reversi game.
The goad is to have a very strong AI and useful as a learning tool for those who want to master the game.
What distinguish GRhino from most other Othello games is that GRhino will be targeted for experienced Othello players. Strong AI is the main focus with some additional good, useful features (like an endgame solver) is planned. The ultimate target strength of the AI is that it should be able to beat the best human player at the highest difficulty level. Beating Logistello (the strongest program available) is not in the plan.
Some important AI infrastructure has been finished. Pattern evaluator and open book are mostly done but still requires some further optimization and data file compression.
Multi prob-cut to speedup the AI is still missing so it still has a limit on its game strength but this mostly affects playing against other strong AI out there. The main focus for current development is about user interface and features. Currently finished parts include
- End game search. It can now solve the exact score (in about 20 sec on P-133) at around 15 empties and Win-Loss-Draw at a slightly higher number of empties.
- Move ordering.
- Start game from known openings.
- Display opening name.
- A decent pattern-based evaluation with parity knowledge.
- A decent open book with opening variations allowed.
- Browse IOS and GGS format game file.
<<lessThe goad is to have a very strong AI and useful as a learning tool for those who want to master the game.
What distinguish GRhino from most other Othello games is that GRhino will be targeted for experienced Othello players. Strong AI is the main focus with some additional good, useful features (like an endgame solver) is planned. The ultimate target strength of the AI is that it should be able to beat the best human player at the highest difficulty level. Beating Logistello (the strongest program available) is not in the plan.
Some important AI infrastructure has been finished. Pattern evaluator and open book are mostly done but still requires some further optimization and data file compression.
Multi prob-cut to speedup the AI is still missing so it still has a limit on its game strength but this mostly affects playing against other strong AI out there. The main focus for current development is about user interface and features. Currently finished parts include
- End game search. It can now solve the exact score (in about 20 sec on P-133) at around 15 empties and Win-Loss-Draw at a slightly higher number of empties.
- Move ordering.
- Start game from known openings.
- Display opening name.
- A decent pattern-based evaluation with parity knowledge.
- A decent open book with opening variations allowed.
- Browse IOS and GGS format game file.
Download (0.92MB)
Added: 2006-08-11 License: GPL (GNU General Public License) Price:
683 downloads
Iter Vehemens ad Necem 0.50
Iter Vehemens ad Necem project is a graphical roguelike game. more>>
Iter Vehemens ad Necem project is a graphical roguelike game.
Iter Vehemens ad Necem (IVAN) is a graphical roguelike game which currently runs in Windows, DOS, and Linux. It features advanced bodypart and material handling, multi-colored lighting and, above all, deep gameplay.
Fellow adventurer, turn back while you can! For here begins the roguelike Iter Vehemens ad Necem, a Violent Road to Death. If you choose to travel along it, you will dive into countless exciting adventures to gain items of great magic, attain powerful equipment made of mysterious materials, bathe in the blessings of mighty gods and recruit loyal allies of various shapes and sizes.
Unfortunately, along the way you will also often be dangerously injured, poisoned, catch numerous diseases, lose several limbs and transform into manifold different kinds of pitiful creatures in the darkest depths of hostile dungeons. And, at the end of the road, you are bound to perish in a most gruesome and painful way. Dont say we didnt warn you.
Enhancements:
- fluids can now cover items and characters and interact with them
- items made of iron alloys can now rust
- added directional light and day and night which use it
- added some cosmetical weather effects
- New Attnam has now many new NPCs, for instance a sumo wrestler who can be challenged
- polymorph control is now more interesting; you need to see a monster once before you can polymorph into it, and more powerful ones require more intelligence
- added wands of acid rain, mirroring and necromancy
- added scrolls of detect material, harden material and golem creation
- added several new monsters, eg. powerful named archangels for each god and necromancers who raise skeletons and zombies to do their bidding
- one can now give pets tactical commands, change their equipment and use them to carry extra stuff (these are accessed using Chat and Issue commands keys)
- the player can now panic if he gets hit too much, like the monsters have done in previous versions
- the player can now become exhausted if he fights for too long and/or uses the new run command too much
- spiders are now able to make webs
- you can now get stuck to slime
- badly hurt/trapped bodyparts now become unusable until they regain some HP/become untrapped
- it is now possible to browse detailed death reasons of individual monsters in the postgame massacre lists
- added many new informative graphical details, for instance recently altered attributes are shown with a different color for some time
- gloomy cave is now longer and has more special levels and rooms
- all the endgame battles are more complex
- added leprosy, a nasty disease which causes your limbs to drop off randomly
<<lessIter Vehemens ad Necem (IVAN) is a graphical roguelike game which currently runs in Windows, DOS, and Linux. It features advanced bodypart and material handling, multi-colored lighting and, above all, deep gameplay.
Fellow adventurer, turn back while you can! For here begins the roguelike Iter Vehemens ad Necem, a Violent Road to Death. If you choose to travel along it, you will dive into countless exciting adventures to gain items of great magic, attain powerful equipment made of mysterious materials, bathe in the blessings of mighty gods and recruit loyal allies of various shapes and sizes.
Unfortunately, along the way you will also often be dangerously injured, poisoned, catch numerous diseases, lose several limbs and transform into manifold different kinds of pitiful creatures in the darkest depths of hostile dungeons. And, at the end of the road, you are bound to perish in a most gruesome and painful way. Dont say we didnt warn you.
Enhancements:
- fluids can now cover items and characters and interact with them
- items made of iron alloys can now rust
- added directional light and day and night which use it
- added some cosmetical weather effects
- New Attnam has now many new NPCs, for instance a sumo wrestler who can be challenged
- polymorph control is now more interesting; you need to see a monster once before you can polymorph into it, and more powerful ones require more intelligence
- added wands of acid rain, mirroring and necromancy
- added scrolls of detect material, harden material and golem creation
- added several new monsters, eg. powerful named archangels for each god and necromancers who raise skeletons and zombies to do their bidding
- one can now give pets tactical commands, change their equipment and use them to carry extra stuff (these are accessed using Chat and Issue commands keys)
- the player can now panic if he gets hit too much, like the monsters have done in previous versions
- the player can now become exhausted if he fights for too long and/or uses the new run command too much
- spiders are now able to make webs
- you can now get stuck to slime
- badly hurt/trapped bodyparts now become unusable until they regain some HP/become untrapped
- it is now possible to browse detailed death reasons of individual monsters in the postgame massacre lists
- added many new informative graphical details, for instance recently altered attributes are shown with a different color for some time
- gloomy cave is now longer and has more special levels and rooms
- all the endgame battles are more complex
- added leprosy, a nasty disease which causes your limbs to drop off randomly
Download (MB)
Added: 2007-01-03 License: GPL (GNU General Public License) Price:
1029 downloads
XBomb 2.1
XBomb project is a minesweeper game with triangular, square and hexagonal grids. more>>
XBomb project is a minesweeper game with triangular, square and hexagonal grids.
The simplest is the hexagonal grid, next is the traditional square grid and the most complex is the triangular grid. For each of the different grid shapes there are three difficulty levels.
Main features:
3 Grid Tile options
- Hexagonal - Easy (the endgame can be difficult).
- Square - Traditional.
- Triangular - Difficult.
3 Grid sizes
- Small - 8x8 with 10 bombs
- Medium - 16x16 with 40 bombs
- Large - 30x16 with 99 bombs
Highscore table
- 10 entries for the fastest times for each of the 3 levels of each of the 3 grid shapes.
Enhancements:
- mproved the resizing options for the triangles game.
- Renamed the Start button to Restart.
- Changed the scaling so that smaller grids are allowed to fit a 800x640 screen.
<<lessThe simplest is the hexagonal grid, next is the traditional square grid and the most complex is the triangular grid. For each of the different grid shapes there are three difficulty levels.
Main features:
3 Grid Tile options
- Hexagonal - Easy (the endgame can be difficult).
- Square - Traditional.
- Triangular - Difficult.
3 Grid sizes
- Small - 8x8 with 10 bombs
- Medium - 16x16 with 40 bombs
- Large - 30x16 with 99 bombs
Highscore table
- 10 entries for the fastest times for each of the 3 levels of each of the 3 grid shapes.
Enhancements:
- mproved the resizing options for the triangles game.
- Renamed the Start button to Restart.
- Changed the scaling so that smaller grids are allowed to fit a 800x640 screen.
Download (0.023MB)
Added: 2006-11-21 License: GPL (GNU General Public License) Price:
1074 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 1
- 1
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above endgame singularity 0.26a search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed