MoM Librarian Database + printout

By Aelitafrommars, in Mansions of Madness

So this is a little something that started out as a way to keep track of monster stats w/o using the base cards. It then expanded into a library for the map cards.
I think the most useful feature is to sort map cards by name or expansion symbol, and see their back/front names, and then have them sorted that way in a card index. My card index ran out of space once i expanded outside the 2ed box, though. :P It's not very immescive to alt-tab over to a database to find the tile quicker, but it has taught me where to look in a quicker manner without actually using it live. I don't know if it's of value to anyone but i thought i might aswell share the current version, which includes all expansions/collections for 2nd edition to this date.

This local database does require either Open Office Base or some other tool that can use the .odb format/extension.
MoM2e_librarian_2017-02-11_Ellen_Larsson.odb

It could also be used as an aid for map construction analysis if you're so inclined. "Water" means whater that has any technical meaning; hence the beach, for example, doesn't count as a tile "with water". Number of connecting sides could roughly be broken into the following functions:
1: Dead end. 2: True corridor. 3: Fork. 4: Crossroads. 5: Semi-open. 6 and up: Open.

However, some dead ends are deeper than others, and some true corridors also contain dead ends, to name a few inconsistencies. Prime example: Nursery/Bathroom 2 are on the same card side. Bathroom 2 is an independent corridor, and Nursery is an independent dead end. You cannot traverse from one to the other directly via this card. Flea Market can have 7 or 5 traversable sides, depending on what other cards are laid next to it. Database notes 7 because that's the potential.

Last but not least, a simple printout for handling monsters without using the base cards. There's other out there that look better and have the theme right, but this one's up to date. :ph34r: MoM2e_MonsterChart_Ellen_Larsson_v1_0.pdf

If you have use for any of it (or simply had a look); let me know if you find something that's off. Thanks!

Edited by Aelitafrommars
8 hours ago, Aelitafrommars said:

Clicking this gives me the following error:
"

Sorry, there is a problem

The page you are trying to access is not available for your account.

Error code: 2C171/1

"

Ouch. Thanks for the heads-up! I've tested while logged in (works for me) and from my phone (logged out, doen't work, same as your result). I can't seem to any upload options changing this behaviour, so i currently don't know what it is about. I've PM:ed staff.

Edit: They haven't gotten back to me on the topic just yet, but i thought you might want to try this one. It's an offsite upload. Just to be sure/safe, I scrubbed all flavor texts and unique wordings from the printout (in case that is considered a violation of some sort- it just it me it might).

So it's just the stats, sorted first by name, then by traits. No flavor this time.
http://docdro.id/n96MUkv

Edited by Aelitafrommars
edited for temporary solution

Same problem with the first file too. I was interested in seeing how that might help organize the map tiles. It gets hectic with all the expansions!

I see. Here's a dropbox link:
https://www.dropbox.com/s/2i1qt5yf2ogmoe0/MoM2e_librarian_2017-02-11_Ellen_Larsson.odb?dl=0

I suspect most people will find it just as clunky. But for me, it worked having the tiles sorted alphabetically in a card indexed box. The beveled side is indexed.
Searching (sql commands or by sorting the base) the database gives which room pairing is on which card and where it was in my card index. Now, this is only efficient for solo play. When playing as a group, i've prepared them alphabetically and in piles by expansion/collection, and distribute them as evenly as possible between players.

If i weren't such a novice at python, i'd like to build a leaner interface to the db. As it stands now, the memory of certain tile pairings from writing it down serves me at least as good as the db itself.