» About     » Archive     » Authors     » Search     » Random     » Statistics     » Forum     » RSS Feed     Updates Monday-Friday

No. 414: Let's check this one out on BoardGameGeek.com!

First | Previous | 2016-06-13 | Next | Latest

Let's check this one out on BoardGameGeek.com!

First | Previous | 2016-06-13 | Next | Latest

Strip by: David Morgan-Mar, Andrew Coker, Tim Mason

T-Rex: I've been playing Travelling Salesman Problem:[1]
T-Rex: The BOARD GAME.
T-Rex: You have to visit as many medieval German cities as you can in one continuous route, as quickly as possible.[2]
Utahraptor: Sounds nerdy.
T-Rex: No, it's a perfectly plausible historical optimisation problem scenario.[3]
T-Rex: In the expansion you get to roster a group of nurses at each city.[4]
T-Rex: It's rated NP-hard.

The author writes:

[1] Travelling salesman problem, Wikipedia.

[2] Thurn und Taxis, pretty much.

[3] Which doesn't sound nerdy at all.

[4] Nurse scheduling problem, Wikipedia.