COMP10001 Foundations of Computing
Date:
Live
COMP10001 Playground
My first three programming projects in one interactive site: count an election three ways, guide Falca past a dragon to the treasure with BFS and uniform-cost search, and find the best way to group a hand of cards.
- My role
- Individual projects. I wrote the originals on Grok Learning and built the 2026 revival.
Highlights
- The cave project is a line-by-line port of my surviving 2019 file, bugs included, beside a spec-correct mode. The two lost projects were rebuilt from the task and are labelled as rebuilt.
- Parity tests check the TypeScript against the Python on 230 seeded caves, and property-based tests check invariants against independent oracles.
- A bring-your-own-key evaluation asks whether an LLM can find the best card grouping, scored by the same rules engine against an exact solver and a greedy baseline, with Wilson intervals.
- A coverage simulation showed the bootstrap intervals run narrow on small samples, so the default became 30 hands and those intervals are labelled nominal.
- Original
- Python 3 · Grok Learning
- 2026 revival
- Shared stack + Web Workers · fast-check · zod · IndexedDB
Skills
- Vote counting (first past the post, second-preference runoff, instant runoff)
- Breadth-first search
- Uniform-cost search
- Exhaustive set-partition search
- Parity testing against Python
- Property-based testing with fast-check
- Wilson and bootstrap intervals
- Interval coverage simulation
- LLM evaluation against an exact solver
- Content Security Policy for BYOK keys
Skills