algorithms, games

Mind the Overlap – JobShop Problem

Usually I am all about how to solve any problem using AI. This time it’s different.

A classical NP-hard problem of a JobShopScheduling is here to see and here to download and to play it by hand. What can I say? It’s extremely hard for computers and for people as well.

Still, every child can try it on her/his Android and possibly be as good as a top mathematician.


A Short Debate

Him: Let me tell you, what you don’t understand. While various AIs are possible and often very useful in everyday life, the so called general AI isn’t possible. It’s something completely different and very likely impossible.

Me: It is you, who don’t understand. It’s only the question of the domain. The chess domain is only one of them.

Him: Chess is a stupid and easy game.

Me: Brave words for someone, who lend me a book 30 years ago, where the fundamental premise was that a computer will never be as good at chess as some humans are. But never  mind that. Chess is a hard domain and our real world is even a harder domain. But only for a degree, or for a few degrees. AGI is just another narrow AI with this world as its playing domain.