Ryan B. Hayward

Affiliations:
  • University of Alberta, Edmonton, Canada


According to our database1, Ryan B. Hayward authored at least 68 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Expected Work Search: Combining Win Rate and Proof Size Estimation.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2022
Improving Search in Go Using Bounded Static Safety.
Proceedings of the Computers and Games - International Conference, 2022

2021
BoxOff is NP-Complete.
Proceedings of the Advances in Computer Games - 17th International Conference, 2021

2019
Domain-Independent Cost-Optimal Planning in ASP.
Theory Pract. Log. Program., 2019

Hex 2018: MoHex3HNN over DeepEzo.
J. Int. Comput. Games Assoc., 2019

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning.
Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

New Hex Patterns for Fill and Prune.
Proceedings of the Advances in Computer Games - 16th International Conference, 2019

2018
Move Prediction Using Deep Convolutional Neural Networks in Hex.
IEEE Trans. Games, 2018

A transferable neural network for Hex.
J. Int. Comput. Games Assoc., 2018

Three-Head Neural Network Architecture for Monte Carlo Tree Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Adversarial Policy Gradient for Alternating Markov Games.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Hex 2017: MoHex wins the 11x11 and 13x13 tournaments.
J. Int. Comput. Games Assoc., 2017

Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments.
J. Int. Comput. Games Assoc., 2017

Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Exploring Positional Linear Go.
Proceedings of the Advances in Computer Games - 15th International Conferences, 2017

2016
Conspiracy number search with relative sibling scores.
Theor. Comput. Sci., 2016

NeuroHex: A Deep Q-learning Hex Agent.
Proceedings of the Computer Games - 5th Workshop on Computer Games, 2016

A Reverse Hex Solver.
Proceedings of the Computers and Games - 9th International Conference, 2016

2015
Stronger Virtual Connections in Hex.
IEEE Trans. Comput. Intell. AI Games, 2015

Sibling Conspiracy Number Search.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Feature Strength and Parallelization of Sibling Conspiracy Number Search.
Proceedings of the Advances in Computer Games - 14th International Conference, 2015

2014
A winning strategy for 3×n Cylindrical Hex.
Discret. Math., 2014

Solving Substitution Ciphers with Combined Language Models.
Proceedings of the COLING 2014, 2014

2013
MOHEX Wins Hex Tournament.
J. Int. Comput. Games Assoc., 2013

An Architecture for Parallelizing Fully Homomorphic Cryptography on Cloud.
Proceedings of the Seventh International Conference on Complex, 2013

Scalable Parallel DFPN Search.
Proceedings of the Computers and Games - 8th International Conference, 2013

MoHex 2.0: A Pattern-Based MCTS Hex Player.
Proceedings of the Computers and Games - 8th International Conference, 2013

2012
MOHEX Wins Hex Tournament.
J. Int. Comput. Games Assoc., 2012

How to play Reverse Hex.
Discret. Math., 2012

2011
Blunder Cost in Go and Hex.
Proceedings of the Advances in Computer Games - 13th International Conference, 2011

2010
Monte Carlo Tree Search in Hex.
IEEE Trans. Comput. Intell. AI Games, 2010

Solving Hex: Beyond Humans.
Proceedings of the Computers and Games - 7th International Conference, 2010

2009
Solving 8x8 Hex.
Proceedings of the IJCAI 2009, 2009

Hex, Braids, the Crossing Rule, and XH-Search.
Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008
Probing the 4-3-2 Edge Template in Hex.
Proceedings of the Computers and Games, 6th International Conference, CG 2008, Beijing, 2008

2007
Improved algorithms for weakly chordal graphs.
ACM Trans. Algorithms, 2007

The Story of Perfectly Orderable Graphs.
Graphs Comb., 2007

2006
Hex and combinatorics.
Discret. Math., 2006

Finding optimal satisficing strategies for and-or trees.
Artif. Intell., 2006

Automatic Strategy Verification for Hex.
Proceedings of the Computers and Games, 5th International Conference, 2006

2005
Solving 7x7 Hex with domination, fill-in, and virtual connections.
Theor. Comput. Sci., 2005

2004
A note on tolerance graph recognition.
Discret. Appl. Math., 2004

Bichromatic P<sub>4</sub>-composition schemes for perfect orderability.
Discret. Appl. Math., 2004

2003
Solving 7x7 Hex: Virtual Connections and Game-State Reduction.
Proceedings of the Advances in Computer Games, 2003

2002
NeST graphs.
Discret. Appl. Math., 2002

Polynomial time recognition of P4-structure.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Optimal Depth-First Strategies for And-Or Trees.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Bull-Free Weakly Chordal Perfectly Orderable Graphs.
Graphs Comb., 2001

Perfectly Orderable P<sub>4</sub> Composition.
Electron. Notes Discret. Math., 2001

2000
Weakly chordal graph algorithms via handles.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Weakly Triangulated Comparability Graphs.
SIAM J. Comput., 1999

Evolutionary Trees and Ordinal Assertions.
Algorithmica, 1999

1997
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac.
Discret. Appl. Math., 1997

Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability.
Discret. Appl. Math., 1997

Inferring Evolutionary Trees from Ordinal Data.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Generating weakly triangulated graphs.
J. Graph Theory, 1996

Recognizing<i>P</i><sub>3</sub>-Structure: A Switching Approach.
J. Comb. Theory B, 1996

Large Deviations for Quicksort.
J. Algorithms, 1996

1995
Discs in unbreakable graphs.
Graphs Comb., 1995

1994
Tolerance-Free NeST Representations.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1992
Strong Concentration for Quicksort.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991
Average Case Analysis of Heap Building by Repeated Insertion.
J. Algorithms, 1991

1990
On the <i>P</i><sub>4</sub>-structure of Perfect Graphs. IV. Partner graphs.
J. Comb. Theory B, 1990

Murky graphs.
J. Comb. Theory B, 1990

Optimizing weakly triangulated graphs.
Graphs Comb., 1990

1989
A Note on the Circle Containment Problem.
Discret. Comput. Geom., 1989

1987
A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
Discret. Comput. Geom., 1987

1985
Weakly triangulated graphs.
J. Comb. Theory B, 1985


  Loading...