1. Shuffle Process

A new game is shuffled if not determined by a given cipher. The number of cells to be filled internally depends on the desired density for the field. Density may be defined by the user which is not implemented.

2. Sequence Process

A sequence of dashes is to be computed for internally filled cells and for externally filled cells by the same process. The sequence process operates on the field by an iterator and a flag reader. The iterator hides the implementation of the field. The flag reader gives the desired fill flag which is called init for internal fills and user for external fills.

3. Match Process

The objective of the game is to match the external sequence to the internal sequence for every line. The programm presents the progress with color-coded masks accordingly. A color-code is determined by a match process according to the below flowchart. An iterator is to be applied that hides the implementation of the field of cells and the orientation of the line. The field may be implemented as a row-major orderred list or as a table with a composite key of row and column or else. The line is either horizontal for a row or vertical for a column.