Diapositiva PPT
Our interest: Each slit with its two neighbours defines a triplet that exists only once in the whole pattern.
- Given P={1,2,...,p} set of colours.
- We want to determine S={s1,s2,...sn} sequence of coloured slits.
Number of nodes: p3 nodes.
Transition {ijk} Ù {rst} Þ j = r, k = s
- The problem is reduced to obtain the path which visits all the nodes of the graph only once (a simple variation of the Salesman’s problem).
- Backtracking based solution.
- Deterministic and optimally solved by Griffin.
THE PROPOSAL OF A NEW CODED PATTERN
Colour Assignment Algorithm (i)