Platon Sudoku · Sudoku Study

Chain elimination targets · Core Concepts

A candidate seeing both endpoints, of which at least one must be true, cannot itself be true.

This course is adapted from Platon Sudoku App. Read the complete example here, then continue learning and practising in the app.

Definition

A candidate seeing both endpoints, of which at least one must be true, cannot itself be true.

Prove the endpoint relation first, then check the target against each endpoint separately.

Seeing only one endpoint leaves the other possible and proves no elimination.

Teaching board · local candidate diagram

Observe candidates

A candidate seeing both endpoints, of which at least one must be true, cannot itself be true.

Verify the condition

Prove the endpoint relation first, then check the target against each endpoint separately.

Draw the conclusion

The target sees both endpoints, one of which must be true, so it can be removed.

Teaching board · local candidate diagram

Observe candidates

A candidate seeing both endpoints, of which at least one must be true, cannot itself be true.

Verify the condition

Prove the endpoint relation first, then check the target against each endpoint separately.

Draw the conclusion

The target sees both endpoints, one of which must be true, so it can be removed.