IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v54y2023i4d10.1007_s13226-022-00321-x.html
   My bibliography  Save this article

A heuristic approach to domino grid problem

Author

Listed:
  • Vasif V. Nabiyev

    (Karadeniz Technical University)

  • Hüseyin Pehlivan

    (Karadeniz Technical University)

Abstract

Dominoes have been the main subject of many theoretical and practical studies, which have primarily focused on the solutions to domino tiling problems. The domino grid problem is a different type of tiling problems in which the aim is to find a complete set of dominoes on a two-dimensional grid arranged in a patternless fashion. Tiling problems are generally solved using combinatorial search methods because the grid can be organized into a large number of possible domino patterns. This paper addresses an efficient solution to the domino grid problem, using a heuristic approach governed by some state-specific rules. The problem is represented by a bipartite graph and a possible solution is obtained by computing a perfect matching in the graph, based on the degrees and positions of dominoes. For different grid layouts, the search space of the problem is explored, enumerating the total number of state evaluations required to generate all possible solutions.

Suggested Citation

  • Vasif V. Nabiyev & Hüseyin Pehlivan, 2023. "A heuristic approach to domino grid problem," Indian Journal of Pure and Applied Mathematics, Springer, vol. 54(4), pages 1056-1068, December.
    • Handle: RePEc:spr:indpam:v:54:y:2023:i:4:d:10.1007_s13226-022-00321-x
    DOI: 10.1007/s13226-022-00321-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-022-00321-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13226-022-00321-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:indpam:v:54:y:2023:i:4:d:10.1007_s13226-022-00321-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.