Difference between revisions of "Wilhelm Barth"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
'''[[Main Page|Home]] * [[People]] * Wilhelm Barth'''
 
'''[[Main Page|Home]] * [[People]] * Wilhelm Barth'''
  
[[FILE:Barth.gif|border|right|thumb|Wilhelm Barth <ref>[http://www.ads.tuwien.ac.at/people/Barth.html Homepage of Wilhelm Barth] (no longer available)</ref> ]]  
+
[[FILE:Barth.gif|border|right|thumb|Wilhelm Barth <ref>[https://web.archive.org/web/20130612033718/https://www.ads.tuwien.ac.at/people/Barth.html Homepage of Wilhelm Barth] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])</ref> ]]  
  
'''Wilhelm Barth''',<br/>
+
'''Wilhelm P. Barth''',<br/>
an Austrian computer scientist and Professor Emeritus at the [[Vienna University of Technology]] <ref>[https://austria-forum.org/af/Wissenssammlungen/Wissenschaftler/Barth%2C_Wilhelm Barth, Wilhelm | Wissenschaftler | Wissenschaft im Austria-Forum]</ref>. His research interests covers Computer Chess <ref>[http://www.ads.tuwien.ac.at/research/Chess.html Computer Chess] (Barth, [[Heinz Herbeck|Herbeck]])</ref>, [https://en.wikipedia.org/wiki/Category:Geometric_algorithms Geometric Algorithms] and [https://en.wikipedia.org/wiki/Ray_tracing_%28graphics%29 Ray tracing].  
+
a German mathematician <ref>[https://www.genealogy.math.ndsu.nodak.edu/id.php?id=21231 The Mathematics Genealogy Project - Wilhelm Barth]</ref>, computer scientist and Professor Emeritus at the [[Vienna University of Technology]] <ref>[https://austria-forum.org/af/Wissenssammlungen/Wissenschaftler/Barth%2C_Wilhelm Barth, Wilhelm | Wissenschaftler | Wissenschaft im Austria-Forum]</ref>.  
 +
He defended his Ph.D. at [[Darmstadt University of Technology]] in 1963 on [https://en.wikipedia.org/wiki/Graeffe%27s_method Graeffe's method] under supervision of
 +
[[Mathematician#Walther|Alwin Walther]] and [[Mathematician#DLaugwitz|Detlef Laugwitz]]. His research interests include [https://en.wikipedia.org/wiki/Root-finding_algorithm root-finding algorithms], [https://en.wikipedia.org/wiki/Category:Geometric_algorithms geometric algorithms], [https://en.wikipedia.org/wiki/Graph_theory graph theory], [https://en.wikipedia.org/wiki/Ray_tracing_%28graphics%29 ray tracing], and computer chess <ref>[http://www.ads.tuwien.ac.at/research/Chess.html Computer Chess] (Barth, [[Heinz Herbeck|Herbeck]])</ref>.  
  
 
=Endspiel=
 
=Endspiel=
Line 10: Line 12:
  
 
=Selected Publications=  
 
=Selected Publications=  
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
+
<ref>[https://dblp.uni-trier.de/pers/hd/b/Barth:Wilhelm dblp: Wilhelm Barth]</ref> <ref>[https://www.cg.tuwien.ac.at/staff/WilhelmBarth.html Wilhelm Barth :: Institut für Computergraphik und Algorithmen - Arbeitsgruppe für Computergraphik]</ref>
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1991'''). ''Programme für korrekte Schachendspiele und deren Validierung''. Institutsbericht, Nr. 34. Institut für Computergraphik, [[Vienna University of Technology|Technische Universität Wien]] (German)
+
==1963 ...==
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/ki/gwai91.html#KaindlB91 GWAI 1991]: 50-61.
+
* [[Wilhelm Barth]] ('''1963'''). ''Praktisches Vorgehen und Fehlerabschätzung beim Graeffe-Verfahren''. Dissertation, [[Darmstadt University of Technology]], supervisors [[Mathematician#Walther|Alwin Walther]] and [[Mathematician#DLaugwitz|Detlef Laugwitz]]
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1992'''). ''Validating a Range of Endgame Programs''. [[ICGA Journal#15_3|ICCA Journal, Vol. 15, No. 3]] <ref>[[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], [https://en.wikipedia.org/wiki/Diplom Diplom] thesis (German)</ref>
+
* [[Wilhelm Barth]], [https://dl.acm.org/author_page.cfm?id=94258610163 Roger S. Martin], [https://en.wikipedia.org/wiki/James_H._Wilkinson James H. Wilkinson] ('''1967'''). ''[https://link.springer.com/article/10.1007%2FBF02162154 Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection]''. [https://en.wikipedia.org/wiki/Numerische_Mathematik Numerische Mathematik], Vol. 9, No. 5
* [[Wilhelm Barth]] ('''1994'''). ''Computerschach - Ein korrektes Programm für das Endspiel König und Bauer gegen König und Bauer - Unterteilung von Endspielen in Klassen - Behandlung der Stellungswiederholung bei der Intervallbewertung''. Institutsbericht Nr. 36, Institut für Computergraphik, TU Wien (German)
+
==1970 ...==
 +
* [[Wilhelm Barth]] ('''1971'''). ''[https://link.springer.com/article/10.1007/BF02234113 Nullstellenbestimmung mit der Intervallrechnung]''. [https://en.wikipedia.org/wiki/Computing_(journal) Computing], Vol. 8, No. 3-4 (German) <ref>[https://en.wikipedia.org/wiki/Root-finding_algorithm root-finding algorithms from Wikipedia]</ref>
 +
* [[Wilhelm Barth]] ('''1972'''). ''[https://link.springer.com/article/10.1007/BF02241606 Ein Algorithmus zur Berechnung aller reellen Nullstellen in einem Intervall]''. [https://en.wikipedia.org/wiki/Computing_(journal) Computing], Vol. 9, No. 2 (German)
 +
* [[Wilhelm Barth]], [https://dblp.uni-trier.de/pers/hd/n/Nuding:Erich Erich Nuding] ('''1974'''). ''[https://link.springer.com/article/10.1007/BF02260368 Optimale Lösung von Intervallgleichungssystemen]''. [https://en.wikipedia.org/wiki/Computing_(journal) Computing], Vol. 12, No. 2 (German)
 +
* [[Wilhelm Barth]] ('''1978'''). ''Unterhaltungsinformatik: Schachprobleme''. Institutsbericht Nr. 3, Institut für Informationssysteme, [[Vienna University of Technology|TU Wien]] (German)
 +
* [[Wilhelm Barth]] ('''1979'''). ''Alwin Walther - Praktische Mathematik und Computer an der THD''. [[Darmstadt University of Technology|Technische Hochschule Darmstadt]], Jahrbuch 1978/79 » [[Mathematician#Walther|Alwin Walther]]
 +
==1980 ...==
 +
* [[Wilhelm Barth]], [https://dblp.uni-trier.de/pers/hd/f/Fastenbauer:Michael Michael Fastenbauer] ('''1980'''). ''Hash-Hash-Tabellen''. Institutsbericht Nr. 8, Institut für Informationssysteme, [[Vienna University of Technology|TU Wien]] (German)
 +
* [[Wilhelm Barth]], [https://dblp.uni-trier.de/pers/hd/d/Dirnberger:Josef Josef Dirnberger], [[Mathematician#WPurgathofe|Werner Purgathofer]] ('''1982'''). ''[https://www.sciencedirect.com/science/article/abs/pii/0097849382900048 The high-level Graphics Programming Language PASCAL/Graph]''. [https://www.journals.elsevier.com/computers-and-graphics Computers & Graphics], Vol. 6, No. 3
 +
==1990 ...==
 +
* [[Wilhelm Barth]], [[Mathematician#WPurgathofe|Werner Purgathofer]], [https://dblp.uni-trier.de/pers/hd/r/Rainer:Th= Th. Rainer] ('''1990'''). ''Picture Files for Hierarchical Structured Pictures''. [https://www.journals.elsevier.com/computers-and-graphics Computers & Graphics], Vol. 14, No. 2
 +
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1991'''). ''Programme für korrekte Schachendspiele und deren Validierung''. Institutsbericht, Nr. 34. Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
 +
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [https://dblp.uni-trier.de/db/conf/ki/gwai91.html GWAI 1991]
 +
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1992'''). ''Validating a Range of Endgame Programs''. [[ICGA Journal#15_3|ICCA Journal, Vol. 15, No. 3]] <ref>[[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], Diplom thesis (German)</ref>
 +
* [[Wilhelm Barth]] ('''1994'''). ''Computerschach - Ein korrektes Programm für das Endspiel König und Bauer gegen König und Bauer - Unterteilung von Endspielen in Klassen - Behandlung der Stellungswiederholung bei der Intervallbewertung''. Institutsbericht Nr. 36, Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
 +
* [[Wilhelm Barth]], [[Mathematician#RLieger|Roland Lieger]], [[Mathematician#MSchindler|Michael Schindler]] ('''1994'''). ''[https://link.springer.com/article/10.1007%2FBF01900662 Ray tracing general parametric surfaces using interval arithmetic]''. [https://link.springer.com/journal/371 The Visual Computer], Vol. 10, No. 7
 +
==1995 ...==
 
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]] <ref>[[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]</ref>
 
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]] <ref>[[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]</ref>
 
* [[Wilhelm Barth]] ('''1995'''). ''The KPKP Endgame: An Amplification''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
 
* [[Wilhelm Barth]] ('''1995'''). ''The KPKP Endgame: An Amplification''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [http://www.informatik.uni-trier.de/~ley/db/conf/gosler/gosler1995.html#MehlsamKB95 GOSLER Final Report] 1995: 391-403
+
* [[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1995'''). ''Feature Construction during Tree Learning''. [https://dblp.uni-trier.de/db/conf/gosler/gosler1995.html GOSLER Final Report] 1995
 
* [[Heinz Herbeck]], [[Wilhelm Barth]] ('''1996'''). ''An Explanation Tool for Chess Endgames Based on the Rule Method''. [[ICGA Journal#19_2|ICCA Journal, Vol. 19, No. 2]]
 
* [[Heinz Herbeck]], [[Wilhelm Barth]] ('''1996'''). ''An Explanation Tool for Chess Endgames Based on the Rule Method''. [[ICGA Journal#19_2|ICCA Journal, Vol. 19, No. 2]]
 +
==2000 ...==
 +
* [https://www.vrvis.at/members/katja-buehler/ Katja Bühler], [[Wilhelm Barth]] ('''2001'''). ''[https://link.springer.com/chapter/10.1007/978-1-4757-6484-0_15 A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations]''. [https://link.springer.com/book/10.1007/978-1-4757-6484-0 Scientific Computing, Validated Numerics, Interval Methods]
 +
* [[Wilhelm Barth]], [[Mathematician#PMutzel|Petra Mutzel]], [[Mathematician#MJuenger|Michael Jünger]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/3-540-36151-0_13 Simple and Efficient Bilayer Cross Counting]''. [https://en.wikipedia.org/wiki/Journal_of_Graph_Algorithms_and_Applications Journal of Graph Algorithms and Applications], Vol. 8, No. 2, [http://jgaa.info/accepted/2004/BarthMutzelJuenger2004.8.2.pdf pdf]
 +
* [[Wilhelm Barth]], [[Mathematician#PMutzel|Petra Mutzel]], [https://dblp.uni-trier.de/pers/hd/y/Yildiz:Canan Canan Yildiz] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-70904-6_33 A New Approximation Algorithm for Bend Minimization in the Kandinsky Model]''. [https://link.springer.com/book/10.1007/978-3-540-70904-6 Graph Drawing]
  
 
=External Links=
 
=External Links=
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=21231 The Mathematics Genealogy Project - Wilhelm Barth]
+
* [https://www.cg.tuwien.ac.at/staff/WilhelmBarth.html Wilhelm Barth :: Institut für Computergraphik und Algorithmen - Arbeitsgruppe für Computergraphik]
* [http://www.ads.tuwien.ac.at/people/Barth.html Homepage of Wilhelm Barth] (no longer available)
+
* [https://web.archive.org/web/20130612033718/https://www.ads.tuwien.ac.at/people/Barth.html Homepage of Wilhelm Barth] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])
* [http://www.ads.tuwien.ac.at/ Arbeitsbereich für Algorithmen und Datenstrukturen] (German) (no longer available)
+
* [https://web.archive.org/web/20130612090002/https://www.ads.tuwien.ac.at/research/Chess.html Computer Chess site (Barth, Herbeck)] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])
 +
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=21231 The Mathematics Genealogy Project - Wilhelm Barth]
 
* [https://idw-online.de/de/news4179 Neues Schachprogramm für Spezialprobleme], October 28, 1996  (German)
 
* [https://idw-online.de/de/news4179 Neues Schachprogramm für Spezialprobleme], October 28, 1996  (German)
  
 
=References=  
 
=References=  
 
<references />
 
<references />
 
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 
[[Category:Researcher|Barth]]
 
[[Category:Researcher|Barth]]
 
[[Category:Chess Programmer|Barth]]
 
[[Category:Chess Programmer|Barth]]

Latest revision as of 19:54, 17 November 2019

Home * People * Wilhelm Barth

Wilhelm Barth [1]

Wilhelm P. Barth,
a German mathematician [2], computer scientist and Professor Emeritus at the Vienna University of Technology [3]. He defended his Ph.D. at Darmstadt University of Technology in 1963 on Graeffe's method under supervision of Alwin Walther and Detlef Laugwitz. His research interests include root-finding algorithms, geometric algorithms, graph theory, ray tracing, and computer chess [4].

Endspiel

Wilhelm Barth is author of the rule based Windows chess program and explanation tool Endspiel [5], which applies techniques as elaborated along with Heinz Herbeck in ICCA Journal. Endspiel applies an algorithms to gather information about the principal variation inside an iterative deepening alpha-beta framework, giving the user hints why a move was chosen and what happens after a series of moves [6].

Selected Publications

[7] [8]

1963 ...

1970 ...

1980 ...

1990 ...

1995 ...

2000 ...

External Links

References

Up one level