Hacker News new | ask | show | jobs
by FrozenVoid 2873 days ago
Classifying tasks into priorities. 1.Urgent and required. Sorted by urgency. 2.Required. Waits until all #1 completes. 3.Optional. Waits until all #2 completes. 4.Leisure/Misc. Waits until all #3 completes.

Reducing wasted space by putting items with lower usage into storage space category that is in proportion to usage: 0.Items with daily use priority 0. 1.Items which aren't used daily get priority -1. 2.Items which aren't used weekly get priority -2. 3.Items which aren't used monthly get priority -3. etc, the less used items occupy their own category(e.g. yearly use "yearly storage space") .

Reducing decision space iteratively: 1.Enumerating all possible choices/options. 2.Discarding all low-quality choices. 3.Discarding all mediocre choices. 4.Selecting a set of top choices. 5.Writing down a comparison table for #4. 6.Filling the table in #5 7.Eliminating choices that sound worse than average. 8.Repeat #7 until you're left with one choice.

Solving complex problems by breaking them into sub-problems. 1.Formulating on paper the scope of the problem as separate sub-problems. 2.Sorting the sub-problems in order of difficulty. 3.Connecting the sub-problems to their potential solutions. Like a graph from sub-problems -> solutions 4.Selecting the most connected solution. 5.Improving the solution to include more connections(so a single solution solves all or most sub-problems in #2) 6.If a solution can't be improved, try next most connected solution. Focus on the solutions that can be improved. 7.The best-performing solution is implemented. 8.Repeat with next best solution.