# Campixu

Campixu was invented by Johannes Kestler in 2008 and was published for the first time in the magazine LOGIC PIXELS in August 2008. At first sight, Campixu looks like the Nonograms, and indeed, it is similar to the Nonograms. But since the rules are different, the solution strategies needed to solve Campixu are completely different, such that Campixu promises a totally new puzzle experience.

If you like Nonograms, you'll love Campixu!

## Rules

Campixu is a tricky logic puzzle type that rewards you with a solution picture at the end. Color in some cells and mark others as free — step by step you get closer to the goal. The number hints and the bordered regions provide you all necessary information. You never have to (and you must never) guess! Only your sense of logic is needed!

**Please note: **The numbers here have a different meaning than the numbers of nonograms!

→

### What is the meaning of the numbers?

- Each row and each column holds exactly two numbers.
- The first number tells us how many cells in the corresponding row or column are to be filled in (independently of their grouping).
- The second number indicates the number of black blocks (groups) in the row or column. A block is a sequence of (at least 1) black cells. Between two blocks, there is always at least 1 empty cell to separate them.
- Thus, [5 3] reads: “5 black cells are grouped in 3 blocks.” This can be a block of 1, another block of 1 and a block of 3 black cells, or for example a block of 2, a block of 1 and a block of 2 black cells, etc.

### What is the meaning of the regions bordered by think lines?

- All cells within a region must have the same color. Either all cells are black or all cells are empty.
- This means, if you know the color of one cell, you can mark the other cells the same way, black or empty. (Flooding a region)

## Example

## Solution techniques

Even if you know the Campixu rules, every beginning is difficult. Here we show you the most important techniques to solve Campixu puzzles successfully.

As a general rule: Whenever you know that cells or regions must remain free, mark them with dots or X's.

### Regions that have to be empty (part 1)

(a)

In example (a), 5 cells are to be filled in. Thus, a region of 6 cells is way too large, anyway, and is marked as free.

(b)

If the region of 4 cells in example (b) was black, the required number of black cells (here: 6) would be exceeded. Thus, it has to be free.

### Regions that have to be empty (part 2)

(c)

If both numbers are identical (as shown in example (c): 4 and 4), it means that there are only single blocks (i.e. blocks of length 1). All longer regions must be empty.

(d)

If the first number exceeds the second number by 1 (as shown in example (d): 4 and 3), there are certainly no blocks longer than 2 cells.

Analogously:

If the first number exceeds the second number by 2, there are certainly no blocks longer than 3 cells.

If the first number exceeds the second number by 3, there are certainly no blocks longer than 4 cells.

and so on...

### Long singular blocks

(e)

If exactly 1 block is required – as in example (e) – and this block is long enough, the slide technique (known from the Nonograms) can be applied. We place this block in our mind to the left as far as possible and to the right as far as possible. If these extreme positionings overlap, we can color in the corresponding cells. In our example, we can fill in 3 cells at first. Additionally, we can fill in a further cell at the right as it is part of the same region; as a consequence, the first cell of the row must be free because the long block cannot reach it anymore.

### Further examples

(f)

If we didn’t color in the first region in example (f), there still would be 6 cells available; but since the 6 black cells should be grouped in 3 blocks, there have to be (at least) 2 empty squares in between. Thus, the first region must be black.

(g)

If the 8^{th} cell in example (g) was not black, there would be 3 blocks.
But since only 2 blocks are required, this cell must be black.

(h)

In example (h), exactly one block of 3 cells is required. Thus, the rightmost cell cannot be black.
Also, the region of 2 cells extending from the 7^{th} to the 8^{th} cell, cannot be black because the adjacent regions are so big that a block of 4 or 5 black cells would result.

(i)

Two blocks are required in example (i). One of them is already completed. Furthermore, the position of the second block is determined. Thus, we can terminate this row.

Besides the techniques presented on this page, there are a lot of other techniques, of course. Certainly, you will find them by yourself in the course of time. Have fun!

## 8 free Campixu puzzles as Pdf file

## Upcoming app "Let’s IQ Campixu"

The app for Windows 10 (including Windows 10 Mobile), iPad, iPhone and Android devices is expected for mid-2018.