Originally Posted by B-80
High school, its not difficult, I just don't want to do something if it is not like worth doing, 3/4 of the class is doing a text based rpg.
Whats the traveling salesman?
A guy needs to visit a number of cities. There are roads connecting the cities and he needs to find the shortest route that will hit all the cities.
It is a NP-Hard problem... the only way of solving it is try every possible solution. The problem is as you add a city, it gets vastly harder to calculate. With like 30 cities, most computers would take too long to solve. A human guessing could probably get a good enough solution in less time. These are problems that the current solution is to use brute-force and calculate everything. However, once you have the solution... it takes a few seconds to check if it is right. Solve one of these NP-hard or NP-complete problems and you would be considered a genius!
How about a variation on the 8-Queens problem? Instead of finding the location of the 8-queens, create a program that will calculate the most number of a single type of chess piece on a board without killing each other.