Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Brainless
Edit
0
8
…
7
Tags
brain
engines
gplengines
musicvideos
namesake
opensourceengines
xboardengines
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Table of Contents
Photos
Description
Board Representation
Search
Evaluation
Namesake
See also
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Home
*
Engines
* Brainless
Brainless
,
a
Chess Engine Communication Protocol
compliant
open source chess engine
under the
GNU General Public License
, written in
C++
by
Matthew Lai
and
Wieland Belka
with contributions from
Pawel Koziol
. Brainless started as project from Matthew 's high school years and has been abandoned in about 2008, when German chess master Wieland Belka and Pawel Koziol contributed to the
evaluation
to play the
First Italian Open Chess Software Cup
, 2010 in
Carugate
. It plays on
FICS
under the handle BrainlessChess(C)
[1]
. The
opening book
is converted from
Beowulf
.
Photos
IOCSC 2010
:
Dolphin
and
Brainless
operated by local chess players
[2]
Description
[3]
Board Representation
Brainless is a
bitboard
engine and uses
rotated bitboards
indexed by
6-bit line occupancy
to determine
sliding piece attacks
, and uses the
GCC
builtins
trailing zero count
and
population count
[4]
for
bitboard serialization
and
mobility
.
Search
The
search
is
PVS
alpha-beta
with
transposition table
inside an
iterative deepening
framework with
aspiration windows
.
Selectivity
is applied by
adaptive null move pruning
(R=2 + depth >= 7),
LMR
,
IID
and
check extensions
, the
quiescence search
considers
captures
and
promotions
only. Along with the
killer heuristic
,
static exchange evaluation
improves
move ordering
, and also
prunes
bad captures near the tips.
Evaluation
The
evaluation
function, written by
Wieland Belka
, with contributions from
Pawel Koziol
, consists mainly of
material
,
piece-square tables
,
cached
pawn structure
,
king safety
and various
evaluation patterns
.
Namesake
Brainless (Forth)
by
David Kühling
See also
Brain
Forum Posts
Re: resources on how to write an eval function?
by cyberfish, March 14, 2008
External Links
Chess Engine
Brainless - Homepage
Piece of Mind » Blog Archive » Computer Chess Tournament?!
by
Matthew Lai
»
IOCSC 2010
Misc
Brainless Synonyms, Brainless Antonyms | Thesaurus.com
Urban Dictionary: brainless
brainless - Wiktionary
no-brainer - Wiktionary
Brainless
- Mr Freezer,
YouTube
Video
References
^
FICS Games Database - Statistics for BrainlessChess(C)
^
Piece of Mind » Blog Archive » Computer Chess Tournament?!
^
Description based on
Brainless - Homepage
^
Other Builtins - Using the GNU Compiler Collection (GCC)
What links here?
Page
Date Edited
Brainless
Jun 24, 2017
Brainless (Forth)
Jun 24, 2017
Eichhörnchen
Jul 16, 2013
Engines
Mar 10, 2018
IOCSC 2010
Jul 13, 2013
Matthew Lai
Dec 6, 2017
Wieland Belka
Jul 13, 2013
Up one Level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
Table of Contents
Brainless,
a Chess Engine Communication Protocol compliant open source chess engine under the GNU General Public License, written in C++ by Matthew Lai and Wieland Belka with contributions from Pawel Koziol. Brainless started as project from Matthew 's high school years and has been abandoned in about 2008, when German chess master Wieland Belka and Pawel Koziol contributed to the evaluation to play the First Italian Open Chess Software Cup, 2010 in Carugate. It plays on FICS under the handle BrainlessChess(C) [1]. The opening book is converted from Beowulf.
Photos
Description
[3]Board Representation
Brainless is a bitboard engine and uses rotated bitboards indexed by 6-bit line occupancy to determine sliding piece attacks, and uses the GCC builtins trailing zero count and population count [4] for bitboard serialization and mobility.Search
The search is PVS alpha-beta with transposition table inside an iterative deepening framework with aspiration windows. Selectivity is applied by adaptive null move pruning (R=2 + depth >= 7), LMR, IID and check extensions, the quiescence search considers captures and promotions only. Along with the killer heuristic, static exchange evaluation improves move ordering, and also prunes bad captures near the tips.Evaluation
The evaluation function, written by Wieland Belka, with contributions from Pawel Koziol, consists mainly of material, piece-square tables, cached pawn structure, king safety and various evaluation patterns.Namesake
See also
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Up one Level