A heuristic approach to domino grid problem (Journal Article) (Record no. 45411)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01764nam a22002057a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240205120355.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240205b ||||| |||| 00| 0 eng d |
| 022 ## - INTERNATIONAL STANDARD SERIAL NUMBER | |
| ISSN | 0019-5588 |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Nabiyev, Vasif V. |
| 245 ## - TITLE STATEMENT | |
| Title | A heuristic approach to domino grid problem (Journal Article) |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New Delhi |
| Name of publisher | :Indian National Science Academy | Springer |
| Year of publication | ,2023 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1056-1068p. |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE | |
| Title | Indian Journal of Pure and Applied Mathematics |
| Volume number/sequential designation | , Volume 54: Number 4, December 2023 |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | ***______{For Hard Copy, Please visit Library.}________***<br/><br/> |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Abstract:<br/> 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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Domino tiling| Heuristic search| Bigraphs| Perfect matching| Enumeration |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Pehlivan, Hüseyin |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/s13226-022-00321-x |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Periodicals |
| Lost status | Damaged status | Home library | Current library | Date acquired | Koha item type |
|---|---|---|---|---|---|
| RIE BPL Library | RIE BPL Library | 05.02.2024 | Periodicals |