Below is a trail of working notes on weeSeepy. These are written in a relatively informal manner, and are based on the APES (Algorithms, Problems and Empirical Studies) footnotes, Blue Book Notes from the dream group, and those by Dijkstra.

• 033-weeSeepy: an introduction
• 034-weeSeepy: Reversible Domains
• 035-weeSeepy: Reification
• 036-weeSeepy: A comparison with choco
• 037-weeSeepy: variables and constraints
• 038-weeSeepy: greater than, sum and the max constraint
• 039-weeSeepy: searching for a next solution