default search action
Jos W. H. M. Uiterwijk
Jos Uiterwijk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [c34]Jos W. H. M. Uiterwijk, Lianne V. Hufkens:
Solving Impartial SET Using Knowledge and Combinatorial Game Theory. CG 2022: 97-108 - 2021
- [j60]Jos Uiterwijk
:
Solving narrow Konane boards. J. Int. Comput. Games Assoc. 43(3): 162-183 (2021) - [c33]Jos W. H. M. Uiterwijk
Solving Bicoloring-Graph Games on Rectangular Boards - Part 1: Partisan Col and Snort. ACG 2021: 96-106 - [c32]Jos W. H. M. Uiterwijk
Solving Bicoloring-Graph Games on Rectangular Boards - Part 2: Impartial Col and Snort. ACG 2021: 107-117
2010 – 2019
- 2019
- [j59]Jos Uiterwijk, Richard J. Nowakowski:
Special Issue on Combinatorial Games. J. Int. Comput. Games Assoc. 41(3): 174-175 (2019) - [c31]Jos W. H. M. Uiterwijk
Solving Cram Using Combinatorial Game Theory. ACG 2019: 91-105 - [c30]Jos W. H. M. Uiterwijk
Solving Strong and Weak 4-in-a-Row. CoG 2019: 1-8 - 2018
- [j58]Jos W. H. M. Uiterwijk
Set Matching with applications: An enhancement of the Hales-Jewett pairing strategy. J. Int. Comput. Games Assoc. 40(3): 129-148 (2018) - [j57]Jos W. H. M. Uiterwijk
Construction and investigation of Cram endgame databases. J. Int. Comput. Games Assoc. 40(4): 425-437 (2018) - 2017
- [c29]Jos W. H. M. Uiterwijk
Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy. ACG 2017: 38-50 - [i3]Jos Uiterwijk:
Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy. CoRR abs/1703.10678 (2017) - 2016
- [j56]Jos W. H. M. Uiterwijk
Polymerization and crystallization of Snowflake molecules in Domineering. Theor. Comput. Sci. 644: 143-158 (2016) - [c28]Jos W. H. M. Uiterwijk
Combining Combinatorial Game Theory with an \alpha - \beta Solver for Clobber: Theory and Experiments. BNCAI 2016: 78-92 - [c27]Jos W. H. M. Uiterwijk
11 \times 11 Domineering Is Solved: The First Player Wins. Computers and Games 2016: 129-136 - [i2]Jos W. H. M. Uiterwijk:
11 x 11 Domineering is Solved: The first player wins. CoRR abs/1602.05404 (2016) - 2015
- [j55]Jos W. H. M. Uiterwijk
New results for Domineering from combinatorial game theory endgame databases. Theor. Comput. Sci. 592: 72-86 (2015) - [c26]Jos W. H. M. Uiterwijk
Crystallization of Domineering Snowflakes. ACG 2015: 100-112 - [i1]Jos W. H. M. Uiterwijk, Michael Barton:
New Results for Domineering from Combinatorial Game Theory Endgame Databases. CoRR abs/1506.03949 (2015) - 2014
- [j54]Jos W. H. M. Uiterwijk
The Impact of Safe Moves on Perfectly Solving Domineering Boards. J. Int. Comput. Games Assoc. 37(2): 97-105 (2014) - [j53]Jos W. H. M. Uiterwijk
The Impact of Safe Moves on Perfectly Solving Domineering Boards. J. Int. Comput. Games Assoc. 37(3): 144-160 (2014) - [j52]Jos W. H. M. Uiterwijk
The Impact of Safe Moves on Perfectly Solving Domineering Boards. J. Int. Comput. Games Assoc. 37(4): 207-213 (2014) - 2013
- [c25]Jos W. H. M. Uiterwijk
Perfectly Solving Domineering Boards. CGW@IJCAI 2013: 97-121 - 2012
- [j51]Maarten P. D. Schadd
Single-player Monte-Carlo tree search for SameGame. Knowl. Based Syst. 34: 3-11 (2012) - 2011
- [c24]Jan A. Stankiewicz, Mark H. M. Winands
Monte-Carlo Tree Search Enhancements for Havannah. ACG 2011: 60-71
2000 – 2009
- 2009
- [c23]Maarten P. D. Schadd
CHANCEPROBCUT: Forward pruning in chance nodes. CIG 2009: 178-185 - 2008
- [c22]Maarten P. D. Schadd
Single-Player Monte-Carlo Tree Search. Computers and Games 2008: 1-12 - 2007
- [j50]Maarten P. D. Schadd, Mark H. M. Winands, Maurice H. J. Bergsma, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Fanorona is a Draw. J. Int. Comput. Games Assoc. 30(1): 43-44 (2007) - 2006
- [c21]H. H. L. M. Donkers
Similarity Pruning in PrOM Search. ACG 2006: 57-72 - [c20]Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M. Uiterwijk
Monte-Carlo Proof-Number Search for Computer Go. Computers and Games 2006: 50-61 - 2005
- [j49]Erik C. D. van der Werf, Mark H. M. Winands
Learning to predict life and death from Go game records. Inf. Sci. 175(4): 258-272 (2005) - [j48]Mark H. M. Winands
Enhanced forward pruning. Inf. Sci. 175(4): 315-329 (2005) - [j47]Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to score final positions in the game of Go. Theor. Comput. Sci. 349(2): 168-183 (2005) - [j46]H. H. L. M. Donkers
Selecting evaluation functions in Opponent-Model search. Theor. Comput. Sci. 349(2): 245-267 (2005) - 2004
- [j45]Mark H. M. Winands
An effective two-level proof-number search algorithm. Theor. Comput. Sci. 313(3): 511-525 (2004) - [c19]Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Learning to Estimate Potential Territory in the Game of Go. Computers and Games 2004: 81-96 - [c18]H. H. L. M. Donkers
Dao: A Benchmark Game. Computers and Games 2004: 202-219 - [c17]Mark H. M. Winands
The Relative History Heuristic. Computers and Games 2004: 262-272 - [c16]Jeroen Donkers
Probabilistic Opponent-Model Search in Bao. ICEC 2004: 409-419 - 2003
- [j44]Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Solving Go on Small Boards. J. Int. Comput. Games Assoc. 26(2): 92-107 (2003) - [j43]Levente Kocsis, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Two Learning Algorithms for Forward Pruning. J. Int. Comput. Games Assoc. 26(3): 165-181 (2003) - [j42]H. H. L. M. Donkers
Admissibility in opponent-model search. Inf. Sci. 154(3-4): 119-140 (2003) - [j41]Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Jos W. H. M. Uiterwijk
Application of the killer-tree heuristic and the lambda-search method to lines of action. Inf. Sci. 154(3-4): 141-155 (2003) - [c15]Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Learning to Score Final Positions in the Game of Go. ACG 2003: 143-158 - [c14]Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
An Evaluation Function for Lines of Action. ACG 2003: 249-260 - [c13]H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Opponent-Model Search in Bao: Conditions for a Successful Application. ACG 2003: 309-324 - 2002
- [j40]H. Jaap van den Herik, Jos W. H. M. Uiterwijk
Games solved: Now and in the future. Artif. Intell. 134(1-2): 277-311 (2002) - [c12]Mark H. M. Winands, Jos W. H. M. Uiterwijk
PDS-PN: A New Proof-Number Search Algorithm. Computers and Games 2002: 61-74 - [c11]Levente Kocsis, Jos W. H. M. Uiterwijk
The Neural MoveMap Heuristic in Chess. Computers and Games 2002: 154-170 - [c10]Erik C. D. van der Werf, Jos W. H. M. Uiterwijk
Local Move Prediction in Go. Computers and Games 2002: 393-412 - [c9]Erik C. D. van der Werf, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Solving Ponnuki-Go on Small Boards. GAME-ON 2002 - [c8]Mark H. M. Winands, Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Learning in Lines of Action. GAME-ON 2002 - [c7]Jeroen Donkers, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Admissibility in Opponent-Model Search. JCIS 2002: 450-453 - 2001
- [j39]Masahiro Seo, Hiroyuki Iida
The PN*-search algorithm: Application to tsume-shogi. Artif. Intell. 129(1-2): 253-277 (2001) - [j38]Mark H. M. Winands, Jos W. H. M. Uiterwijk
The Quad Heuristic in Lines of Action. J. Int. Comput. Games Assoc. 24(1): 3-15 (2001) - [j37]H. H. L. M. Donkers
Probabilistic opponent-model search. Inf. Sci. 135(3-4): 123-149 (2001) - [j36]Xinbo Gao, Hiroyuki Iida
Strategies anticipating a difference in search depth using opponent-model search. Theor. Comput. Sci. 252(1-2): 83-104 (2001) - [j35]Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
A solution to the GHI problem for best-first search. Theor. Comput. Sci. 252(1-2): 121-149 (2001) - [c6]Levente Kocsis, Jos W. H. M. Uiterwijk
Move Ordering Using Neural Networks. IEA/AIE 2001: 45-50 - 2000
- [j34]Jos W. H. M. Uiterwijk:
Tablebase of Contents, continued. J. Int. Comput. Games Assoc. 23(1): 60 (2000) - [j33]Jos W. H. M. Uiterwijk:
Computer-Games Workshop London, August 22-24, 2000. J. Int. Comput. Games Assoc. 23(2): 125 (2000) - [j32]Geoffrey Irving, Jeroen Donkers
Solving Kalah. J. Int. Comput. Games Assoc. 23(3): 139-147 (2000) - [j31]Patrick Hensgens, Jos Uiterwijk
8qp Wins Amazons Tournament. J. Int. Comput. Games Assoc. 23(3): 179-181 (2000) - [j30]Jos Uiterwijk
Report on the Computer-Games Workshop. J. Int. Comput. Games Assoc. 23(3): 186-187 (2000) - [j29]Jan van Reek, Jos W. H. M. Uiterwijk
The Innovated Art of Chess Analysis. J. Int. Comput. Games Assoc. 23(4): 230-232 (2000) - [j28]Jos W. H. M. Uiterwijk
The Advantage of the Initiative. Inf. Sci. 122(1): 43-58 (2000) - [j27]Dennis M. Breuker, Jos W. H. M. Uiterwijk
Solving 8×8 Domineering. Theor. Comput. Sci. 230(1-2): 195-206 (2000) - [c5]Levente Kocsis, Jos W. H. M. Uiterwijk
Learning Time Allocation Using Neural Networks. Computers and Games 2000: 170-185
1990 – 1999
- 1999
- [j26]Jos W. H. M. Uiterwijk:
Tablebase of Contents. J. Int. Comput. Games Assoc. 22(1): 59-60 (1999) - [j25]Jan van Reek, Jos W. H. M. Uiterwijk
Two Strategic Shortcomings in Chess Programs. J. Int. Comput. Games Assoc. 22(4): 239-240 (1999) - 1998
- [j24]Jan van Reek, Jos W. H. M. Uiterwijk
Planning a Strategy in Chess. J. Int. Comput. Games Assoc. 21(3): 183-192 (1998) - [j23]Jos Uiterwijk
Report on the Session Heuristic Search and Computer Game Playing. J. Int. Comput. Games Assoc. 21(4): 254-255 (1998) - [c4]Dennis M. Breuker, H. Jaap van den Herik, Jos W. H. M. Uiterwijk
A Solution to the GHI Problem for Best-First Search. Computers and Games 1998: 25-49 - [c3]Xinbo Gao, Hiroyuki Iida
A Speculative Strategy. Computers and Games 1998: 74-92 - [c2]Hiroyuki Iida
Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi. Computers and Games 1998: 318-335 - 1996
- [j22]Jos W. H. M. Uiterwijk
The Kasparov - Deep Blue Match. J. Int. Comput. Games Assoc. 19(1): 38-41 (1996) - [j21]Jos W. H. M. Uiterwijk
Recent Advances in Computer Chess Workshop The 1996 ACM Computer Science Conference. J. Int. Comput. Games Assoc. 19(2): 120-121 (1996) - [j20]Dennis M. Breuker, Jos W. H. M. Uiterwijk
Replacement Schemes and Two-Level Tables. J. Int. Comput. Games Assoc. 19(3): 175-180 (1996) - [c1]Hitoshi Matsubara, Hiroyuki Iida, Jos W. H. M. Uiterwijk
A Shogi-Computer Test Set. ACM Conference on Computer Science 1996: 139-146 - 1995
- [j19]Hiroyuki Iida, Ken'ichi Handa, Jos Uiterwijk
Tutoring Strategies in Game-Tree Search. J. Int. Comput. Games Assoc. 18(4): 191-204 (1995) - [j18]Jos W. H. M. Uiterwijk, Hiroyuki Iida:
H. Matsubara (ed.): Proceedings of the Game Programming Workshop in Japan '95. J. Int. Comput. Games Assoc. 18(4): 227-229 (1995) - [j17]Jos Uiterwijk:
Tablebase of Contents, Continued. J. Int. Comput. Games Assoc. 18(4): 253-254 (1995) - 1994
- [j16]Hiroyuki Iida, Jos W. H. M. Uiterwijk
Potential Applications of Opponent-Model Search. J. Int. Comput. Games Assoc. 17(1): 10-14 (1994) - [j15]Martin Schijf, L. Victor Allis, Jos W. H. M. Uiterwijk
Proof-Number Search and Transpositions. J. Int. Comput. Games Assoc. 17(2): 63-74 (1994) - [j14]Martin Schijf, L. Victor Allis, Jos W. H. M. Uiterwijk
Missing a Won Variation. J. Int. Comput. Games Assoc. 17(3): 179 (1994) - [j13]Dennis M. Breuker, Jos W. H. M. Uiterwijk
Replacement Schemes for Transposition Tables. J. Int. Comput. Games Assoc. 17(4): 183-193 (1994) - 1993
- [j12]Hiroyuki Iida, Jos W. H. M. Uiterwijk
Potential Applications of Opponent-Model Search. J. Int. Comput. Games Assoc. 16(4): 201-208 (1993) - [j11]Jos Uiterwijk:
Tablebase of Contents, Continued. J. Int. Comput. Games Assoc. 16(4): 249-250 (1993) - 1992
- [j10]Jos W. H. M. Uiterwijk
The Countermove Heuristic. J. Int. Comput. Games Assoc. 15(1): 8-15 (1992) - [j9]Jos W. H. M. Uiterwijk
Memory Efficiency in Some Heuristics. J. Int. Comput. Games Assoc. 15(2): 67-74 (1992) - [j8]Jos Uiterwijk
The AST 4th Conference on Computer Games. J. Int. Comput. Games Assoc. 15(3): 158-161 (1992) - [j7]Dennis M. Breuker, Jos W. H. M. Uiterwijk
The 12th Dutch Computer-Chess Championship. J. Int. Comput. Games Assoc. 15(4): 239-241 (1992) - 1991
- [j6]Jos W. H. M. Uiterwijk:
Reviews. J. Int. Comput. Games Assoc. 14(3): 143-146 (1991) - [j5]Jos Uiterwijk
Chess Results and Games of the 3Rd Computer Olympiad. J. Int. Comput. Games Assoc. 14(3): 165-167 (1991) - [j4]Jos Uiterwijk:
Tablebase of Contents Continued. J. Int. Comput. Games Assoc. 14(4): 238-239 (1991)
1980 – 1989
- 1989
- [j3]Jos Uiterwijk:
Reviews. J. Int. Comput. Games Assoc. 12(3): 170-171 (1989) - [j2]Jos Uiterwijk:
Tablebase of Contents of the ICCA Journal. J. Int. Comput. Games Assoc. 12(4): 255-259 (1989) - 1988
- [j1]Jos Uiterwijk:
Reviews. J. Int. Comput. Games Assoc. 11(4): 161-162 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: