default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark H. M. Winands
Person information
- affiliation: Maastricht University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Mark H. M. Winands:
Editorial: Follow-ups. J. Int. Comput. Games Assoc. 46(1): 1 (2024)- [c60]Tom Pepels
, Mark H. M. Winands:
Ancestor-Based α-β Bounds for Monte-Carlo Tree Search. CoG 2024: 1-4 - [c59]Dennis J. N. J. Soemers, Guillaume Bams, Max Persoon, Marco Rietjens, Dimitar Sladic, Stefan Stefanov, Kurt Driessens, Mark H. M. Winands:
Towards a Characterisation of Monte-Carlo Tree Search Performance in Different Games. CoG 2024: 1-4 - [c58]Erik Boom, Matús Mihalák, Frank Thuijsman, Mark H. M. Winands:
Scheduling Single AGV in Blocking Flow-Shop with Identical Jobs. ICORES 2024: 325-332 - [i11]Dennis J. N. J. Soemers, Guillaume Bams, Max Persoon, Marco Rietjens, Dimitar Sladic, Stefan Stefanov, Kurt Driessens, Mark H. M. Winands:
Towards a Characterisation of Monte-Carlo Tree Search Performance in Different Games. CoRR abs/2406.09242 (2024) - [i10]Dennis J. N. J. Soemers, Chiara F. Sironi, Torsten Schuster, Mark H. M. Winands:
Enhancements for Real-Time Monte-Carlo Tree Search in General Video Game Playing. CoRR abs/2407.03049 (2024) - 2023
- [j48]Tristan Cazenave, Mark H. M. Winands:
Editorial: Rankings and ratings. J. Int. Comput. Games Assoc. 45(1): 1 (2023) - [j47]Mark H. M. Winands:
Editorial: Looking back, looking forward. J. Int. Comput. Games Assoc. 45(2-3): 31 (2023) - [j46]Mark H. M. Winands:
Editorial: Many quests. J. Int. Comput. Games Assoc. 45(4): 91 (2023) - [c57]Chiara F. Sironi, Anna Wilbik, Mark H. M. Winands:
Explainable Search: An Exploratory Study in SameGame. CoG 2023: 1-4 - [c56]Carla Wrede, Mark H. M. Winands, Evgueni N. Smirnov, Anna Wilbik:
Towards Explainable Linguistic Summaries. FUZZ 2023: 1-6 - [i9]Elliot Doe, Mark H. M. Winands, Jakub Kowalski, Dennis J. N. J. Soemers, Daniel Górski, Cameron Browne:
Proof Number Based Monte-Carlo Tree Search. CoRR abs/2303.09449 (2023) - 2022
- [j45]Leonardo Rossi, Mark H. M. Winands, Christoph Butenweg:
Monte Carlo Tree Search as an intelligent search tool in structural design problems. Eng. Comput. 38(4): 3219-3236 (2022) - [c55]Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands:
Split Moves for Monte-Carlo Tree Search. AAAI 2022: 10247-10255 - [c54]Elliot Doe, Mark H. M. Winands, Dennis J. N. J. Soemers, Cameron Browne:
Combining Monte-Carlo Tree Search with Proof-Number Search. CoG 2022: 206-212 - [i8]Elliot Doe, Mark H. M. Winands, Dennis J. N. J. Soemers, Cameron Browne:
Combining Monte-Carlo Tree Search with Proof-Number Search. CoRR abs/2206.03965 (2022) - [i7]Florian Wimmenauer, Matús Mihalák, Mark H. M. Winands:
Monte-Carlo Tree-Search for Leveraging Performance of Blackbox Job-Shop Scheduling Heuristics. CoRR abs/2212.07543 (2022) - 2021
- [j44]H. Jaap van den Herik, Mark H. M. Winands:
A tribute to Guy Haworth. J. Int. Comput. Games Assoc. 43(2): 114-117 (2021) - [j43]Chiara F. Sironi, Mark H. M. Winands:
Analysis of the Impact of Randomization of Search-Control Parameters in Monte-Carlo Tree Search. J. Artif. Intell. Res. 72: 717-757 (2021) - [c53]Dominik Jeurissen, Mark H. M. Winands, Chiara F. Sironi, Diego Pérez-Liébana:
Automatic Goal Discovery in Subgoal Monte Carlo Tree Search. CoG 2021: 1-4 - [c52]Chiara F. Sironi, Mark H. M. Winands:
Adaptive General Search Framework for Games and Beyond. CoG 2021: 1-8 - [i6]Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands:
Split Moves for Monte-Carlo Tree Search. CoRR abs/2112.07761 (2021) - 2020
- [j42]Mark H. M. Winands:
Editorial: Stay the course. J. Int. Comput. Games Assoc. 42(1): 1 (2020) - [j41]Mark H. M. Winands:
Editorial: Commemorating computer chess. J. Int. Comput. Games Assoc. 42(2-3): 69 (2020) - [j40]Mark H. M. Winands:
Editorial: Many games, many authors. J. Int. Comput. Games Assoc. 42(4): 243 (2020) - [j39]Mark H. M. Winands:
2018 IEEE Conference on Computational Intelligence and Games (CIG 2018). Künstliche Intell. 34(1): 117-118 (2020) - [j38]Chiara F. Sironi, Jialin Liu, Mark H. M. Winands:
Self-Adaptive Monte Carlo Tree Search in General Game Playing. IEEE Trans. Games 12(2): 132-144 (2020) - [c51]Raluca D. Gaina, Diego Perez Liebana, Simon M. Lucas, Chiara F. Sironi, Mark H. M. Winands:
Self-Adaptive Rolling Horizon Evolutionary Algorithms for General Video Game Playing. CoG 2020: 367-374 - [c50]Éric Piette, Dennis J. N. J. Soemers, Matthew Stephenson, Chiara F. Sironi, Mark H. M. Winands, Cameron Browne:
Ludii - The Ludemic General Game System. ECAI 2020: 411-418 - [i5]Cliff Laschet, Jorn op den Buijs, Mark H. M. Winands, Steffen Pauws:
Service Selection using Predictive Models and Monte-Carlo Tree Search. CoRR abs/2002.04852 (2020)
2010 – 2019
- 2019
- [j37]Mark H. M. Winands:
Editorial. J. Int. Comput. Games Assoc. 41(1): 1 (2019) - [j36]Mark H. M. Winands:
Advances in Computer and Games Conference (ACG2019). J. Int. Comput. Games Assoc. 41(1): 61 (2019) - [j35]Cameron Browne, Antonios Liapis, Mark H. M. Winands:
Special Issue on Computer Aided Game and Puzzle Design. J. Int. Comput. Games Assoc. 41(1): 62-63 (2019) - [j34]Mark H. M. Winands:
Editorial: Research trends. J. Int. Comput. Games Assoc. 41(2): 65 (2019) - [j33]Mark H. M. Winands:
Editorial: Get serious. J. Int. Comput. Games Assoc. 41(3): 115 (2019) - [j32]Mark H. M. Winands:
Editorial: Back to the roots. J. Int. Comput. Games Assoc. 41(4): 179 (2019) - [c49]Olve Drageset, Mark H. M. Winands, Raluca D. Gaina, Diego Perez Liebana:
Optimising Level Generators for General Video Game AI. CoG 2019: 1-8 - [c48]Chiara F. Sironi, Mark H. M. Winands:
Comparing Randomization Strategies for Search-Control Parameters in Monte-Carlo Tree Search. CoG 2019: 1-8 - [r1]Mark H. M. Winands:
Monte-Carlo Tree Search. Encyclopedia of Computer Graphics and Games 2019 - [i4]Éric Piette, Dennis J. N. J. Soemers, Matthew Stephenson, Chiara F. Sironi, Mark H. M. Winands, Cameron Browne:
Ludii - The Ludemic General Game System. CoRR abs/1905.05013 (2019) - [i3]Cameron Browne, Dennis J. N. J. Soemers, Éric Piette, Matthew Stephenson, Michael Conrad, Walter Crist, Thierry Depaulis, Eddie Duggan, Fred Horn, Steven Kelk, Simon M. Lucas, João Pedro Neto, David Parlett, Abdallah Saffidine, Ulrich Schädler, Jorge Nuno Silva, Alex de Voogt, Mark H. M. Winands:
Foundations of Digital Archæoludology. CoRR abs/1905.13516 (2019) - 2018
- [j31]Hendrik Baier, Mark H. M. Winands:
MCTS-Minimax Hybrids with State Evaluations. J. Artif. Intell. Res. 62: 193-231 (2018) - [j30]Raluca D. Gaina, Adrien Couëtoux, Dennis J. N. J. Soemers, Mark H. M. Winands, Tom Vodopivec, Florian Kirchgeßner, Jialin Liu, Simon M. Lucas, Diego Pérez-Liébana:
The 2016 Two-Player GVGAI Competition. IEEE Trans. Games 10(2): 209-220 (2018) - [c47]Dennis J. N. J. Soemers, Tim Brys, Kurt Driessens, Mark H. M. Winands, Ann Nowé:
Adapting to Concept Drift in Credit Card Transaction Data Streams Using Contextual Bandits and Decision Trees. AAAI 2018: 7831-7836 - [c46]Cezary Siwek, Jakub Kowalski, Chiara F. Sironi, Mark H. M. Winands:
Implementing Propositional Networks on FPGA. Australasian Conference on Artificial Intelligence 2018: 133-145 - [c45]Martin L. M. Rooijackers, Mark H. M. Winands:
Wall Building in the Game of StarCraft with Terrain Considerations. CIG 2018: 1-5 - [c44]Chiara F. Sironi, Mark H. M. Winands:
Analysis of Self-Adaptive Monte Carlo Tree Search in General Video Game Playing. CIG 2018: 1-4 - [c43]Chiara F. Sironi, Jialin Liu, Diego Perez Liebana, Raluca D. Gaina, Ivan Bravi, Simon M. Lucas, Mark H. M. Winands:
Self-adaptive MCTS for General Video Game Playing. EvoApplications 2018: 358-375 - [c42]Hendrik Baier, Mark H. M. Winands:
MCTS-Minimax Hybrids with State Evaluations (Extended Abstract). IJCAI 2018: 5548-5552 - [e7]Tristan Cazenave, Mark H. M. Winands, Abdallah Saffidine:
Computer Games - 6th Workshop, CGW 2017, Held in Conjunction with the 26th International Conference on Artificial Intelligence, IJCAI 2017, Melbourne, VIC, Australia, August, 20, 2017, Revised Selected Papers. Communications in Computer and Information Science 818, Springer 2018, ISBN 978-3-319-75930-2 [contents] - 2017
- [j29]Mark H. M. Winands, Tristan Cazenave:
IJCAI Computer Games Workshop 2015. J. Int. Comput. Games Assoc. 39(1): 69-71 (2017) - [j28]Mark H. M. Winands, Richard Lorentz, Matej Guid:
Advances in Computer Games 2017. J. Int. Comput. Games Assoc. 39(3-4): 205-209 (2017) - [c41]Martin L. M. Rooijackers, Mark H. M. Winands:
Resource-gathering algorithms in the game of starcraft. CIG 2017: 264-271 - [c40]Chiara F. Sironi, Mark H. M. Winands:
On-Line Parameter Tuning for Monte-Carlo Tree Search in General Game Playing. CGW@IJCAI 2017: 75-95 - [e6]Mark H. M. Winands, H. Jaap van den Herik, Walter A. Kosters:
Advances in Computer Games - 15th International Conferences, ACG 2017, Leiden, The Netherlands, July 3-5, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10664, Springer 2017, ISBN 978-3-319-71648-0 [contents] - [e5]Tristan Cazenave, Mark H. M. Winands, Stefan Edelkamp, Stephan Schiffel, Michael Thielscher, Julian Togelius:
Computer Games - 5th Workshop on Computer Games, CGW 2016, and 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, Held in Conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016, New York City, NY, USA, July 9-10, 2016, Revised Selected Papers. Communications in Computer and Information Science 705, 2017, ISBN 978-3-319-57968-9 [contents] - 2016
- [j27]Branislav Bosanský, Viliam Lisý, Marc Lanctot, Jirí Cermák, Mark H. M. Winands:
Algorithms for computing strategies in two-player simultaneous move games. Artif. Intell. 237: 1-40 (2016) - [j26]Jochen Renz, Risto Miikkulainen, Nathan R. Sturtevant, Mark H. M. Winands:
Guest Editorial: Physics-Based Simulation Games. IEEE Trans. Comput. Intell. AI Games 8(2): 101-103 (2016) - [j25]Hendrik Baier, Mark H. M. Winands:
Time Management for Monte Carlo Tree Search. IEEE Trans. Comput. Intell. AI Games 8(3): 301-314 (2016) - [c39]Chiara F. Sironi, Mark H. M. Winands:
Comparison of rapid action value estimation variants for general game playing. CIG 2016: 1-8 - [c38]Dennis J. N. J. Soemers, Chiara F. Sironi, Torsten Schuster, Mark H. M. Winands:
Enhancements for real-time Monte-Carlo Tree Search in General Video Game Playing. CIG 2016: 1-8 - [c37]Dennis J. N. J. Soemers, Mark H. M. Winands:
Hierarchical Task Network Plan Reuse for video games. CIG 2016: 1-8 - [c36]Chiara F. Sironi, Mark H. M. Winands:
Optimizing Propositional Networks. CGW@IJCAI 2016: 133-151 - [e4]Tristan Cazenave, Mark H. M. Winands, Stefan Edelkamp, Stephan Schiffel, Michael Thielscher, Julian Togelius:
Computer Games - Fourth Workshop on Computer Games, CGW 2015, and the Fourth Workshop on General Intelligence in Game-Playing Agents, GIGA 2015, Held in Conjunction with the 24th International Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 26-27, 2015, Revised Selected Papers. Communications in Computer and Information Science 614, Springer 2016, ISBN 978-3-319-39401-5 [contents] - 2015
- [j24]Hendrik Baier, Mark H. M. Winands:
MCTS-Minimax Hybrids. IEEE Trans. Comput. Intell. AI Games 7(2): 167-179 (2015) - [c35]Tom Pepels, Tristan Cazenave, Mark H. M. Winands:
Sequential Halving for Partially Observable Games. CGW/GIGA@IJCAI 2015: 16-29 - [c34]Mark H. M. Winands:
The Surakarta Bot Revealed. CGW/GIGA@IJCAI 2015: 71-82 - 2014
- [j23]Mark H. M. Winands, Tristan Cazenave:
ECAI Computer Games Workshop 2014. J. Int. Comput. Games Assoc. 37(4): 230-231 (2014) - [j22]Tom Pepels, Mark H. M. Winands, Marc Lanctot:
Real-Time Monte Carlo Tree Search in Ms Pac-Man. IEEE Trans. Comput. Intell. AI Games 6(3): 245-257 (2014) - [j21]Mandy J. W. Tak, Mark H. M. Winands, Yngvi Björnsson:
Decaying Simulation Strategies. IEEE Trans. Comput. Intell. AI Games 6(4): 395-406 (2014) - [c33]Marc Lanctot, Mark H. M. Winands, Tom Pepels, Nathan R. Sturtevant:
Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups. CIG 2014: 1-8 - [c32]Mandy J. W. Tak, Marc Lanctot, Mark H. M. Winands:
Monte Carlo Tree Search variants for simultaneous move games. CIG 2014: 1-8 - [c31]Tom Pepels, Tristan Cazenave, Mark H. M. Winands, Marc Lanctot:
Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search. CGW@ECAI 2014: 1-15 - [c30]Hendrik Baier, Mark H. M. Winands:
Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions. CGW@ECAI 2014: 45-63 - [c29]Tom Pepels, Mandy J. W. Tak, Marc Lanctot, Mark H. M. Winands:
Quality-based Rewards for Monte-Carlo Tree Search Simulations. ECAI 2014: 705-710 - [e3]Tristan Cazenave, Mark H. M. Winands, Yngvi Björnsson:
Computer Games - Third Workshop on Computer Games, CGW 2014, Held in Conjunction with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18, 2014, Revised Selected Papers. Communications in Computer and Information Science 504, Springer 2014, ISBN 978-3-319-14922-6 [contents] - [e2]Tristan Cazenave, Mark H. M. Winands, Hiroyuki Iida:
Computer Games - Workshop on Computer Games, CGW 2013, Held in Conjunction with the 23rd International Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, August 3, 2013, Revised Selected Papers. Communications in Computer and Information Science 408, Springer 2014, ISBN 978-3-319-05427-8 [contents] - [i2]Marc Lanctot, Mark H. M. Winands, Tom Pepels, Nathan R. Sturtevant:
Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups. CoRR abs/1406.0486 (2014) - 2013
- [j20]J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Search Policies in Multi-Player Games. J. Int. Comput. Games Assoc. 36(1): 3-21 (2013) - [j19]Mark H. M. Winands, Tristan Cazenave:
Computer Games Workshop at IJCAI 2013. J. Int. Comput. Games Assoc. 36(3): 189-190 (2013) - [j18]Marc Lanctot, Mark H. M. Winands:
LOA Wins Lines of Action Tournament. J. Int. Comput. Games Assoc. 36(4): 239-240 (2013) - [j17]Marc Lanctot, Mark H. M. Winands:
SIA Wins Surakarta Tournament. J. Int. Comput. Games Assoc. 36(4): 241 (2013) - [c28]Markus Esser, Michael Gras, Mark H. M. Winands, Maarten P. D. Schadd, Marc Lanctot:
Improving Best-Reply Search. Computers and Games 2013: 125-137 - [c27]Hendrik Baier, Mark H. M. Winands:
Monte-Carlo Tree Search and minimax hybrids. CIG 2013: 1-8 - [c26]Marc Lanctot, Viliam Lisý, Mark H. M. Winands:
Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel. CGW@IJCAI 2013: 28-43 - [c25]Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, Mark H. M. Winands:
Monte Carlo *-Minimax Search. IJCAI 2013: 580-586 - [i1]Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, Mark H. M. Winands:
Monte Carlo *-Minimax Search. CoRR abs/1304.6057 (2013) - 2012
- [j16]Mark H. M. Winands, Yngvi Björnsson, Karl Tuyls:
Preface for the special issue on Games and AI. Entertain. Comput. 3(3): 49-50 (2012) - [j15]Akihiro Kishimoto, Mark H. M. Winands, Martin Müller, Jahn-Takeshi Saito:
Game-Tree Search Using Proof Numbers: The First Twenty Years. J. Int. Comput. Games Assoc. 35(3): 131-156 (2012) - [j14]Mark H. M. Winands, Tristan Cazenave:
Computer Games Workshop at ECAI 2012. J. Int. Comput. Games Assoc. 35(3): 188-189 (2012) - [j13]Maarten P. D. Schadd, Mark H. M. Winands, Mandy J. W. Tak, Jos W. H. M. Uiterwijk:
Single-player Monte-Carlo tree search for SameGame. Knowl. Based Syst. 34: 3-11 (2012) - [j12]Mandy J. W. Tak, Mark H. M. Winands, Yngvi Björnsson:
N-Grams and the Last-Good-Reply Policy Applied in General Game Playing. IEEE Trans. Comput. Intell. AI Games 4(2): 73-83 (2012) - [j11]J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Monte Carlo Tree Search for the Hide-and-Seek Game Scotland Yard. IEEE Trans. Comput. Intell. AI Games 4(4): 282-294 (2012) - [c24]Hendrik Baier, Mark H. M. Winands:
Beam Monte-Carlo Tree Search. CIG 2012: 227-233 - [c23]Tom Pepels, Mark H. M. Winands:
Enhancements for Monte-Carlo Tree Search in Ms Pac-Man. CIG 2012: 265-272 - [c22]Hendrik Baier, Mark H. M. Winands:
Nested Monte-Carlo Tree Search for Online Planning in Large MDPs. ECAI 2012: 109-114 - 2011
- [j10]Maarten P. D. Schadd, Mark H. M. Winands:
Best Reply Search for Multiplayer Games. IEEE Trans. Comput. Intell. AI Games 3(1): 57-66 (2011) - [c21]Hendrik Baier, Mark H. M. Winands:
Time Management for Monte-Carlo Tree Search in Go. ACG 2011: 39-51 - [c20]Jan A. Stankiewicz, Mark H. M. Winands, Jos W. H. M. Uiterwijk:
Monte-Carlo Tree Search Enhancements for Havannah. ACG 2011: 60-71 - [c19]J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Playout Search for Monte-Carlo Tree Search in Multi-player Games. ACG 2011: 72-83 - [c18]Mark H. M. Winands, Yngvi Björnsson:
αβ-based play-outs in Monte-Carlo Tree Search. CIG 2011: 110-117 - [c17]J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Monte-Carlo Tree Search for the game of Scotland Yard. CIG 2011: 158-165 - 2010
- [j9]Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito:
Monte Carlo Tree Search in Lines of Action. IEEE Trans. Comput. Intell. AI Games 2(4): 239-250 (2010) - [c16]Mark H. M. Winands, Maarten P. D. Schadd:
Evaluation-Function Based Proof-Number Search. Computers and Games 2010: 23-35 - [c15]J. (Pim) A. M. Nijssen, Mark H. M. Winands:
Enhancements for Multi-Player Monte-Carlo Tree Search. Computers and Games 2010: 238-249 - [c14]David Lupien St-Pierre, Mark H. M. Winands, David A. Watt:
A selective move generator for the game axis and allies. CIG 2010: 162-169 - [c13]Jahn-Takeshi Saito, Mark H. M. Winands:
Paranoid Proof-Number Search. CIG 2010: 203-210
2000 – 2009
- 2009
- [j8]Erik C. D. van der Werf, Mark H. M. Winands:
Solving Go for Rectangular Boards. J. Int. Comput. Games Assoc. 32(2): 77-88 (2009) - [c12]Mark H. M. Winands, Yngvi Björnsson:
Evaluation Function Based Monte-Carlo LOA. ACG 2009: 33-44 - [c11]Jahn-Takeshi Saito, Mark H. M. Winands, H. Jaap van den Herik:
Randomized Parallel Proof-Number Search. ACG 2009: 75-87 - [c10]Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands:
Automated Discovery of Search-Extension Features. ACG 2009: 182-194 - [c9]Maarten P. D. Schadd, Mark H. M. Winands, Jos W. H. M. Uiterwijk:
CHANCEPROBCUT: Forward pruning in chance nodes. CIG 2009: 178-185 - 2008
- [j7]Guillaume Chaslot, Mark H. M. Winands, Istvan Szita, H. Jaap van den Herik:
Cross-Entropy for Monte-Carlo Tree Search. J. Int. Comput. Games Assoc. 31(3): 145-156 (2008) - [j6]Mark H. M. Winands:
6×6 LOA is Solved. J. Int. Comput. Games Assoc. 31(4): 234-238 (2008) - [c8]Maarten P. D. Schadd, Mark H. M. Winands, H. Jaap van den Herik, Guillaume Chaslot, Jos W. H. M. Uiterwijk:
Single-Player Monte-Carlo Tree Search. Computers and Games 2008: 1-12 - [c7]Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito:
Monte-Carlo Tree Search Solver. Computers and Games 2008: 25-36 - [c6]Guillaume Chaslot, Mark H. M. Winands, H. Jaap van den Herik:
Parallel Monte-Carlo Tree Search. Computers and Games 2008: 60-71 - [p1]H. Jaap van den Herik, Mark H. M. Winands:
Proof-Number Search and Its Variants. Oppositional Concepts in Computational Intelligence 2008: 91-118 - [e1]H. Jaap van den Herik, Xinhe Xu, Zongmin Ma, Mark H. M. Winands:
Computers and Games, 6th International Conference, CG 2008, Beijing, China, September 29 - October 1, 2008. Proceedings. Lecture Notes in Computer Science 5131, Springer 2008, ISBN 978-3-540-87607-6 [contents] - 2007
- [j5]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
- [c5]Levente Kocsis, Csaba Szepesvári, Mark H. M. Winands:
RSPSA: Enhanced Parameter Optimization in Games. ACG 2006: 39-56 - 2005
- [j4]Erik C. D. van der Werf, Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Learning to predict life and death from Go game records. Inf. Sci. 175(4): 258-272 (2005) - [j3]Mark H. M. Winands, H. Jaap van den Herik, Jos W. H. M. Uiterwijk, Erik C. D. van der Werf:
Enhanced forward pruning. Inf. Sci. 175(4): 315-329 (2005) - 2004
- [j2]Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
An effective two-level proof-number search algorithm. Theor. Comput. Sci. 313(3): 511-525 (2004) - [c4]Mark H. M. Winands, Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
The Relative History Heuristic. Computers and Games 2004: 262-272 - 2003
- [c3]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 - 2002
- [c2]Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
PDS-PN: A New Proof-Number Search Algorithm. Computers and Games 2002: 61-74 - [c1]Mark H. M. Winands, Levente Kocsis, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
Learning in Lines of Action. GAME-ON 2002 - 2001
- [j1]Mark H. M. Winands, Jos W. H. M. Uiterwijk, H. Jaap van den Herik:
The Quad Heuristic in Lines of Action. J. Int. Comput. Games Assoc. 24(1): 3-15 (2001)
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-10-10 21:16 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:
