Optimization
26 problems
Compare path lengths by counting units
Ruler with erased marks
Place digit cards to maximize or minimize a result
Plan the most efficient route
Measure a target in fewest pourings
Divide a circle into min or max regions
Shortest route covering every road
Complete a decimal subtraction from digit cards
Maximize or minimize a mixed expression
Build fractions from number cards
GCD and LCM in tiling problems
Longest and shortest perimeter of a net
Shortest path that must touch a line
Greatest and least dice pip totals
Largest and smallest surface area
Fewest groups with no conflicting pair
Fewest river crossings under rules
Shortest string tied around a box
Fewest weighings to rank all weights
Most non-overlapping classes in one day
Measure an exact time with two hourglasses
Farthest travel under a carry limit
Fewest swaps to sort number cards
Most and fewest cubes fitting three views
Largest and smallest surface area
Largest area a tied string can sweep