original ) (raw )
R Hayward, Robert Hearn, Mahya JamshidianBoxOff is NP-Complete springer link
N Fabiano, R HaywardNew Hex Patterns for Fill and Prune https://link.springer.com/chapter/10.1007%2F978-3-030-65883-0_7
C Gao, S Yan, R Hayward, M MüllerA Transferable Neural Network for Hex
D Spies, J-H You, R HaywardDomain-Independent Cost-Optimal Planning in ASP
C Gao, K Takada, R HaywardHex 2018: MoHex3HNN over DeepEzo in New Taipei City
C Gao, M Mueller, R HaywardThree Head Neural Network Architecture for Monte Carlo Tree Search
C Gao, R Hayward, M MuellerMove Prediction using Deep Convolutional Neural Networks in Hex
C Gao, M Mueller, R HaywardFocused Depth-first Proof Number Search using Convolutional Neural Nets for the Game of Hex
R Hayward, N WeningerMoHex Wins 2017 Hex Tournaments in Leiden
R Hayward, N WeningerExploring Positional Linear Go
J. Pawlewicz, R. HaywardConspiracy Number Search with Relative Sibling Scores
R Hayward, N Weninger, K Young, K Takada, T ZhangMoHex Wins 2016 Hex Tournaments in Leiden
K Young, R HaywardA Reverse Hex Solver Springer LNCS 10068
K Young, G Vasan, R HaywardNeuroHex: A Deep Q-Learning Hex Agent
R Hayward, J Pawlewicz, K Takada, T Van der ValkMoHex Wins 2015 Hex Tournaments in Leiden
R. HaywardGood Pass Moves in No-Draw HyperHex: Two Proverbs
J. Pawlewicz, R. HaywardFeature Strength and Parallelization of Sibling Conspiracy Number Search
J. Pawlewicz, R. HaywardSibling Conspiracy Number Search
J. Pawlewicz, R. HaywardStronger Virtual Connections in Hex
B Hauer, R Hayward, G KondrakSolving Substitution Ciphers with Combined Language Models
S Huneke, R Hayward, B ToftA winning strategy for 3xn cylindrical hex
R Hayward, B Arneson, S-C Huang, J PawlewiczMoHex Wins Hex Tournament pic
J. Pawlewicz, R. HaywardScalable Parallel Depth First Proof Number Search
S. Huang, B. Arneson, R. Hayward, M. Mueller, J. PawlewiczMoHex 2.0: a pattern-based MCTS Hex player
P. Henderson, R. HaywardCaptured-Reversible Moves and Star-Domination in Hex
Henry Brause, R. Hayward, Martin Mueller, Abdul Qadir, David Spies,Blunder Cost in Go and Hex
R. HaywardMoHex Wins Hex Tournament
R. Hayward, B. Toft, P. HendersonHow to Play Reverse Hex
B. Arneson, R. Hayward, P. HendersonMonte Carlo Tree Search in Hex
B. Arneson, R. Hayward, P. HendersonSolving Hex: Beyond Humans
P. Henderson and R. HaywardA Hex Handicap Strategy
B. Arneson, R. Hayward, P. Henderson,MoHex Wins Hex Tournament (16th Computer Olympiad 2010 Kanazawa)
P. Henderson, B. Arneson, and R. HaywardHex, Braids, the Crossing Rule, and XH-search
B. Arneson, R. Hayward, P. Henderson,MoHex Wins Hex Tournament (14th Computer Olympiad 2009 Pamplona)
B. Arneson, R. Hayward, P. Henderson,Wolve 2008 Wins Hex Tournament (13th Computer Olympiad 2008 Beijing)
P. Henderson, B. Arneson, and R. HaywardSolving 8x8 Hex
R. HaywardA puzzling Hex primer
P. Henderson and R. HaywardProbing the 4-3-2 Edge Template in Hex
R. Hayward, B. Arneson, and P. HendersonAutomatic Strategy Verification for Hex
R. HaywardThe Story of Perfectly Orderable Graphs
R. Hayward, J. Spinrad, and R. SritharanImproved algorithms for weakly chordal graphs
Y. Bjornsson, R. Hayward, M. Johanson, J. van Rijswijck,Dead Cell Analysis in Hex and the Shannon Game ,
R. Hayward and J. van Rijswijck,Hex and Combinatorics
R. Greiner, R. Hayward, M. Jankowska, M. Molloy,Finding optimal satisficing strategies for and-or trees ,
R. Hayward,Six wins Hex Tournament (11th Computer Olympiad 2006 Torino)
R. Hayward, Y. Bjornsson, M. Johanson, N. Po, J. van Rijswijck,Solving 7x7 Hex with domination, fill-in, and virtual connections (part I) (part II) ,here
R. Hayward,A Note on Domination in Hex , manuscript (2003;revised 2004).
G. Melis and R. Hayward,Six wins Hex Tournament (8th Computer Olympiad 2003 Graz) ,
R. Hayward,Berge and the Art of Hex (draft) ,
R. Hayward, R. Shamir,A note on tolerance graph recognition ,
R. Hayward, P. Kearney, A. Malton, NeST graphs ,
R. Hayward, S. Hougardy, B.A. Reed,Polynomial time recognition of P4-structure ,
R. Hayward & W. Lenhart,Bichromatic P4 composition schemes for perfect orderability ,
R. Hayward and B.A. Reed,Forbidding Holes and Antiholes in Perfect Graphs (eds. J. Ramirez Alfonsin and B. Reed), Wiley and Sons, (2001) 113-137
R. Hayward, J. Spinrad, R. Sritharan,Weakly Chordal Graph Algorithms via Handles , Proc. 11th SODA (2000) 42-49
R. Hayward, Bull-free Weakly Chordal Perfectly Orderable Graphs , Graphs and Combinatorics 17 (2000) 479-500
E. Eschen, R. Hayward, J. Spinrad, R. Sritharan,Weakly triangulated comparability graphs , SIAM J. Comput. 29 (1999) 378-386
R. Hayward,Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac Discrete Applied Mathematics 78 (1997) 283-289
R. Hayward,Meyniel Weakly Triangulated Graphs I: Co-perfect orderability Discrete Applied Mathematics 73 (1997) 199-210
P. Kearney, R. Hayward, H. Meijer,Phylogeny from relative dissimilarity , Algorithmica 25 (1999) 196-221, expanded version ofInferring evolutionary trees from ordinal data , Proc. 8th SODA (1997) 418-426
R. Hayward, Recognizing P3-structure: A Switching Approach , Journal Comb. Theory (Series B) 66 No. 2 (1996) 247-262
R. Hayward,Generating Weakly Triangulated Graphs , Journal of Graph Theory 21 (1996) 67-69demonstration applet.
R. Hayward,Discs in Unbreakable Graphs , Graphs and Combinatorics 11 (1995) 249-254
C. McDiarmid & R. Hayward, Large Deviations for Quicksort , Journal of Algorithms 21 (1996) 476-507, expanded version ofStrong Concentration for Quicksort , Proc. 3rd SODA (1992) 414-421
R. Hayward & C. McDiarmid, Average case analysis of heap building by repeated insertion , Journal of Algorithms 12 (1991) 126-153
R. Hayward,A note on the circle containment problem , Discrete Comput. Geom. 4:263-264 (1989)
R. Hayward, C. Hoang, F. Maffray,Optimizing Weakly Triangulated Graphs , Graphs and Combinatorics 5:339-349 (1989), 6:33-35 (1990)
R. Hayward, D. Rappaport, R. Wenger,Some extremal results on circles containing points , Discrete Comput. Geom 4:253-258 (1989)
R. Hayward,A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem , Discrete Comput. Geom 2:327-343 (1987)
R. Hayward,Weakly triangulated graphs , Journal Comb. Theory (Series B) 39 (1985) 200-208
R. Hayward,Two Classes of Perfect Graphs , Phd thesis, McGill University, 1986.
R. Hayward,The optimal crossing-free hamilton cycle problem for planar drawings of the complete graph , MSc thesis, Queen's University (Kingston), 1982.
X. Chen,Crafting a Hex Solver with Connection-Search and Expected-Work-Search , MSc thesis, University of Alberta, 2025
M.B. Tapkan,Dark Hex: A Large Scale Imperfect Information Game , MSc thesis, University of Alberta, 2022
M-R. Daliri,Experiments with Hex in OpenSpiel and AlphaZero , MSc thesis, University of Alberta, 2022
C. Gao,Search and Learning Algorithms for Two-Player Games with Application to the Game of Hex , PhD thesis, University of Alberta, 2020
D. Spies,Domain-Independent Cost-Optimal Planning in ASP , MSc thesis, University of Alberta, 2019
E. Johnson,On Finding Hajos Constructions , MSc thesis, University of Alberta, 2015
T. Ewalds,Playing and Solving Havannah , MSc thesis, University of Alberta, 2012
P. Henderson,Playing and Solving Hex , Phd thesis, University of Alberta, 2010
S. Ghosh,Heuristics for Integer Programs , Phd thesis, University of Alberta, 2007
J. van Rijswijck,Set Colouring Games , Phd thesis, University of Alberta, 2006
J. Nastos,(P5, P5-complement)-free Graphs , MSc thesis, University of Alberta, 2006
W.S. Kennedy,Strictly Chordal Graphs and Phylogenetic Roots , MSc thesis, University of Alberta, 2005
M. Jankowska,Probabilistic And-Or Tree Resolution , MSc thesis, University of Alberta, 2004
P. Kearney,On NeST Graphs , MSc thesis, Queen's University, 2003
R. Krueger,A Polynomial Time Algorithm for Line Segment Diagram Isomorphism , MSc thesis, University of Alberta, 2002
