GitXplorerGitXplorer
g

Scotland-Yard

public
10 stars
2 forks
1 issues

Commits

List of commits on branch master.
Unverified
4f615e219c5a46bf08c62320e85677207675a10a

Added code to generate DOT files.

ggeeksam committed 15 years ago
Unverified
d84dbb5020c0d9bfb7dda28cf6ca11a49ac08a2b

tiny refactor

ggeeksam committed 15 years ago
Unverified
2a78b51a8c8f4452d11d5890d6c1d86bd58ce6eb

Add full board, new board validations, and tests.

ggeeksam committed 15 years ago
Unverified
15fefd7adfd5a6b3bbed10b4a7956ed518612fee

well, that wasn't as hard as I expected it to be

ggeeksam committed 15 years ago
Unverified
2b102e84fd9c7ae72fd818fa8ae78237ce0027ef

Initial commit

ggeeksam committed 15 years ago

README

The README file for this repository.

I played the Scotland Yard board game on Christmas 2009, and was quite amused to note that it's basically a search-evasion graph game. It seemed to me (based on one quick and one long game) that the game was rather unbalanced in favor of Mr. X [at least, if the person playing Mr. X is reasonably good at it].

So, I decided that it might be fun to write a tool that would help the detectives figure out where Mr. X could possibly be, given the information about his last known whereabouts and the kind of tickets he used.

At the moment, this is purely for my own entertainment, but if you find it interesting, by all means let me know.

I took a photo of the actual board, but as of this writing it's on my other computer. So I used the alternate version created by Ivo van der Horst, available at [ http://www.boardgamegeek.com/image/407682/scotland-yard ]. Ivo notes that different versions of the game have incompatible graphs -- I'll take his word for it, but keep in mind that you may want to check your board against the graph if you want to try to actually use this in gameplay.