Description
This week we look at problems that can be solved with recursive search, but pruning the search is important for efficiency.
Start & End Times
| Start Time | 2026-02-02 21:30 CET |
| End time | 2026-02-16 21:30 CET |
Problems
| Label | Problem |
|---|---|
| A | Good Morning! |
| B | Holey N-Queens (Batman) |
| C | Paintings |
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.