language agnostic - Dominoes matching algorithm -

Given some inputs, which contain a left and right symbol, the output series that links the input.

Imagine the information being a dominoes which you can not flip horizontally and they need to rest together. Creating large circular chains (if you can not physically do it with real dominoes, ignore it) is preferred over smaller circular chains, which are preferred over the chain where start and end Does not match.

Output with more circular chains (regardless of how many or chain lengths) are we looking for. For example, the production of 3 circular chains is better than 1 large chain and a surviving single domino.

Can anyone tell me in the right direction? [2] = (C, A) out in [1] = (B, C) in in <0> = 0 (0, 0 = 0) = (A, B) [0] = (0,1,2) in [0] = (A, B) in [1] = (B, A) in [2] = (C, D) [3] = (D, C) ) [0] = [0] out in [1] = (2,3) in [0] = (A, B) in [1] = (B, A) in [2] = (C, D) [3] = [(3) = [3] = [(3) = [3] = [(3) = [3] = [(3) = [3] = [(3) = [3] = ([ E] in [2] = (C, D) in [0] = (A, B) in [1] = (B, A) [2] = (3) = [[2] = (C, D) In [0] = (0,1) in [1] = (2,3) [0] = (a, b) in [1] = (b, c) = out [0] = (0, 1,2)

Domininos that can not be flipped Horizontal == Guided article.

Dominoes are called a "path" after the other, if it is a closed path, then it is a circuit.

A circuit that contains all Includes the rotation of graph theory is a Hamiltonian circuit.

Your problem in graph theory words is: How to reduce your graph to at least subgraphs Hamiltonian circuit is divided (shrink) (AKA . Hamiltonian Graph)