Crown of Ancient Glory

Crown of Ancient Glory is an adventure module for the Dungeons & Dragons fantasy role-playing game. It was published by TSR in 1987, and designed by Stephen Bourne. Its cover art is by Keith Parkinson, with interior art by Chris Miller and cartography by Dave S. LaForce. The module's associated code is X13 and its TSR product code is TSR 9218. This module was developed and intended for use with the Dungeons & Dragons Expert Set and Companion Set rules.

Crown of Ancient Glory
CodeX13
TSR Product Code9218
Rules requiredD&D Expert Set
Character levels7-10
AuthorsStephen Bourne
First published1987
Linked modules
X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, XL1, XSOLO, XS2

Plot summary

In Crown of Ancient Glory, the player characters must find the heir to the kingdom of Vestland and retrieve the magical Sonora Crown to unite the country before the Ethengar Khanate invades.[1] The module includes plans for a longship.[1]

The player characters assist the kingdom of Vestland, whose High King has recently died. They must also recover the missing holy Sonora Crown, which is also a powerful artifact. The heir to the kingdom was lost at birth, and the players must determine the identity and location of the lawful heir of Vestland. The characters must deal with traitors and spies from within, and invaders from the forces of the Ethengar Khanate, massing on the borders to take advantage of Vestland's plight.

Publication history

X13 Crown of Ancient Glory was written by Stephen Bourne, with a cover by Keith Parkinson and interior illustrations by Chris Miller, and was published by TSR in 1987 as a 64-page booklet with an outer folder.[1]

Reception
gollark: Oh, this is a good idea, yes.
gollark: Do you need some OTHER data structure?
gollark: Can this actually be done whatsoever?!
gollark: i.e. imagine you have some documents which say "bee" lots, and some which say "apio" lots, and you want to look up ones with "apio" and "bee", *without* just retrieving all the documents for each and computing the intersection.
gollark: So I know approximately how inverted index things work, but HOW the APIO FORM do you efficiently do intersectiony queries on them?

References
  1. Schick, Lawrence (1991). Heroic Worlds: A History and Guide to Role-Playing Games. Prometheus Books. p. 149. ISBN 0-87975-653-5.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.