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
Smash
Edit
0
8
…
5
Tags
engines
gplengines
opensourceengines
smpengines
uciengines
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
Engines
* Smash
Smash
,
an
UCI
compliant
open source chess engine
written by
Maurizio Sambati
in
C++
, distributed under the terms of the
General Public License
. Smash played the
CIPS 2004
,
CCC 2005
,
CIPS 2005
,
CIPS 2007
Italian Computer Chess Championships
.
Smash is a
bitboard
engine and uses
rotated bitboards
with 256
line occupancy
states to generate
sliding piece attacks
. While earlier
WinBoard
versions used
MTD(f)
, since 1.0 the
Iterative deepening
framework calls a
principal variation search
.
Structured exception handling
is used to catch terminate- and timer exceptions thrown elsewhere.
Selectivity
is applied with
adaptive null move
,
futility-
and
delta pruning
,
check-
and
one reply extensions
. A
capture
entering the
pawn endgame
is
extended
by two plies. Beside moves from the
transposition table
, and
MVV-LVA
for captures,
move ordering
is controlled by
killer-
and
history heuristic
.
Evaluation
determines positional aspects with
piece-square tables
, and considers
pawn structure
,
king safety
and various positional piece terms.
Smash in
Badminton
[1]
Table of Contents
Deep Smash
Photos
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Deep Smash
Version 1.0 has been rewritten from scratch. Dubbed Deep Smash - it performs a
parallel search
using
threads
, applying
ABDADA
with a
shared transposition table
[2]
.
Photos
CCC 2005
:
Fabio Cavicchio
(
Delfi
) and
Maurizio Sambati
-
Smash
[3]
Forum Posts
Has anyone ever heard of an engine called Smash?
by bigo,
CCC
, December 27, 2007
Re: interested in making single proccesor program multi
by
Alessandro Scotti
,
CCC
, December 29, 2007
Smash (single-CPU/SMP) by Maurizio Sambati
by
Norbert Raimund Leisner
,
CCC
, August 31, 2008
Last Smash version? (for the RWBC chronology)
by
Günther Simon
,
CCC
, May 10, 2016
External Links
Chess Engine
Maurizio Sambati - Programmi - Smash
Smash « G 6
Smash 1.0.3
in
KCEC
Index of /chess/engines/Norbert's collection/Smash (Compilation)
by
Norbert Raimund Leisner
, hosted by
Kirill Kryukov
Misc
smash - Wiktionary
smashing - Wiktionary
smash - Wiktionary.simple
References
^
In June 2005, Chinese
Badminton
player,
Fu Haifeng
set a world record when he hit a smash at over 208
miles per hour
, from
East Leake Badminton
^
Re: interested in making single proccesor program multi
by
Alessandro Scotti
,
CCC
, December 29, 2007
^
Computer Chess Cup 2005
by
Alessandro Scotti
What links here?
Page
Date Edited
ABDADA
Aug 30, 2017
CCC 2005
Feb 27, 2014
CIPS 2004
Jan 6, 2014
CIPS 2005
Feb 4, 2013
CIPS 2007
Jan 6, 2014
Engines
Mar 10, 2018
Maurizio Sambati
Apr 23, 2015
Smash
May 11, 2016
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...
an UCI compliant open source chess engine written by Maurizio Sambati in C++, distributed under the terms of the General Public License. Smash played the CIPS 2004, CCC 2005, CIPS 2005, CIPS 2007 Italian Computer Chess Championships.
Smash is a bitboard engine and uses rotated bitboards with 256 line occupancy states to generate sliding piece attacks. While earlier WinBoard versions used MTD(f), since 1.0 the Iterative deepening framework calls a principal variation search. Structured exception handling is used to catch terminate- and timer exceptions thrown elsewhere. Selectivity is applied with adaptive null move, futility- and delta pruning, check- and one reply extensions. A capture entering the pawn endgame is extended by two plies. Beside moves from the transposition table, and MVV-LVA for captures, move ordering is controlled by killer- and history heuristic. Evaluation determines positional aspects with piece-square tables, and considers pawn structure, king safety and various positional piece terms.
Table of Contents
Deep Smash
Version 1.0 has been rewritten from scratch. Dubbed Deep Smash - it performs a parallel search using threads, applying ABDADA with a shared transposition table [2].Photos
Forum Posts
External Links
Chess Engine
Misc
References
What links here?
Up one Level