000			01764nam a22002057a 4500
005			20240205120355.0
008			240205b ||||| |||| 00| 0 eng d
022			_a0019-5588
100			_aNabiyev, Vasif V.
245			_aA heuristic approach to domino grid problem (Journal Article)
260			_aNew Delhi _b:Indian National Science Academy | Springer _c,2023
300			_a1056-1068p.
440			_aIndian Journal of Pure and Applied Mathematics _v, Volume 54: Number 4, December 2023
505			_a***______{For Hard Copy, Please visit Library.}________***
520			_aAbstract: 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			_aDomino tiling| Heuristic search| Bigraphs| Perfect matching| Enumeration
700			_aPehlivan, Hüseyin
856			_uhttps://doi.org/10.1007/s13226-022-00321-x
942			_cPER
999			_c45411 _d45410