onehumanbeing/esp32-iphone-agent uses a $7 ESP32 board plus AirPlay to let a vision model operate a real iPhone with no Mac, developer account, or jailbreak. TedHaley/pensieve turns local files, git history, and past AI agent sessions into one searchable MCP server. vakandi/opencode-rust rewrites OpenCode from TypeScript into Rust specifically because the original engine eats too much memory and CPU. Mastra 1.76.0 adds durable agent run ownership to stop multiple replicas from racing on the same run, and DSPy 3.4.1 switches GEPA's reflection step to structured output by default — both releases list explicit breaking changes.
Week 3 covers three ways to write an optimization problem. Local search keeps a single state: hill climbing moves to a better neighbor and gets stuck at local optima, and simulated annealing accepts a worse move with probability e^(ΔE/T). Linear programming writes the problem as a linear cost function plus linear constraints and hands it to an existing solver. Constraint satisfaction problems shrink domains with node consistency and arc consistency (AC-3), then find a solution with backtracking search guided by the MRV, degree and least-constraining-value heuristics. Includes per-section time links, plus the approach, pseudocode, pitfalls and checks for the Crossword project (the reference implementation is folded at the end).