Difference between revisions of "Jos Uiterwijk"

From Chessprogramming wiki
Jump to: navigation, search
Line 99: Line 99:
 
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2002''').  ''Application of the killer-tree heuristic and the lambda-search method to lines of action''. <ref>[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-47VH35R-3&_user=10&_coverDate=09%2F30%2F2003&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1552460904&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=1d9bce14fd47b45fbf1ebabd9e791404&searchtype=a ScienceDirect - Information Sciences : Application of the killer-tree heuristic and the lambda-search method to lines of action]</ref>
 
* [[Makoto Sakuta]], [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2002''').  ''Application of the killer-tree heuristic and the lambda-search method to lines of action''. <ref>[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-47VH35R-3&_user=10&_coverDate=09%2F30%2F2003&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1552460904&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=1d9bce14fd47b45fbf1ebabd9e791404&searchtype=a ScienceDirect - Information Sciences : Application of the killer-tree heuristic and the lambda-search method to lines of action]</ref>
 
'''2003'''
 
'''2003'''
* [[Jan van Reek]], [[Jos Uiterwijk]] ('''2003'''). ''The Match Bareev vs. Hiarcs X''. [[ICGA Journal#26_1|ICGA Journal, Vol. 26, No. 1]] » [[Bareev versus Hiarcs 2003]]
+
* [[Jan van Reek]], [[Jos Uiterwijk]] ('''2003'''). ''The Match Bareev vs. Hiarcs X''. [[ICGA Journal#26_1|ICGA Journal, Vol. 26, No. 1]] » [[Bareev versus HIARCS 2003]]
 
* [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Makoto Sakuta]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2003'''). ''Automatic realization-probability search.'' Internal report, Dept. of Computer Sciences, [https://en.wikipedia.org/wiki/Shizuoka_University University of Shizuoka], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu], Japan.
 
* [[Tsuyoshi Hashimoto]], [[Jun Nagashima]], [[Makoto Sakuta]], [[Jos Uiterwijk]], [[Hiroyuki Iida]] ('''2003'''). ''Automatic realization-probability search.'' Internal report, Dept. of Computer Sciences, [https://en.wikipedia.org/wiki/Shizuoka_University University of Shizuoka], [https://en.wikipedia.org/wiki/Hamamatsu,_Shizuoka Hamamatsu], Japan.
 
* [[Jeroen Donkers]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2003'''). ''Admissibility in Opponent-Model Search''. IS Journal, in press.
 
* [[Jeroen Donkers]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2003'''). ''Admissibility in Opponent-Model Search''. IS Journal, in press.

Revision as of 18:23, 27 September 2019

Home * People * Jos Uiterwijk

Jos Uiterwijk [1]

Jos Uiterwijk,
a Dutch chemist, computer games scientist, associate professor and coordinator of the computer games research group at Maastricht University [2], chess player and chair of MSV-VSM chess-club in Maastricht [3]. He holds a Ph.D. in physical chemistry in 1985, and a M.Sc. in artificial intelligence in 1988, both from University of Twente. Jos is author of the chess program Touch, co-author of the Connect Four program Victor and the Gomoku program Polygon, all competing at ICGA Tournaments [4]. In 1992, Jos introduced the Countermove Heuristic [5] and published a huge number of scientific papers on games and search topics.

Max Euwe

Jos Uiterwijk talk on Max Euwe, Euwe and the Development of Computer Chess, November 16, 2011 [6] [7] [8]:

Uiterwijk returned to the fifties of the previous century when the pioneers of Artificial Intelligence, like Turing and Shannon, published their first speculations on how a computer could play chess. He showed how in less than fifty years the computer has turned into a chess monster, beating the world champion in 1997. Present day chess computers have an ELO rating ranking above 3000, a strength of which chess players of flesh and blood can only dream. Max Euwe was very sceptical about how strong chess computers could become. He was very much interested in the development of computer chess, especially in the underlying mathematical principles. Euwe was involved in the foundation of the Computer Chess Federation of The Netherlands. He challenged researchers to prove him wrong and thus stimulated computer chess studies. 

Selected Publications

[9] [10]

1985 ...

1990 ...

1995 ...

2000 ...

Patrick Hensgens, Jos Uiterwijk (2000). A Knowledge-Based Approach of Amazons. 5th Computer Olympiad Workshop
Geoffrey Irving, Jeroen Donkers, Jos Uiterwijk (2000). Solving Kalah. 5th Computer Olympiad Workshop » Solving Kalah [11]
Mark Winands, Jos Uiterwijk (2000). Analysis and Implementation of Lines of Action. 5th Computer Olympiad Workshop, pdf

2001

Levente Kocsis, Jos Uiterwijk (2001). Learning Move Ordering in Chess. 6th Computer Olympiad Workshop [12]
Mark Winands, Jos Uiterwijk (2001). PN, PN2 and PN* in Lines of Action. 6th Computer Olympiad Workshop, pdf

2002

Mark Winands, Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2002). Learning in Lines of Action. 7th Computer Olympiad Workshop [13] [14]
Jeroen Donkers, Jos Uiterwijk (2002). Programming Bao. 7th Computer Olympiad Workshop, pdf » Bao

2003

2004

2005 ...

2006

2007

François van Lishout, Guillaume Chaslot, Jos Uiterwijk (2007). Monte-Carlo Tree Search in Backgammon. CGW 2007
Jahn-Takeshi Saito, Mark Winands, Jos Uiterwijk, Jaap van den Herik (2007). Grouping Nodes for Monte-Carlo Tree Search. CGW 2007, pdf

2008

2009

2010 ...

2015 ...

External Links

References

Up one level