Hacker News new | past | comments | ask | show | jobs | submit login

> so long as the officers can have a quantum mixture of ranks and regiments.

With that relaxation, it’s trivial, isn’t it? Just put identical officers on each square that are a mix of 1/36th of each of the 36 (rank, regiment) combinations.

They must be restricting the amount of entanglement somehow to make this an interesting result. From glancing the paper, I didn’t see what they did. Can anybody explain?

For example, is it already hard to find a solution if you disallow only that one trivial solution?




You are thinking continuous relaxation which is a lot less thight as entanglement enforces additional rules.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: