Ingo Althöfer

Affiliations:
  • Friedrich Schiller University of Jena, Germany


According to our database1, Ingo Althöfer authored at least 74 papers between 1986 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Analysis of a Collatz Game and Other Variants of the 3n+1 Problem.
Proceedings of the Advances in Computer Games - 18th International Conference, 2023

2020
Analyzing a variant of Clobber: The game of San Jego.
J. Int. Comput. Games Assoc., 2020

Computer Chess and Chess Computers in East Germany.
J. Int. Comput. Games Assoc., 2020

2016
The problem of approach in differential-difference games.
Int. J. Game Theory, 2016

An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game.
Proceedings of the Computers and Games - 9th International Conference, 2016

Computer-Aided Go: Chess as a Role Model.
Proceedings of the Computers and Games - 9th International Conference, 2016

2015
Optimal Robot Play in Certain Chess Endgame Situations.
J. Int. Comput. Games Assoc., 2015

HANFRIED wins EinStein Würfelt Nicht! Tournament.
J. Int. Comput. Games Assoc., 2015

Advances in Computer Games Conference 2015: Report on Day 1.
J. Int. Comput. Games Assoc., 2015

Obituary: John Nash, A Beautiful Mind has Gone.
J. Int. Comput. Games Assoc., 2015

Alternating plane graphs.
Ars Math. Contemp., 2015

On Some Random Walk Games with Diffusion Control.
Proceedings of the Advances in Computer Games - 14th International Conference, 2015

2014
The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE.
J. Int. Comput. Games Assoc., 2014

2013
PAN Wins Clobber Tournament.
J. Int. Comput. Games Assoc., 2013

Conference Report Day 1.
J. Int. Comput. Games Assoc., 2013

Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games.
Proceedings of the Computers and Games - 8th International Conference, 2013

Remarks on History and Presence of Game Tree Search and Research.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Havannah - The Old Man and the C's.
J. Int. Comput. Games Assoc., 2012

Side Report: Popular Video Livestream.
J. Int. Comput. Games Assoc., 2012

The Origin of Dynamic Komi.
J. Int. Comput. Games Assoc., 2012

2011
On Games with Random-Turn Order and Monte Carlo Perfectness.
J. Int. Comput. Games Assoc., 2011

John Tromp in the Style of David Levy: 4-0 Win in the Go Bet.
J. Int. Comput. Games Assoc., 2011

On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness.
Proceedings of the Advances in Computer Games - 13th International Conference, 2011

2010
Automatic Generation and Evaluation of Recombination Games.
J. Int. Comput. Games Assoc., 2010

2005
Randomised Evaluations in Single-Agent Search.
J. Int. Comput. Games Assoc., 2005

2004
Improved game play by multiple computer hint.
Theor. Comput. Sci., 2004

2003
Five Visualisations of the k-best Mode.
J. Int. Comput. Games Assoc., 2003

A 20-Choice Experiment in Go for Human+Computer.
J. Int. Comput. Games Assoc., 2003

2002
Playing Games with Multiple Choice Systems.
Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2000
A One-Sided Advanced Chess Match.
J. Int. Comput. Games Assoc., 2000

1999
Advanced Shuffle Chess with Technical Improvements.
J. Int. Comput. Games Assoc., 1999

Corrections on Dap Hartmann's Review of "13 Years of 3-Hirn".
J. Int. Comput. Games Assoc., 1999

1998
Technical Proposals on "Advanced Chess".
J. Int. Comput. Games Assoc., 1998

LIST-3-HIRN vs. Grandmaster Yusupov, A Report on a very Experimental Match Part II: Analysis.
J. Int. Comput. Games Assoc., 1998

LIST-3-HIRN vs. Grandmaster Yusupov.
J. Int. Comput. Games Assoc., 1998

13 Jahre 3-Hirn - meine Schach-Experimente mit Mensch-Maschinen-Kombinationen: das 3-Hirn-Prinzip.
Selbstverl., ISBN: 978-3-00-003100-7, 1998

1997
On the K-Best Mode in Computer Chess: Measuring the Similarity of Move Proposals.
J. Int. Comput. Games Assoc., 1997

A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko.
J. Int. Comput. Games Assoc., 1997

1996
Edge search in hypergraphs.
Discret. Math., 1996

1995
Superlinear Period Lengths in Some Subtraction Games.
Theor. Comput. Sci., 1995

Correlation of Boolean Functions and Pathology in Recursion Trees.
SIAM J. Discret. Math., 1995

Review.
J. Int. Comput. Games Assoc., 1995

1994
Note: Small integral flows need only sparse networks.
Networks, 1994

The Asymptotic Behavior of Diameters in the Average.
J. Comb. Theory, Ser. B, 1994

Weak Zugzwang: Statistics on some Chess Endgames.
J. Int. Comput. Games Assoc., 1994

Reviews.
J. Int. Comput. Games Assoc., 1994

1993
A Parallel Game Tree Search Algorithm with a Linear Speedup.
J. Algorithms, 1993

On Telescoping Linear Evaluation Functions.
J. Int. Comput. Games Assoc., 1993

Edge search in graphs and hypergraphs of bounded rank.
Discret. Math., 1993

On Sparse Spanners of Weighted Graphs.
Discret. Comput. Geom., 1993

On the Deterministic Complexity of Searching Local Maxima.
Discret. Appl. Math., 1993

1992
An "average distance" inequality for large subsets of the cube.
J. Comb. Theory, Ser. B, 1992

Move Ordering by Time Ordering.
J. Int. Comput. Games Assoc., 1992

B. Balkenhol: K-reguläre Minimax-Bäume mit distinkten Blattwerten, die bei beliebiger Sortierung "leicht" für den alpha-beta Algorithmus sind.
J. Int. Comput. Games Assoc., 1992

On Asymmetries in Chess Programs.
J. Int. Comput. Games Assoc., 1992

A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm.
Artif. Intell., 1992

1991
An Additive Evaluation Function in Chess.
J. Int. Comput. Games Assoc., 1991

Sören W. Perrey: Mathematische Methoden der Künstlichen Intelligenz: Zur Quiescence-Suche in Spielbäumen.
J. Int. Comput. Games Assoc., 1991

Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example.
Artif. Intell., 1991

1990
Average distances in undirected graphs and the removal of vertices.
J. Comb. Theory, Ser. B, 1990

The complexity of a simple stochastic OR-tree model in which "directional search" is bad.
J. Complex., 1990

Tight Lower Bounds on the Length of Word Chains.
Inf. Process. Lett., 1990

Symmetrical Chess.
J. Int. Comput. Games Assoc., 1990

Compressing Chess Games with the Help of a Fast Deterministic Chess Program.
J. Int. Comput. Games Assoc., 1990

An Incremental Negamax Algorithm.
Artif. Intell., 1990

Generating Sparse Spanners for Weighted Graphs.
Proceedings of the SWAT 90, 1990

1989
A Conjecture Withdrawn.
J. Int. Comput. Games Assoc., 1989

Retrograde Analysis and Two Computerizable Definitions of the Quality of Chess Games.
J. Int. Comput. Games Assoc., 1989

1988
On the Complexity of Searching Game Trees and Other Recursion Trees.
J. Algorithms, 1988

Report on the Workshop "Computer Chess and Game Trees".
J. Int. Comput. Games Assoc., 1988

Root Evaluation Errors: How they Arise and Propagate.
J. Int. Comput. Games Assoc., 1988

On Optimal Realizations of Finite Metric Spaces by Graphs.
Discret. Comput. Geom., 1988

1987
A Prize for Symbiosis.
J. Int. Comput. Games Assoc., 1987

1986
Asymptotic properties of certain competition systems in artificial intelligence and ecology.
PhD thesis, 1986


  Loading...