Android-Chess
Home
*
Engines
* Android-Chess
Android-Chess
,
an
open source chess application
for
Android
, written by
Jeroen Carolus
, released under the
MIT License
. Android-Chess consists of a
Java
chess
GUI
and an engine. The engine was initially written in
Java
for Jeroen's
pruning
research and M.Sc. thesis
[1]
, and has been ported to
C++
and communicates with the GUI via
JNI
.
Android-Chess
[2]
Table of Contents
Description
See also
External Links
References
What links here?
Description
Android-Chess is a
bitboard
engine using
rotated bitboards
to determine
sliding piece attacks
, and does not take advantage of the
outer square optimization
using an 8-bit occupied index with four lookup tables of 256*64*8 or 128 KiB each, thus 1/2 MiB in total.
Alpha-beta
is embedded inside an
iterative deepening
loop without
aspiration
.
Evaluation
considers
material
and various
pawn structure
and piece terms.
See also
Chess for Android
External Links
GitHub - jcarolus/android-chess: Chess game for Android
Chess – Android-Apps at Google Play
andriod-Chess
References
^
Jeroen Carolus
(
2006
).
Alpha-Beta with Sibling Prediction Pruning in Chess
. Master's thesis,
pdf
^
andriod-Chess
What links here?
Page
Date Edited
Android-Chess
Jun 2, 2016
Engines
Mar 10, 2018
Jeroen Carolus
Jun 2, 2016
Mathematician
Apr 9, 2018
Up one Level
Contributions to https://chessprogramming.wikispaces.com/ are licensed under a
Creative Commons Attribution Share-Alike 3.0 License
.
Portions not contributed by visitors are Copyright 2018 Tangient LLC
TES: The largest network of teachers in the world
Turn off "Getting Started"
Home
...
Loading...
an open source chess application for Android, written by Jeroen Carolus, released under the MIT License. Android-Chess consists of a Java chess GUI and an engine. The engine was initially written in Java for Jeroen's pruning research and M.Sc. thesis [1], and has been ported to C++ and communicates with the GUI via JNI.
Table of Contents
Description
Android-Chess is a bitboard engine using rotated bitboards to determine sliding piece attacks, and does not take advantage of the outer square optimization using an 8-bit occupied index with four lookup tables of 256*64*8 or 128 KiB each, thus 1/2 MiB in total. Alpha-beta is embedded inside an iterative deepening loop without aspiration. Evaluation considers material and various pawn structure and piece terms.See also
External Links
References
What links here?
Up one Level