Sha256: 198bd3aba5f06494b3d2d0f6b2735a2d9b77cdfdda952746614831a3ed1f37bc
Contents?: true
Size: 715 Bytes
Versions: 174
Compression:
Stored size: 715 Bytes
Contents
Compute a way to order a given set of dominoes in such a way that they form a correct domino chain (the dots on one half of a stone match the dots on the neighbouring half of an adjacent stone) and that dots on the halfs of the stones which don't have a neighbour (the first and last stone) match each other. For example given the stones `21`, `23` and `13` you should compute something like `12 23 31` or `32 21 13` or `13 32 21` etc, where the first and last numbers are the same. For stones 12, 41 and 23 the resulting chain is not valid: 41 12 23's first and last numbers are not the same. 4 != 3 Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used.
Version data entries
174 entries across 174 versions & 1 rubygems