C

cakes, cutting into pieces, 4–5, 74

Carpenter, Peter, 116

case analysis

in design problems, 122

implying speculation, 122

trying, 164

chance mind games, 42–51

characters, encoding in bits, 29

cheating, selfish benefits of, 16

checkerboard in Feedback Dividends, 49–51

checks, writing to minimize change returned, 71–72

child cut rule

in As Easy as Pie, 37

recursive perpendicular cuts satisfying, 94

chips, colored in latched boxes, 47–48, 97–102

Christofides, N., 161

city grid, capturing a thief in, 19–20

city-states, roads connecting, 174

coalitions of state districts, 14, 79–80

coin, betting on the flip of a shared fair, 8–9, 76–78

combination, inferring a safe’s, 54–55, 103–104

combinatorial design, 177

competition mind games, 4–22

computational problems, achieving a factor of two of the optimal, 174

consistency, test for in Preferential Romance, 68

constraint-oriented puzzles, 122, 128

constraints on a team schedule, 34, 90

contestants, characterizing winning in The Box Chip Game, 100

cooling of crystals, technique inspired by, 166

cost(s)

adding up all smallest, 172

evaluating for each triplet in Sweet Packs, 158

cost array in dynamic programming, 156

cost-benefit history of a device in Legal Logic, 45

cycle, in graph theory, 116

cycle-free graph, obtaining, 117