• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Modeling the Game of Go by Ising Hamiltonian, Deep Belief Networks and Common Fate Graphs

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    08717638.pdf
    Size:
    1.308Mb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Rojas-Domínguez, Alfonso
    Barradas Bautista, Didier cc
    Alvarado, Matías
    KAUST Department
    KAUST Catalysis Center
    KAUST Catalysis Center (KCC)
    Date
    2019
    Permanent link to this record
    http://hdl.handle.net/10754/655893
    
    Metadata
    Show full item record
    Abstract
    Three different models of the game of Go are developed by establishing an analogy between this game and physical systems susceptible to analysis under the well-known Ising model in two dimensions. The Ising Hamiltonian is adapted to measure the ‘energy’ of the Go boards generated by the interaction of the game pieces (stones) as players make their moves in an attempt to control the board or to capture rival stones. The proposed models are increasingly complex. The first or Atomic-Go model, consists of the straightforward measurement of local energy employing the adapted Ising Hamiltonian. The second or Generative Atomic-Go model, employs a Deep Belief Network (a generative graphical model popular in machine learning) to generate board configurations and compensate for the lack of information in mostly-empty boards. The third or Molecular-Go model, incorporates Common Fate Graphs, which are an alternative representation of the Go board that offers advantages in pattern analysis. Simulated games between different Go playing systems were used to test whether the models are able to capture the energy changes produced by moves between players of different skills. The results indicate that the latter two models reflect said energy differences correctly. These positive results encourage further development of analysis tools based on the techniques discussed.
    Citation
    Rojas-Dominguez, A., Barradas-Baustista, D., & Alvarado, M. (2019). Modeling the Game of Go by Ising Hamiltonian, Deep Belief Networks and Common Fate Graphs. IEEE Access, 7, 120117–120127. doi:10.1109/access.2019.2917442
    Sponsors
    Carlos Villarreal Lujan (Physics Institute, UNAM) provided advice on the use and meaning of the Ising model and Hamiltonian. Ricardo Quintero Zazueta, world Go senior master, suggested test simulations using games of human experts. Mark Agostino (Curtin University) provided suggestions to improve the manuscript. This work was supported by ABACUS and CONACYT grants: EDOMEX-2011-C01-165873 (D. Barradas), CÁTEDRAS-2598 (A. Rojas).
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Access
    DOI
    10.1109/ACCESS.2019.2917442
    Additional Links
    https://ieeexplore.ieee.org/document/8717638/
    https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8717638
    ae974a485f413a2113503eed53cd6c53
    10.1109/ACCESS.2019.2917442
    Scopus Count
    Collections
    Articles; KAUST Catalysis Center (KCC)

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.