Solving 7 7 hex with domination, fill-in, and virtual connections
DOI10.1016/J.TCS.2005.09.042zbMATH Open1086.68122OpenAlexW1965935527MaRDI QIDQ817784FDOQ817784
Authors: Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck 
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.042
Recommendations
- Solutions to seven and a half problems on tilings
- A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
- Towards resolving Keller's cube tiling conjecture in dimension seven
- Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices
- Packings and coverings of a graph with 6 vertices and 7 edges
- Determining the Heilbronn configuration of seven points in triangles via symbolic computation
- Peg solitaire on graphs with seven vertices or less
- A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs
- Computer solution of the almost empty hexagon problem
- Graph theory problems from hexagonal and traditional chess
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Dead Cell Analysis in Hex and the Shannon Game
- Title not available (Why is that?)
- Hex strategy: making the right connections
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Solving \(7\times 7\) hex with domination, fill-in, and virtual connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817784)
