Free tool
Study plan generator
Pick a start date and a pace and see every one of the 145 weeks of the cracked.guide path with real dates: Crafting Interpreters, then The Art of Computer Programming from Volume 1 to 4B, with NeetCode and the Play track alongside. No account needed.
One week of the path each week: 145 weeks, about 2.8 years.
Start Oct 26, 2026, finish week 145 by Aug 5, 2029.
| Phase | Weeks | Starts | Ends |
|---|---|---|---|
| Crafting Interpreters | 1 to 28 | Oct 26, 2026 | May 9, 2027 |
| TAOCP Vol 1: Fundamental Algorithms | 29 to 63 | May 10, 2027 | Jan 9, 2028 |
| TAOCP Vol 2: Seminumerical Algorithms | 64 to 89 | Jan 10, 2028 | Jul 9, 2028 |
| TAOCP Vol 3: Sorting and Searching | 90 to 117 | Jul 10, 2028 | Jan 21, 2029 |
| TAOCP Vol 4A: Combinatorial Algorithms, Part 1 | 118 to 133 | Jan 22, 2029 | May 13, 2029 |
| TAOCP Vol 4B: Combinatorial Algorithms, Part 2 | 134 to 145 | May 14, 2029 | Aug 5, 2029 |
Week by week
| Week | Dates | Phase | What |
|---|---|---|---|
| 1 | Mon, Oct 26 to Sun, Nov 1 | Crafting Interpreters | Crafting Interpreters, chapters 1, 2 and 3NeetCode 1 and 2 · Play: TIS-100 |
| 2 | Mon, Nov 2 to Sun, Nov 8 | Crafting Interpreters | Crafting Interpreters, chapter 4NeetCode 3 and 4 |
| 3 | Mon, Nov 9 to Sun, Nov 15 | Crafting Interpreters | Crafting Interpreters, chapter 5NeetCode 5 and 6 |
| 4 | Mon, Nov 16 to Sun, Nov 22 | Crafting Interpreters | Crafting Interpreters, chapter 6NeetCode 7 and 8 |
| 5 | Mon, Nov 23 to Sun, Nov 29 | Crafting Interpreters | Crafting Interpreters, chapter 7NeetCode 9 and 10 |
| 6 | Mon, Nov 30 to Sun, Dec 6 | Crafting Interpreters | Crafting Interpreters, chapter 8NeetCode 11 and 12 |
| 7 | Mon, Dec 7 to Sun, Dec 13 | Crafting Interpreters | Crafting Interpreters, chapter 9NeetCode 13 and 14 · Play: TIS-100 checkpoint |
| 8 | Mon, Dec 14 to Sun, Dec 20 | Crafting Interpreters | Crafting Interpreters, chapter 10NeetCode 15 and 16 |
| 9 | Mon, Dec 21 to Sun, Dec 27 | Crafting Interpreters | Crafting Interpreters, chapter 11NeetCode 17 and 18 |
| 10 | Mon, Dec 28 to Sun, Jan 3 | Crafting Interpreters | Crafting Interpreters, chapter 12NeetCode 19 and 20 |
| 11 | Mon, Jan 4 to Sun, Jan 10 | Crafting Interpreters | Crafting Interpreters, chapter 13NeetCode 21 and 22 · Play: Shenzhen I/O |
| 12 | Mon, Jan 11 to Sun, Jan 17 | Crafting Interpreters | Crafting Interpreters, chapter 14NeetCode 23 and 24 |
| 13 | Mon, Jan 18 to Sun, Jan 24 | Crafting Interpreters | Crafting Interpreters, chapter 15NeetCode 25 and 26 |
| 14 | Mon, Jan 25 to Sun, Jan 31 | Crafting Interpreters | Crafting Interpreters, chapter 16NeetCode 27 and 28 |
| 15 | Mon, Feb 1 to Sun, Feb 7 | Crafting Interpreters | Crafting Interpreters, chapter 17NeetCode 29 and 30 |
| 16 | Mon, Feb 8 to Sun, Feb 14 | Crafting Interpreters | Crafting Interpreters, chapter 18NeetCode 31 and 32 |
| 17 | Mon, Feb 15 to Sun, Feb 21 | Crafting Interpreters | Crafting Interpreters, chapter 19NeetCode 33 and 34 · Play: Shenzhen I/O checkpoint |
| 18 | Mon, Feb 22 to Sun, Feb 28 | Crafting Interpreters | Crafting Interpreters, chapter 20NeetCode 35 and 36 |
| 19 | Mon, Mar 1 to Sun, Mar 7 | Crafting Interpreters | Crafting Interpreters, chapter 21NeetCode 37 and 38 · Play: EXAPUNKS |
| 20 | Mon, Mar 8 to Sun, Mar 14 | Crafting Interpreters | Crafting Interpreters, chapter 22NeetCode 39 and 40 |
| 21 | Mon, Mar 15 to Sun, Mar 21 | Crafting Interpreters | Crafting Interpreters, chapter 23NeetCode 41 and 42 |
| 22 | Mon, Mar 22 to Sun, Mar 28 | Crafting Interpreters | Crafting Interpreters, chapter 24NeetCode 43 and 44 |
| 23 | Mon, Mar 29 to Sun, Apr 4 | Crafting Interpreters | Crafting Interpreters, chapter 25NeetCode 45 and 46 |
| 24 | Mon, Apr 5 to Sun, Apr 11 | Crafting Interpreters | Crafting Interpreters, chapter 26NeetCode 47 and 48 |
| 25 | Mon, Apr 12 to Sun, Apr 18 | Crafting Interpreters | Crafting Interpreters, chapter 27NeetCode 49 and 50 |
| 26 | Mon, Apr 19 to Sun, Apr 25 | Crafting Interpreters | Crafting Interpreters, chapter 28NeetCode 51 and 52 |
| 27 | Mon, Apr 26 to Sun, May 2 | Crafting Interpreters | Crafting Interpreters, chapter 29NeetCode 53 and 54 · Play: EXAPUNKS checkpoint |
| 28 | Mon, May 3 to Sun, May 9 | Crafting Interpreters | Crafting Interpreters, chapter 30NeetCode 55 and 56 |
| 29 | Mon, May 10 to Sun, May 16 | TAOCP Vol 1 | TAOCP 1.1 AlgorithmsNeetCode 57 and 58 |
| 30 | Mon, May 17 to Sun, May 23 | TAOCP Vol 1 | TAOCP 1.2.1 Mathematical InductionNeetCode 59 and 60 |
| 31 | Mon, May 24 to Sun, May 30 | TAOCP Vol 1 | TAOCP 1.2.2 Numbers, Powers, and LogarithmsNeetCode 61 and 62 · Play: SpaceChem |
| 32 | Mon, May 31 to Sun, Jun 6 | TAOCP Vol 1 | TAOCP 1.2.3 Sums and ProductsNeetCode 63 and 64 |
| 33 | Mon, Jun 7 to Sun, Jun 13 | TAOCP Vol 1 | TAOCP 1.2.4 Integer Functions and Elementary Number TheoryNeetCode 65 and 66 |
| 34 | Mon, Jun 14 to Sun, Jun 20 | TAOCP Vol 1 | TAOCP 1.2.5 Permutations and FactorialsNeetCode 67 and 68 |
| 35 | Mon, Jun 21 to Sun, Jun 27 | TAOCP Vol 1 | TAOCP 1.2.6 Binomial Coefficients (part 1)NeetCode 69 and 70 |
| 36 | Mon, Jun 28 to Sun, Jul 4 | TAOCP Vol 1 | TAOCP 1.2.6 Binomial Coefficients (part 2)NeetCode 71 and 72 |
| 37 | Mon, Jul 5 to Sun, Jul 11 | TAOCP Vol 1 | TAOCP 1.2.7 Harmonic NumbersNeetCode 73 and 74 |
| 38 | Mon, Jul 12 to Sun, Jul 18 | TAOCP Vol 1 | TAOCP 1.2.8 Fibonacci NumbersNeetCode 75 and 76 · Play: SpaceChem checkpoint |
| 39 | Mon, Jul 19 to Sun, Jul 25 | TAOCP Vol 1 | TAOCP 1.2.9 Generating FunctionsNeetCode 77 and 78 |
| 40 | Mon, Jul 26 to Sun, Aug 1 | TAOCP Vol 1 | TAOCP 1.2.10 Analysis of an AlgorithmNeetCode 79 and 80 |
| 41 | Mon, Aug 2 to Sun, Aug 8 | TAOCP Vol 1 | TAOCP 1.2.11 Asymptotic RepresentationsNeetCode 81 and 82 |
| 42 | Mon, Aug 9 to Sun, Aug 15 | TAOCP Vol 1 | TAOCP 1.3.1 Description of MIXNeetCode 83 and 84 |
| 43 | Mon, Aug 16 to Sun, Aug 22 | TAOCP Vol 1 | TAOCP 1.3.2 The MIX Assembly LanguageNeetCode 85 and 86 |
| 44 | Mon, Aug 23 to Sun, Aug 29 | TAOCP Vol 1 | TAOCP 1.3.3 Applications to PermutationsNeetCode 87 and 88 |
| 45 | Mon, Aug 30 to Sun, Sep 5 | TAOCP Vol 1 | TAOCP 1.4.1 SubroutinesNeetCode 89 and 90 |
| 46 | Mon, Sep 6 to Sun, Sep 12 | TAOCP Vol 1 | TAOCP 1.4.2 CoroutinesNeetCode 91 and 92 · Play: Infinifactory |
| 47 | Mon, Sep 13 to Sun, Sep 19 | TAOCP Vol 1 | TAOCP 1.4.3 Interpretive RoutinesNeetCode 93 and 94 |
| 48 | Mon, Sep 20 to Sun, Sep 26 | TAOCP Vol 1 | TAOCP 1.4.4 and 1.4.5NeetCode 95 and 96 |
| 49 | Mon, Sep 27 to Sun, Oct 3 | TAOCP Vol 1 | TAOCP 2.1 and 2.2.1NeetCode 97 and 98 |
| 50 | Mon, Oct 4 to Sun, Oct 10 | TAOCP Vol 1 | TAOCP 2.2.2 Sequential AllocationNeetCode 99 and 100 |
| 51 | Mon, Oct 11 to Sun, Oct 17 | TAOCP Vol 1 | TAOCP 2.2.3 Linked AllocationNeetCode 101 and 102 |
| 52 | Mon, Oct 18 to Sun, Oct 24 | TAOCP Vol 1 | TAOCP 2.2.4 Circular ListsNeetCode 103 and 104 · Play: Infinifactory checkpoint |
| 53 | Mon, Oct 25 to Sun, Oct 31 | TAOCP Vol 1 | TAOCP 2.2.5 Doubly Linked ListsNeetCode 105 and 106 |
| 54 | Mon, Nov 1 to Sun, Nov 7 | TAOCP Vol 1 | TAOCP 2.2.6 Arrays and Orthogonal ListsNeetCode 107 and 108 |
| 55 | Mon, Nov 8 to Sun, Nov 14 | TAOCP Vol 1 | TAOCP 2.3.1 Traversing Binary TreesNeetCode 109 and 110 |
| 56 | Mon, Nov 15 to Sun, Nov 21 | TAOCP Vol 1 | TAOCP 2.3.2 Binary Tree Representation of TreesNeetCode 111 and 112 |
| 57 | Mon, Nov 22 to Sun, Nov 28 | TAOCP Vol 1 | TAOCP 2.3.3 Other Representations of TreesNeetCode 113 and 114 |
| 58 | Mon, Nov 29 to Sun, Dec 5 | TAOCP Vol 1 | TAOCP 2.3.4 Basic Mathematical Properties of Trees (part 1)NeetCode 115 and 116 |
| 59 | Mon, Dec 6 to Sun, Dec 12 | TAOCP Vol 1 | TAOCP 2.3.4 Basic Mathematical Properties of Trees (part 2)NeetCode 117 and 118 |
| 60 | Mon, Dec 13 to Sun, Dec 19 | TAOCP Vol 1 | TAOCP 2.3.5 Lists and Garbage CollectionNeetCode 119 and 120 |
| 61 | Mon, Dec 20 to Sun, Dec 26 | TAOCP Vol 1 | TAOCP 2.4 Multilinked StructuresNeetCode 121 and 122 |
| 62 | Mon, Dec 27 to Sun, Jan 2 | TAOCP Vol 1 | TAOCP 2.5 Dynamic Storage AllocationNeetCode 123 and 124 |
| 63 | Mon, Jan 3 to Sun, Jan 9 | TAOCP Vol 1 | TAOCP 2.6 and VolNeetCode 125 and 126 |
| 64 | Mon, Jan 10 to Sun, Jan 16 | TAOCP Vol 2 | TAOCP 3.1 IntroductionNeetCode 127 and 128 · Play: Opus Magnum |
| 65 | Mon, Jan 17 to Sun, Jan 23 | TAOCP Vol 2 | TAOCP 3.2.1 The Linear Congruential MethodNeetCode 129 and 130 |
| 66 | Mon, Jan 24 to Sun, Jan 30 | TAOCP Vol 2 | TAOCP 3.2.2 Other MethodsNeetCode 131 and 132 |
| 67 | Mon, Jan 31 to Sun, Feb 6 | TAOCP Vol 2 | TAOCP 3.3.1 General Test ProceduresNeetCode 133 and 134 |
| 68 | Mon, Feb 7 to Sun, Feb 13 | TAOCP Vol 2 | TAOCP 3.3.2 Empirical TestsNeetCode 135 and 136 |
| 69 | Mon, Feb 14 to Sun, Feb 20 | TAOCP Vol 2 | TAOCP 3.3.3 Theoretical TestsNeetCode 137 and 138 |
| 70 | Mon, Feb 21 to Sun, Feb 27 | TAOCP Vol 2 | TAOCP 3.3.4 The Spectral TestNeetCode 139 and 140 |
| 71 | Mon, Feb 28 to Sun, Mar 5 | TAOCP Vol 2 | TAOCP 3.4.1 Numerical DistributionsNeetCode 141 and 142 |
| 72 | Mon, Mar 6 to Sun, Mar 12 | TAOCP Vol 2 | TAOCP 3.4.2 Random Sampling and ShufflingNeetCode 143 and 144 · Play: Opus Magnum checkpoint |
| 73 | Mon, Mar 13 to Sun, Mar 19 | TAOCP Vol 2 | TAOCP 3.5 and 3.6NeetCode 145 and 146 |
| 74 | Mon, Mar 20 to Sun, Mar 26 | TAOCP Vol 2 | TAOCP 4.1 Positional Number SystemsNeetCode 147 and 148 |
| 75 | Mon, Mar 27 to Sun, Apr 2 | TAOCP Vol 2 | TAOCP 4.2.1 Single-Precision CalculationsNeetCode 149 and 150 |
| 76 | Mon, Apr 3 to Sun, Apr 9 | TAOCP Vol 2 | TAOCP 4.2.2 Accuracy of Floating Point Arithmetic |
| 77 | Mon, Apr 10 to Sun, Apr 16 | TAOCP Vol 2 | TAOCP 4.2.3 and 4.2.4 |
| 78 | Mon, Apr 17 to Sun, Apr 23 | TAOCP Vol 2 | TAOCP 4.3.1 The Classical Algorithms |
| 79 | Mon, Apr 24 to Sun, Apr 30 | TAOCP Vol 2 | TAOCP 4.3.2 Modular ArithmeticPlay: Factorio |
| 80 | Mon, May 1 to Sun, May 7 | TAOCP Vol 2 | TAOCP 4.3.3 How Fast Can We Multiply? |
| 81 | Mon, May 8 to Sun, May 14 | TAOCP Vol 2 | TAOCP 4.4 Radix Conversion |
| 82 | Mon, May 15 to Sun, May 21 | TAOCP Vol 2 | TAOCP 4.5.1 and 4.5.2 |
| 83 | Mon, May 22 to Sun, May 28 | TAOCP Vol 2 | TAOCP 4.5.3 Analysis of Euclid's Algorithm |
| 84 | Mon, May 29 to Sun, Jun 4 | TAOCP Vol 2 | TAOCP 4.5.4 Factoring into Primes |
| 85 | Mon, Jun 5 to Sun, Jun 11 | TAOCP Vol 2 | TAOCP 4.6.1 Division of Polynomials |
| 86 | Mon, Jun 12 to Sun, Jun 18 | TAOCP Vol 2 | TAOCP 4.6.2 Factorization of Polynomials |
| 87 | Mon, Jun 19 to Sun, Jun 25 | TAOCP Vol 2 | TAOCP 4.6.3 Evaluation of Powers |
| 88 | Mon, Jun 26 to Sun, Jul 2 | TAOCP Vol 2 | TAOCP 4.6.4 Evaluation of Polynomials |
| 89 | Mon, Jul 3 to Sun, Jul 9 | TAOCP Vol 2 | TAOCP 4.7 and Vol |
| 90 | Mon, Jul 10 to Sun, Jul 16 | TAOCP Vol 3 | TAOCP 5.1.1 Inversions |
| 91 | Mon, Jul 17 to Sun, Jul 23 | TAOCP Vol 3 | TAOCP 5.1.2 Permutations of a Multiset |
| 92 | Mon, Jul 24 to Sun, Jul 30 | TAOCP Vol 3 | TAOCP 5.1.3 RunsPlay: Factorio checkpoint |
| 93 | Mon, Jul 31 to Sun, Aug 6 | TAOCP Vol 3 | TAOCP 5.1.4 Tableaux and Involutions |
| 94 | Mon, Aug 7 to Sun, Aug 13 | TAOCP Vol 3 | TAOCP 5.2.1 Sorting by Insertion |
| 95 | Mon, Aug 14 to Sun, Aug 20 | TAOCP Vol 3 | TAOCP 5.2.2 Sorting by Exchanging |
| 96 | Mon, Aug 21 to Sun, Aug 27 | TAOCP Vol 3 | TAOCP 5.2.3 Sorting by SelectionPlay: MOLEK-SYNTEZ |
| 97 | Mon, Aug 28 to Sun, Sep 3 | TAOCP Vol 3 | TAOCP 5.2.4 Sorting by Merging |
| 98 | Mon, Sep 4 to Sun, Sep 10 | TAOCP Vol 3 | TAOCP 5.2.5 Sorting by Distribution |
| 99 | Mon, Sep 11 to Sun, Sep 17 | TAOCP Vol 3 | TAOCP 5.3.1 Minimum-Comparison Sorting |
| 100 | Mon, Sep 18 to Sun, Sep 24 | TAOCP Vol 3 | TAOCP 5.3.2 and 5.3.3 |
| 101 | Mon, Sep 25 to Sun, Oct 1 | TAOCP Vol 3 | TAOCP 5.3.4 Networks for Sorting |
| 102 | Mon, Oct 2 to Sun, Oct 8 | TAOCP Vol 3 | TAOCP 5.4.1 Multiway Merging and Replacement Selection |
| 103 | Mon, Oct 9 to Sun, Oct 15 | TAOCP Vol 3 | TAOCP 5.4.2 and 5.4.3 |
| 104 | Mon, Oct 16 to Sun, Oct 22 | TAOCP Vol 3 | TAOCP 5.4.4 and 5.4.5 |
| 105 | Mon, Oct 23 to Sun, Oct 29 | TAOCP Vol 3 | TAOCP 5.4.6 Practical Considerations for Tape MergingPlay: MOLEK-SYNTEZ checkpoint |
| 106 | Mon, Oct 30 to Sun, Nov 5 | TAOCP Vol 3 | TAOCP 5.4.7 and 5.4.8 |
| 107 | Mon, Nov 6 to Sun, Nov 12 | TAOCP Vol 3 | TAOCP 5.4.9 and 5.5 |
| 108 | Mon, Nov 13 to Sun, Nov 19 | TAOCP Vol 3 | TAOCP 6.1 Sequential SearchingPlay: Satisfactory |
| 109 | Mon, Nov 20 to Sun, Nov 26 | TAOCP Vol 3 | TAOCP 6.2.1 Searching an Ordered Table |
| 110 | Mon, Nov 27 to Sun, Dec 3 | TAOCP Vol 3 | TAOCP 6.2.2 Binary Tree Searching |
| 111 | Mon, Dec 4 to Sun, Dec 10 | TAOCP Vol 3 | TAOCP 6.2.3 Balanced Trees |
| 112 | Mon, Dec 11 to Sun, Dec 17 | TAOCP Vol 3 | TAOCP 6.2.4 Multiway Trees |
| 113 | Mon, Dec 18 to Sun, Dec 24 | TAOCP Vol 3 | TAOCP 6.3 Digital Searching |
| 114 | Mon, Dec 25 to Sun, Dec 31 | TAOCP Vol 3 | TAOCP 6.4 Hashing (part 1) |
| 115 | Mon, Jan 1 to Sun, Jan 7 | TAOCP Vol 3 | TAOCP 6.4 Hashing (part 2) |
| 116 | Mon, Jan 8 to Sun, Jan 14 | TAOCP Vol 3 | TAOCP 6.5 Retrieval on Secondary Keys |
| 117 | Mon, Jan 15 to Sun, Jan 21 | TAOCP Vol 3 | TAOCP Vol 3 reviewPlay: Satisfactory checkpoint |
| 118 | Mon, Jan 22 to Sun, Jan 28 | TAOCP Vol 4A | TAOCP 7 Combinatorial Searching intro (part 1) |
| 119 | Mon, Jan 29 to Sun, Feb 4 | TAOCP Vol 4A | TAOCP 7 Combinatorial Searching intro (part 2) |
| 120 | Mon, Feb 5 to Sun, Feb 11 | TAOCP Vol 4A | TAOCP 7.1.1 Boolean Basics (part 1) |
| 121 | Mon, Feb 12 to Sun, Feb 18 | TAOCP Vol 4A | TAOCP 7.1.1 Boolean Basics (part 2) |
| 122 | Mon, Feb 19 to Sun, Feb 25 | TAOCP Vol 4A | TAOCP 7.1.2 Boolean EvaluationPlay: Last Call BBS |
| 123 | Mon, Feb 26 to Sun, Mar 4 | TAOCP Vol 4A | TAOCP 7.1.3 Bitwise Tricks and Techniques (part 1) |
| 124 | Mon, Mar 5 to Sun, Mar 11 | TAOCP Vol 4A | TAOCP 7.1.3 Bitwise Tricks and Techniques (part 2) |
| 125 | Mon, Mar 12 to Sun, Mar 18 | TAOCP Vol 4A | TAOCP 7.1.4 Binary Decision Diagrams (part 1) |
| 126 | Mon, Mar 19 to Sun, Mar 25 | TAOCP Vol 4A | TAOCP 7.1.4 Binary Decision Diagrams (part 2) |
| 127 | Mon, Mar 26 to Sun, Apr 1 | TAOCP Vol 4A | TAOCP 7.2.1.1 Generating All n-Tuples |
| 128 | Mon, Apr 2 to Sun, Apr 8 | TAOCP Vol 4A | TAOCP 7.2.1.2 Generating All Permutations |
| 129 | Mon, Apr 9 to Sun, Apr 15 | TAOCP Vol 4A | TAOCP 7.2.1.3 Generating All Combinations |
| 130 | Mon, Apr 16 to Sun, Apr 22 | TAOCP Vol 4A | TAOCP 7.2.1.4 Generating All Partitions |
| 131 | Mon, Apr 23 to Sun, Apr 29 | TAOCP Vol 4A | TAOCP 7.2.1.5 Generating All Set PartitionsPlay: Last Call BBS checkpoint |
| 132 | Mon, Apr 30 to Sun, May 6 | TAOCP Vol 4A | TAOCP 7.2.1.6 Generating All Trees |
| 133 | Mon, May 7 to Sun, May 13 | TAOCP Vol 4A | TAOCP 7.2.1.7 and Vol |
| 134 | Mon, May 14 to Sun, May 20 | TAOCP Vol 4B | TAOCP Mathematical Preliminaries Redux |
| 135 | Mon, May 21 to Sun, May 27 | TAOCP Vol 4B | TAOCP 7.2.2 Backtrack Programming (part 1) |
| 136 | Mon, May 28 to Sun, Jun 3 | TAOCP Vol 4B | TAOCP 7.2.2 Backtrack Programming (part 2) |
| 137 | Mon, Jun 4 to Sun, Jun 10 | TAOCP Vol 4B | TAOCP 7.2.2.1 Dancing Links (part 1) |
| 138 | Mon, Jun 11 to Sun, Jun 17 | TAOCP Vol 4B | TAOCP 7.2.2.1 Dancing Links (part 2) |
| 139 | Mon, Jun 18 to Sun, Jun 24 | TAOCP Vol 4B | TAOCP 7.2.2.1 Dancing Links (part 3) |
| 140 | Mon, Jun 25 to Sun, Jul 1 | TAOCP Vol 4B | TAOCP 7.2.2.1 Dancing Links (part 4) |
| 141 | Mon, Jul 2 to Sun, Jul 8 | TAOCP Vol 4B | TAOCP 7.2.2.2 Satisfiability (part 1) |
| 142 | Mon, Jul 9 to Sun, Jul 15 | TAOCP Vol 4B | TAOCP 7.2.2.2 Satisfiability (part 2) |
| 143 | Mon, Jul 16 to Sun, Jul 22 | TAOCP Vol 4B | TAOCP 7.2.2.2 Satisfiability (part 3) |
| 144 | Mon, Jul 23 to Sun, Jul 29 | TAOCP Vol 4B | TAOCP 7.2.2.2 Satisfiability (part 4) |
| 145 | Mon, Jul 30 to Sun, Aug 5 | TAOCP Vol 4B | TAOCP Vol 4B review |
Questions
How long is the cracked.guide path?
145 weeks at full pace, about 2.8 years at about 8 to 10 hours a week. Half pace doubles it; 1.5x pace takes about 2 years.
Do I need an account to use the plan generator?
No. Sign up only if you want the dates saved, the work checked and a weekly email.
What if I fall behind?
Signed in, catch-up re-dates the rest of the path from where you actually are, so you never face a wall of overdue weeks.