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
Ernst A. Heinz
Edit
0
44
…
4
Tags
mathematician
papers
people
programmers
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Ernst A. Heinz
Ernst A. Heinz
,
a German computer scientist affiliated with the
UMIT
,
Hall in Tirol
[1]
, and previously with the
International University (IU) Bruchsal
[2]
. In 1993, Ernst A. Heinz and
Peter Gillgasch
, two students at the
University of Karlsruhe
, founded a computer-chess group and started to write a chess program, the
rotated bitboard
engine
DarkThought
[3]
, in 1994 joined by
Markus Gille
[4]
. In 1997 Heinz started to write some recognized papers in the
ICCA Journal
, which were summarized and extended into his 1999 Ph.D thesis
Scalable Search in Computer Chess
, a revised version merchandised as book. From 1999 until 2002 Ernst A. Heinz was
postdoc
at
MIT
[5]
.
Ernst A. Heinz
[6]
Table of Contents
Scalable Search Topics
Selected Publications
1992 ...
1995 ...
2000 ...
2005 ...
External Links
References
What links here?
Scalable Search Topics
AEL-Pruning
Adaptive Null Move Pruning
Extended Futility Pruning
Limited Razoring
Perfect Knowledge
Interior Node Recognizer
Endgame Tablebases
Edwards' Tablebases
Nalimov Tablebases
Thompson's Databases
Diminishing Returns
DarkThought
Bitboards
Rotated Bitboards
Selected Publications
[7]
[8]
[9]
1992 ...
Ernst A. Heinz
(
1992
).
Automatische Elimination von Synchronisationsbarriere in synchronen FORALLs
. M.Sc. thesis,
University of Karlsruhe
, advisor
Michael Philippsen
(German)
1995 ...
Michael Philippsen
,
Ernst A. Heinz
(
1995
).
Automatic Synchronization Elimination in Synchronous FORALLs
.
Frontiers'95
Lutz Prechelt
,
Ernst A. Heinz
,
Paul Lukowicz
,
Walter F. Tichy
(
1995
).
Experimental Evaluation in Computer Science: A Quantitative Study
.
Journal of Systems and Software, Vol. 28, No. 1
Ernst A. Heinz
(
1997
).
How DarkThought Plays Chess
.
ICCA Journal, Vol. 20, No. 3
Ernst A. Heinz
(
1998
).
Extended Futility Pruning
.
ICCA Journal, Vol. 21, No. 2
Ernst A. Heinz
(
1998
).
Efficient Interior-Node Recognition
.
ICCA Journal, Vol. 21, No. 3
Ernst A. Heinz
(
1998
).
DarkThought Goes Deep
.
ICCA Journal, Vol. 21, No. 4
Ernst A. Heinz
(
1999
).
Endgame Databases and Efficient Index Schemes for Chess.
ICCA Journal, Vol. 22, No. 1
,
ps
Ernst A. Heinz
(
1999
).
Knowledgeable Encoding and Querying of Endgame Databases.
ICCA Journal, Vol. 22, No. 2
,
ps
Ernst A. Heinz
(
1999
).
Adaptive Null-Move Pruning.
ICCA Journal, Vol. 22, No. 3
,
ps
Ernst A. Heinz
(
1999
).
Scalable Search in Computer Chess.
Ph.D. thesis,
University of Karlsruhe
, advisor
Walter F. Tichy
[10]
and
Tony Marsland
Ernst A. Heinz
(
1999
).
Scalable Search in Computer Chess
.
Morgan Kaufmann
,
Vieweg-Verlag
[11]
2000 ...
Ernst A. Heinz
(
2000
).
AEL Pruning.
ICGA Journal, Vol. 23, No. 1
,
pdf
Eugene Nalimov
,
Guy Haworth
,
Ernst A. Heinz
(
2000
).
Space-Efficient Indexing of Chess Endgame Tables
.
ICGA Journal, Vol. 23, No. 3
,
postscript
Ernst A. Heinz
(
2000
).
A New Self-Play Experiment in Computer Chess
.
Massachusetts Institute of Technology
, Laboratory of Computer Science, Technical Memo No. 608,
zipped ps
,
pdf
Ernst A. Heinz
(
2000
).
New Self-Play Results in Computer Chess
.
CG 2000
Ernst A. Heinz
(
2001
).
Self-play Experiments in Computer Chess Revisited.
Advances in Computer Games 9
Ernst A. Heinz
(
2001
).
Modeling the “Go Deep” Behaviour of CRAFTY and DARK THOUGHT.
Advances in Computer Games 9
Eugene Nalimov
,
Guy Haworth
,
Ernst A. Heinz
(
2001
).
Space-efficient Indexing of Endgame Tables for Chess
.
Advances in Computer Games 9
Ernst A. Heinz
(
2001
).
Selected Goodies of DarkThought
. Invited Lecture,
6th Computer Olympiad Workshop
,
ppt
Ernst A. Heinz
(
2001
).
Self-Play, Deep Search and Diminishing Returns.
ICGA Journal, Vol. 24, No. 2
Ernst A. Heinz
(
2003
).
Follow-Up on Self-Play, Deep Search, and Diminishing Returns.
ICGA Journal, Vol. 26, No. 2
Ernst A. Heinz
(
2003
).
Static Recognition of Potential Wins in KNNKB and KNNKN
.
Advances in Computer Games 10
Jaap van den Herik
,
Hiroyuki Iida
,
Ernst A. Heinz
(Eds.) (
2004
).
Advances in Computer Games, Many Games, Many Challenges
.
10th International Conference, ACG 2003
, Graz, Austria, November 24-27, 2003, Revised Papers. Series:
IFIP
Advances in Information and Communication Technology
, Vol. 135
2005 ...
Ernst A. Heinz
,
Kai S. Kunze
,
Matthias Gruber
,
David Bannach
,
Paul Lukowicz
(
2006
).
Using Wearable Sensors for Real-Time Recognition Tasks in Games of Martial Arts - An Initial Experiment
.
CIG 2006
David Bannach
,
Oliver Amft
,
Kai S. Kunze
,
Ernst A. Heinz
,
Gerhard Tröster
,
Paul Lukowicz
(
2007
).
Waving Real Hand Gestures Recorded by Wearable Motion Sensors to a Virtual Car and Driver in a Mixed-Reality Parking Game
.
CIG 2007
External Links
Ernst's WWW Pages
Ernst Heinz' ICGA Tournaments
References
^
David Bannach
,
Oliver Amft
,
Kai S. Kunze
,
Ernst A. Heinz
,
Gerhard Tröster
,
Paul Lukowicz
(
2007
).
Waving Real Hand Gestures Recorded by Wearable Motion Sensors to a Virtual Car and Driver in a Mixed-Reality Parking Game
.
CIG 2007
^
Unternehmen Hochschule: Privatuni in Bruchsal ist pleite
,
Spiegel Online
, July 22, 2009 (German)
^
Rotated Bitboards
from Ernst A. Heinz (
1997
).
How DarkThought Plays Chess.
ICCA Journal, Vol. 20, No. 3
^
Ernst A. Heinz - Professional Experience
^
Ernst A. Heinz's old personal pages
at
MIT
^
Computer-WM: Erste Überraschung
,
ChessBase.de
November 22, 2003,
WCCC 2003
,
Advances in Computer Games 10
^
ICGA Reference Database
(pdf)
^
Scientific Articles in Books and Journals
^
dblp: Ernst A. Heinz
^
IPD Tichy - Prof. Dr. Ernst Heinz
^
Dap Hartmann
(
2000
).
The Importance of being Scalable
.
ICGA Journal, Vol. 23, No. 1
, Review
What links here?
Page
Date Edited
6th Computer Olympiad
Jul 22, 2017
Advances in Computer Games 10
Dec 30, 2016
Advances in Computer Games 9
Nov 15, 2016
AEL-Pruning
Jun 22, 2013
Alexander Szabo
Nov 10, 2012
Alpha-Beta
Jan 28, 2018
Amundsen
Sep 3, 2013
Bitboards
Nov 14, 2017
CG 2000
May 26, 2015
ChessBase Best-Publication Awards to Include
Jan 7, 2017
Chessmaster
Jan 21, 2018
Chiron
Sep 24, 2017
Crafty
Jan 28, 2018
Dap Hartmann
Jun 10, 2017
DarkThought
Jul 3, 2018
David Forthoffer
Apr 25, 2016
Depth
Feb 25, 2018
Depth Reduction R
Oct 4, 2017
Draw
Apr 14, 2018
Edwards' Tablebases
Sep 26, 2016
Efficient Generation of Sliding Piece Attacks
Nov 5, 2016
Endgame Bitbases
Apr 5, 2017
Endgame Tablebases
Mar 6, 2018
Ernst A. Heinz
Mar 6, 2017
Eugene Nalimov
Dec 23, 2016
Fischerle
Aug 21, 2017
Frontier Nodes
Dec 29, 2013
Futility Pruning
Aug 30, 2017
Graphics Programming
Dec 22, 2017
Guy Haworth
Nov 20, 2017
Horizon Node
Sep 13, 2016
ICCA
Mar 9, 2012
ICGA Journal
Dec 21, 2017
ICGA Journal Awards to Include
May 21, 2015
Interior Node Recognizer
Mar 12, 2018
Ken Thompson
Sep 8, 2017
Lars Rasmussen
Apr 25, 2016
Markus Gille
May 15, 2016
Massachusetts Institute of Technology
Jan 24, 2017
Match Statistics
Mar 31, 2018
Mate Threat Extensions
Apr 14, 2012
Mathematician
Apr 9, 2018
Move Generation
Jan 29, 2018
Nalimov Tablebases
Dec 23, 2016
Node
Jul 20, 2015
Null Move Pruning
Dec 2, 2017
Papers
Jan 11, 2017
People
Feb 28, 2018
Pepito
Nov 27, 2014
Peter Gillgasch
May 15, 2016
Playing Strength
Mar 31, 2018
Pre Frontier Node
Mar 10, 2012
Pruning
Jan 1, 2018
Razoring
Oct 5, 2015
Recommended Reading
Nov 17, 2017
Rotated Bitboards
Mar 7, 2017
Search
Feb 1, 2018
Severi Salminen
May 7, 2015
Simplex
Mar 6, 2016
Sito Dekker
Apr 25, 2016
TechMate
Aug 23, 2014
Thompson's Databases
Dec 24, 2014
Tony Marsland
Nov 27, 2017
WCCC 1995
Jul 12, 2017
WCCC 1999
Jul 13, 2017
WMCCC 1995
Jan 3, 2018
WMCCC 1996
Sep 15, 2016
WMCCC 1997
Apr 4, 2017
XXXX
Jan 7, 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...
a German computer scientist affiliated with the UMIT, Hall in Tirol [1], and previously with the International University (IU) Bruchsal [2]. In 1993, Ernst A. Heinz and Peter Gillgasch, two students at the University of Karlsruhe, founded a computer-chess group and started to write a chess program, the rotated bitboard engine DarkThought [3], in 1994 joined by Markus Gille [4]. In 1997 Heinz started to write some recognized papers in the ICCA Journal, which were summarized and extended into his 1999 Ph.D thesis Scalable Search in Computer Chess, a revised version merchandised as book. From 1999 until 2002 Ernst A. Heinz was postdoc at MIT [5].
Table of Contents
Scalable Search Topics
Selected Publications
[7] [8] [9]1992 ...
1995 ...
2000 ...
2005 ...
External Links
References
What links here?
Up one level