Ingo Althöfer

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 12

Top Venues

J. Int. Comput. Games Assoc.

Computers and Games

ACG

Int. J. Game Theory

Bielefeld University, Germany (PHD)

Education History

Bielefeld University, Germany

PHD

Publications

Ingo Althöfer, Michael Hartisch, Thomas Zipproth
Analysis of a Collatz Game and Other Variants of the 3n+1 Problem. ACG (2023)
Ingo Althöfer
Computer Chess and Chess Computers in East Germany. J. Int. Comput. Games Assoc. 42 (2-3) (2020)
Raphael Thiele, Ingo Althöfer
Analyzing a variant of Clobber: The game of San Jego. J. Int. Comput. Games Assoc. 42 (4) (2020)
Raphael Thiele, Ingo Althöfer
An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. Computers and Games (2016)
Ievgen Liubarshchuk, Ingo Althöfer
The problem of approach in differential-difference games. Int. J. Game Theory 45 (3) (2016)
Ingo Althöfer
Computer-Aided Go: Chess as a Role Model. Computers and Games (2016)
Ingo Althöfer, Matthias Beckmann, Friedrich Salzer
On Some Random Walk Games with Diffusion Control. ACG (2015)
Michael Hartisch, Ingo Althöfer
Optimal Robot Play in Certain Chess Endgame Situations. J. Int. Comput. Games Assoc. 38 (3) (2015)
Ingo Althöfer
HANFRIED wins EinStein Würfelt Nicht! Tournament. J. Int. Comput. Games Assoc. 38 (4) (2015)
Ingo Althöfer
Advances in Computer Games Conference 2015: Report on Day 1. J. Int. Comput. Games Assoc. 38 (3) (2015)
Ingo Althöfer, Jan Kristian Haugland, Karl Scherer, Frank Schneider, Nico Van Cleemput
Alternating plane graphs. Ars Math. Contemp. 8 (2) (2015)
Ingo Althöfer
Obituary: John Nash, A Beautiful Mind has Gone. J. Int. Comput. Games Assoc. 38 (2) (2015)
Ingo Althöfer, Raymond Georg Snatzke
The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. J. Int. Comput. Games Assoc. 37 (4) (2014)
Ingo Althöfer, Wesley Michael Turner
Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games. Computers and Games (2013)
Ingo Althöfer
Conference Report Day 1. J. Int. Comput. Games Assoc. 36 (3) (2013)
Ingo Althöfer
PAN Wins Clobber Tournament. J. Int. Comput. Games Assoc. 36 (3) (2013)
Ingo Althöfer
Remarks on History and Presence of Game Tree Search and Research. Information Theory, Combinatorics, and Search Theory (2013)
Ingo Althöfer
The Origin of Dynamic Komi. J. Int. Comput. Games Assoc. 35 (1) (2012)
Ingo Althöfer
Havannah - The Old Man and the C's. J. Int. Comput. Games Assoc. 35 (4) (2012)
Ingo Althöfer
PAN Wins Clobber Tournament. J. Int. Comput. Games Assoc. 35 (1) (2012)
Ingo Althöfer
Side Report: Popular Video Livestream. J. Int. Comput. Games Assoc. 35 (1) (2012)
Ingo Althöfer
John Tromp in the Style of David Levy: 4-0 Win in the Go Bet. J. Int. Comput. Games Assoc. 34 (2) (2011)
Ingo Althöfer
On Games with Random-Turn Order and Monte Carlo Perfectness. J. Int. Comput. Games Assoc. 34 (4) (2011)
Ingo Althöfer
On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. ACG (2011)
Ingo Althöfer
Automatic Generation and Evaluation of Recombination Games. J. Int. Comput. Games Assoc. 33 (4) (2010)
Ingo Althöfer, Susanne Heuser
Randomised Evaluations in Single-Agent Search. J. Int. Comput. Games Assoc. 28 (1) (2005)
Ingo Althöfer
Improved game play by multiple computer hint. Theor. Comput. Sci. 313 (3) (2004)
Ingo Althöfer
A 20-Choice Experiment in Go for Human+Computer. J. Int. Comput. Games Assoc. 26 (2) (2003)
Ingo Althöfer, Johan de Koning, Jens Lieberum, Stefan Meyer-Kahlen, Thomas Rolle, Jörg Sameith
Five Visualisations of the k-best Mode. J. Int. Comput. Games Assoc. 26 (3) (2003)
Ingo Althöfer, Raymond Georg Snatzke
Playing Games with Multiple Choice Systems. Computers and Games (2002)
Ingo Althöfer
A One-Sided Advanced Chess Match. J. Int. Comput. Games Assoc. 23 (3) (2000)
Ingo Althöfer
A One-Sided Advanced Chess Match. J. Int. Comput. Games Assoc. 23 (4) (2000)
Ingo Althöfer
Corrections on Dap Hartmann's Review of "13 Years of 3-Hirn". J. Int. Comput. Games Assoc. 22 (3) (1999)
Ingo Althöfer
Advanced Shuffle Chess with Technical Improvements. J. Int. Comput. Games Assoc. 22 (4) (1999)
Ingo Althöfer
Technical Proposals on "Advanced Chess". J. Int. Comput. Games Assoc. 21 (4) (1998)
Ingo Althöfer
LIST-3-HIRN vs. Grandmaster Yusupov. J. Int. Comput. Games Assoc. 21 (1) (1998)
Ingo Althöfer
LIST-3-HIRN vs. Grandmaster Yusupov, A Report on a very Experimental Match Part II: Analysis. J. Int. Comput. Games Assoc. 21 (2) (1998)
Ingo Althöfer
A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko. J. Int. Comput. Games Assoc. 20 (1) (1997)
Ingo Althöfer
On the K-Best Mode in Computer Chess: Measuring the Similarity of Move Proposals. J. Int. Comput. Games Assoc. 20 (3) (1997)
Ingo Althöfer, Matthias Löwe
Edge search in hypergraphs. Discret. Math. 162 (1-3) (1996)
Ingo Althöfer, Jörg Bültermann
Superlinear Period Lengths in Some Subtraction Games. Theor. Comput. Sci. 148 (1) (1995)
Ingo Althöfer
Review. J. Int. Comput. Games Assoc. 18 (2) (1995)
Ingo Althöfer, Imre Leader
Correlation of Boolean Functions and Pathology in Recursion Trees. SIAM J. Discret. Math. 8 (4) (1995)
Ingo Althöfer
Review. J. Int. Comput. Games Assoc. 18 (1) (1995)
Ingo Althöfer
Reviews. J. Int. Comput. Games Assoc. 17 (2) (1994)
Ingo Althöfer
Reviews. J. Int. Comput. Games Assoc. 17 (2) (1994)
Ingo Althöfer
Note: Small integral flows need only sparse networks. Networks 24 (4) (1994)
Ingo Althöfer, Bernhard Walter
Weak Zugzwang: Statistics on some Chess Endgames. J. Int. Comput. Games Assoc. 17 (2) (1994)
Rudolf Ahlswede, Ingo Althöfer
The Asymptotic Behavior of Diameters in the Average. J. Comb. Theory, Ser. B 61 (2) (1994)
Ingo Althöfer
Reviews. J. Int. Comput. Games Assoc. 17 (2) (1994)
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9 (1993)
Ingo Althöfer
Review. J. Int. Comput. Games Assoc. 16 (3) (1993)
Ingo Althöfer, Klaus-Uwe Koschnick
On the Deterministic Complexity of Searching Local Maxima. Discret. Appl. Math. 43 (2) (1993)
Ingo Althöfer
A Parallel Game Tree Search Algorithm with a Linear Speedup. J. Algorithms 15 (2) (1993)
Ingo Althöfer
On Telescoping Linear Evaluation Functions. J. Int. Comput. Games Assoc. 16 (2) (1993)
Ingo Althöfer, Eberhard Triesch
Edge search in graphs and hypergraphs of bounded rank. Discret. Math. 115 (1-3) (1993)
Ingo Althöfer
Move Ordering by Time Ordering. J. Int. Comput. Games Assoc. 15 (2) (1992)
Ingo Althöfer, Bernhard Balkenhol
A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm. Artif. Intell. 52 (2) (1992)
Ingo Althöfer
On Asymmetries in Chess Programs. J. Int. Comput. Games Assoc. 15 (1) (1992)
Ingo Althöfer, Torsten Sillke
An "average distance" inequality for large subsets of the cube. J. Comb. Theory, Ser. B 56 (2) (1992)
Ingo Althöfer
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. 15 (2) (1992)
Ingo Althöfer
An Additive Evaluation Function in Chess. J. Int. Comput. Games Assoc. 14 (3) (1991)
Ingo Althöfer
Sören W. Perrey: Mathematische Methoden der Künstlichen Intelligenz: Zur Quiescence-Suche in Spielbäumen. J. Int. Comput. Games Assoc. 14 (2) (1991)
Ingo Althöfer
Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example. Artif. Intell. 52 (1) (1991)
Ingo Althöfer
The complexity of a simple stochastic OR-tree model in which "directional search" is bad. J. Complex. 6 (3) (1990)
Ingo Althöfer
Review. J. Int. Comput. Games Assoc. 13 (3) (1990)
Ingo Althöfer
Compressing Chess Games with the Help of a Fast Deterministic Chess Program. J. Int. Comput. Games Assoc. 13 (4) (1990)
Ingo Althöfer
Average distances in undirected graphs and the removal of vertices. J. Comb. Theory, Ser. B 48 (1) (1990)
Ingo Althöfer
Tight Lower Bounds on the Length of Word Chains. Inf. Process. Lett. 34 (5) (1990)
David L. Dowe, Ingo Althöfer, John Roycroft
Symmetrical Chess. J. Int. Comput. Games Assoc. 13 (4) (1990)
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph
Generating Sparse Spanners for Weighted Graphs. SWAT (1990)
Ingo Althöfer
An Incremental Negamax Algorithm. Artif. Intell. 43 (1) (1990)
Ingo Althöfer
A Conjecture Withdrawn. J. Int. Comput. Games Assoc. 12 (3) (1989)
Ingo Althöfer
Retrograde Analysis and Two Computerizable Definitions of the Quality of Chess Games. J. Int. Comput. Games Assoc. 12 (2) (1989)
Ingo Althöfer
Reviews. J. Int. Comput. Games Assoc. 11 (4) (1988)
Ingo Althöfer
Root Evaluation Errors: How they Arise and Propagate. J. Int. Comput. Games Assoc. 11 (2-3) (1988)
Ingo Althöfer
On Optimal Realizations of Finite Metric Spaces by Graphs. Discret. Comput. Geom. 3 (1988)
Ingo Althöfer
On the Complexity of Searching Game Trees and Other Recursion Trees. J. Algorithms 9 (4) (1988)
Ingo Althöfer
Report on the Workshop "Computer Chess and Game Trees". J. Int. Comput. Games Assoc. 11 (2-3) (1988)
Ingo Althöfer
A Prize for Symbiosis. J. Int. Comput. Games Assoc. 10 (1) (1987)

Ingo Althöfer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ingo Althöfer