Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

CONNECTIVITY IN THE GAME OF GO

From MaRDI portal
Publication:5484735
Jump to:navigation, search

DOI10.1142/S1793005706000415zbMATH Open1136.91302OpenAlexW2024393726MaRDI QIDQ5484735FDOQ5484735


Authors: Keh-Hsun Chen Edit this on Wikidata


Publication date: 21 August 2006

Published in: New Mathematics and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793005706000415




Recommendations

  • Formulations of patterns by a graph model for the game of Go
  • Using patterns in computer Go
  • Combinatorics of Go
  • Game connectivity of graphs
  • Computer Go: An AI oriented survey


zbMATH Keywords

pattern recognitionheuristic methodsgame tree searchcomputer go


Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) 2-person games (91A05)


Cites Work

  • Proof-number search


Cited In (4)

  • Formulations of patterns by a graph model for the game of Go
  • Dependency-based search for Connect6
  • THE SEPARATION GAME
  • Games of Connectivity





This page was built for publication: CONNECTIVITY IN THE GAME OF GO

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484735)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5484735&oldid=30033273"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:00. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki