4 ms·
I respect that AoC gets very difficult and is for an audience that isn’t me. But I love the format and what I’d enjoy is a similar project where the difficulty
by Waterluvian 5y ago
I respect that AoC gets very difficult and is for an audience that isn’t me.
But I love the format and what I’d enjoy is a similar project where the difficulty doesn’t really increase, but each day is a different problem domain. Breadth not depth.
For example, perhaps we start with some data processing from a file. Then answer some basic statistics question about the data. Then maybe some basic signal processing. We form an image. We transform the image. We play the image as audio. We break it into packets of some sort then share it on a “network.” We reassemble it. We build a state machine and pass it the reassembled data in some way. We discover some new output.
Etc. etc. culminating with some fun discovery that inside that original data was a secret code or whatever.
And instead of an intense challenge, we’ve just had a fun walk through an intro to two dozen subdomains of CS/sweng. You may not have immediately known the answer to each puzzle but you never felt lost.
- zerr 5y agoInteresting, what kind of difficulty is it? Does one need to know some particular theory topics, e.g. Computational Geometry or advanced/exotic data structures & algorithms? Or is it about the size/complexity of the solution? Or is it an A-ha moment?
- cjbprime 5y agoOn the very easy end of tech interview style problems, requiring almost no computer science theory yet having concrete solutions, but there's a split between part 1 and part 2 of each challenge, and one of the most interesting parts is having to abstract the first solution to accomodate the second (which might e.g. introduce a new constraint or scale up the problem).
- d_burfoot 5y agoAoC starts easy and gets harder over the course of the month. Having done both tech interview problems and AoC, I can assure you that the later AoC questions are not on the "very easy end".
- Waterluvian 5y agoI think my best example is if you play or watch a play of Human Resource Machine. The game is relatively easy. You never feel lost. But there’s some thinking involved. And before you even realize it, you’ve implemented a linked list in Assembly.
- Jtsummers 5y agoAnd its sequel, 7 Billion Humans. Fantastic game exploring concurrency and coordination in a similar assembly-ish language. It starts off without too much trouble, but develops to some really neat challenges trying to coordinate a dozen or more humans running the same program.
- thr0w__4w4y 5y agoI like this idea. I've participated each year, only finished the 2020 one (most have 1-2 to go, never had the time & motivation to fight through it.) BTW, there is a great book that is right up this alley -- maybe you know it -- "The New Turing Omnibus: 66 Excursions in Computer Science"[0] I discovered "Omnibus" from Peter / Catonmat [1] It's 66 short, manageable topics, each ~5-8 pages: 1 Algorithms 2 Finite Automata 3 Systems of Logic 4 Simulation 5 Godel's Theorem 6 Game Trees 7 The Chomsky Hierarchy 8 Random Numbers 9 Mathematical Research 10 Program Correctness 11 Search Trees 12 Error-Corecting Codes 13 Boolean Logic 14 Regular Languages 15 Time and Space Complexity 16 Genetic Algorithms 17 The Random Access Machine 18 Spline Curves 19 Computer Vision 20 Karnaugh Maps 21 The Newton-Raphson Method 22 Minimum Spanning Trees 23 Generative Grammars 24 Recursion 25 Fast Multiplication 26 Nondeterminism 27 Perceptrons 28 Encoders and Multiplexers 29 CAT Scanning 30 The Partition Problem 31 Turing Machines 32 The Fast Fourier Transform 33 Analog Computing 34 Satisfiability 35 Sequential Sorting 36 Neural Networks That Learn 37 Public Key Cryptography 38 Sequential Cirucits 39 Noncomputerable Functions 40 Heaps and Merges 41 NP-Completeness 42 Number Systems for Computing 43 Storage by Hashing 44 Cellular Automata 45 Cook's Theorem 46 Self-Replicating Computers 47 Storing Images 48 The SCRAM 49 Shannon's Theory 50 Detecting Primes 51 Universal Turing Machines 52 Text Compression 53 Disk Operating Systems 54 NP-Complete Problems 55 Iteration and Recursion 56 VLSI Computers 57 Linear Programming 58 Predicate Calculus 59 The Halting Problem 60 Computer Viruses 61 Searching Strings 62 Parallel Computing 63 The Word Problem 64 Logic Programming 65 Relational Data Bases 66 Church's Thesis [0] https://www.amazon.com/New-Turing-Omnibus-Sixty-Six-Excursions/dp/B011DC9TV4 https://www.amazon.com/New-Turing-Omnibus-Sixty-Six-Excursio... [1] https://catonmat.net/top-100-books-part-one https://catonmat.net/top-100-books-part-one