• 0 Posts
  • 24 Comments
Joined 2 years 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’ve been really enjoying it, even in its limited state. Jetpacks are a total game changer, and I love that the fuel lasts a long time. There’s still a few obvious QoL additions needed, especially with stuff like the cargo ships (gotta type the name in?!), but otherwise it’s got a really strong foundation. Also, elevators are amazing; just realized last night that one cam connect wire to the cab. Really excited to see how the game develops in the future (traaaaaains).


  • 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.