
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system

Vasiliy came up with a new chess piece called the "super-bishop." One "super-bishop" ($A$) attacks another ($B$) if they are on the same diagonal, there are no pieces between them, and the next cell along the diagonal after the "super-bishop" $B$ is empty. For example, in the image, piece $a$ attacks piece $b$, but does not attack any of the pieces $c, d, e, f,$ and $g$.

What is the maximum number of "super-bishops" that can be placed on a chessboard such that each of them attacks at least one other?

Present the answer in LaTex format: \boxed{Your answer}
user