Players can only move their piece to a node connected to their current position. A win is secured by moving to a node your opponent is occupying.

Which player that can force a win in left-sorted examples can change depending on who moves first.

See BP1284 for an animated Problem about the same game.

Adjacent-numbered pages:
BP1277 BP1278 BP1279 BP1280 BP1281  *  BP1283 BP1284 BP1285 BP1286 BP1287

allsorted, unwordable, notso, teach

Leo Crabbe

https://en.wikipedia.org/wiki/Highly_irregular_graph

Adjacent-numbered pages:
BP1278 BP1279 BP1280 BP1281 BP1282  *  BP1284 BP1285 BP1286 BP1287 BP1288

Leo Crabbe

In the depicted "capture game", the objective is to capture your opponent's piece by moving to a node they are occupying. Players take turns moving their pieces. You can only move to a node that is linked to yours. Optimal play can either lead to a win-lose state or a draw state.

A frame where only one black disc is visible signifies that a player has taken the other's piece, winning the game.

Adjacent-numbered pages:
BP1279 BP1280 BP1281 BP1282 BP1283  *  BP1285 BP1286 BP1287 BP1288 BP1289

teach, animated

Leo Crabbe

In the depicted "capture game", the objective is to capture your opponent's piece by moving to a node they are occupying. Players take turns moving their pieces. You can only move to a node that is linked to yours. All examples are "boards" where either player can force a win, depending on who moves first.

Players are assumed to be making optimal choices.

Adjacent-numbered pages:
BP1280 BP1281 BP1282 BP1283 BP1284  *  BP1286 BP1287 BP1288 BP1289 BP1290

stub

Leo Crabbe

In particular, 40fps vs. 20fps.

Adjacent-numbered pages:
BP1281 BP1282 BP1283 BP1284 BP1285  *  BP1287 BP1288 BP1289 BP1290 BP1291

stub, precise, arbitrary, antihuman, animated, contributepairs, right-couldbe, preciseworld

Leo Crabbe

Adjacent-numbered pages:
BP1282 BP1283 BP1284 BP1285 BP1286  *  BP1288 BP1289 BP1290 BP1291 BP1292

meta (see left/right), metaconcept

bp [smaller | same | bigger]

Leo Crabbe

Adjacent-numbered pages:
BP1283 BP1284 BP1285 BP1286 BP1287  *  BP1289 BP1290 BP1291 BP1292 BP1293

world, animated

Leo Crabbe

Solution worded differently:

Colors that use the primary color red to make, vs colors that don’t/cannot

Reds and its secondary and tertiary relations vs. not

Red and its pigment relatives vs. not

Comment from the author (a.k.a. Morgan Kidd):

Thank you Sally D. for introducing me to bongards!

Adjacent-numbered pages:
BP1285 BP1286 BP1287 BP1288 BP1289  *  BP1291 BP1292 BP1293 BP1294 BP1295

precise, notso, color

Morgan

Left hand examples can be thought of as "graph circles".

https://en.wikipedia.org/wiki/Level_structure

Adjacent-numbered pages:
BP1286 BP1287 BP1288 BP1289 BP1290  *  BP1292 BP1293 BP1294 BP1295

precise, unwordable, notso, left-narrow

Leo Crabbe

A path is formally defined as a sequence of black squares such that no two squares are the same and every pair of consecutive black squares are orthogonally adjacent to each other.

Every grid on the left requires a minimum of an even number of paths such that every black square is a part of exactly one path, while every grid on the right requires a minimum of an odd number of paths to do so.

Adjacent-numbered pages:
BP1287 BP1288 BP1289 BP1290 BP1291  *  BP1293 BP1294 BP1295

A grid with all whites fits on the left because it does not contain black squares, hence requiring 0 paths, an even number.

A grid with all blacks requires 1 path to go through all black squares (such as a zigzag through every row), an odd number.

The checkerboard grid on the left contains 12 black squares that cannot be joined with a path, hence it requires 12 paths, an even number.

nice, blackwhite, fixedgrid, left-listable, right-listable

Matt Nguyen