• 0 Posts
  • 50 Comments
Joined 1 year ago
cake
Cake day: June 21st, 2023

help-circle













  • I’ve been playing Heart of the Machine, and really enjoying it. It’s a fascinating 4x ish in a future city, in a bit of an inversion of AI Wars (same developer). Before playing, I was merely intrigued, but now I’m excitedly awaiting where it goes. It was, however, initially difficult to figure out what to do. Perhaps more UX is going to be useful here.


  • I’m pretty sure this is what Tim Rogers from Action Button Reviews has. His masterpiece Boku no Natsuyasumi review goes into a lot of detail about it. The end of part 5 had me literally sobbing in my chair for the first time in perhaps 20-some-odd years, followed immediately by a very confused laughing at a surprise hbomberguy appearance. I’d highly recommend watching it - it’s quite the long form journey.





  • For the purposes of OPs problem (P v NP), it considers not particular solutions, but general algorithmic approaches. Thus, we consider things as either Hard (exponential time, by size of input), or Easy (only polynomial time, by size of input).

    A number of important problems fall into this general class of Hard problems: Sudoku, Traveling Salesman, Bin Packing, etc. These all have initial setups where solving them takes exponential time.

    On the other hand, as an example of an easy problem, consider sorting a list of numbers. It’s really easy to determine if a lost is sorted, and it’s always relatively fast/easy to sort the list, no matter what setup it had initially.