This is really an algorithm jam, not a game jam. I want to spend the month of November working on NP-complete problems. Computer science professors act like these problems are constantly popping up.
I want to zerg swarm these problems in the hopes that someone finds some cool solution, but my reddit posts have only netted 3 participants so far. This jam is intended for normal programmers who have some knowledge of NP-complete problems but don't have PHDs. I'm counting on the power of 1000 code monkeys to stumble across things no one has noticed.
Hypothetically, someone might find some use for these in games. My goal for November is to create an open source toolkit that I can use to solve special cases of NP-complete problems. I would like to model procedural generation as a boolean satisfiability problem, but I have neither procedural generation nor a game. Yes, my plans are backwards, but Nondeterministic November has alliteration.
Here's some examples of fun projects to work on for this jam:
- Solve an NP-complete problem.
- Convert an NP-complete problem into another NP-complete problem.
- Prove that a problem is or isn't NP-complete.
- Write a mathematical proof of whether P=NP or not.
- Find some new application for an NP-complete algorithm.
- Allocate more computing resources to an NP-complete problem. For instance, this could be using the graphics card to perform mathematical computations. Or it could be multi-threading or using a network of computers.
For more information, visit the jam: