enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Manual of the Planes - Wikipedia

    en.wikipedia.org/wiki/Manual_of_the_Planes

    The Manual of the Planes (abbreviated MoP [1]) is a manual for the Dungeons & Dragons role-playing game.This text addresses the planar cosmology of the game universe.. The original book (for use with Advanced Dungeons & Dragons 1st Edition) was published in 1987 by TSR, Inc. [2]

  3. List of Dungeons & Dragons rulebooks - Wikipedia

    en.wikipedia.org/wiki/List_of_Dungeons_&_Dragons...

    In the Dungeons & Dragons (D&D) fantasy role-playing game, rule books contain all the elements of playing the game: rules to the game, how to play, options for gameplay, stat blocks and lore of monsters, and tables the Dungeon Master or player would roll dice for to add more of a random effect to the game. Options for gameplay mostly involve ...

  4. Xanathar's Guide to Everything - Wikipedia

    en.wikipedia.org/wiki/Xanathar's_Guide_to_Everything

    Official product page on Wizards of the Coast's D&D website; Free excerpts (PDFs) released as rewards during the D&D Extra Life 2017 fundraiser: $10k Reward: Sample list of random encounters; $15k Reward: Sample list of suggested character names; $20k Reward: Sample life events for characters; $25k Reward: List of new wizard spells

  5. GURPS - Wikipedia

    en.wikipedia.org/wiki/GURPS

    Role-playing games of the 1970s and 1980s, such as Dungeons & Dragons, generally used random numbers generated by dice rolls to assign statistics to player characters. In 1978, Jackson designed a new character generation system for the microgames Melee and Wizard that used a point-buy system: players are given a fixed number of points with ...

  6. Karger's algorithm - Wikipedia

    en.wikipedia.org/wiki/Karger's_algorithm

    A cut (,) in an undirected graph = (,) is a partition of the vertices into two non-empty, disjoint sets =.The cutset of a cut consists of the edges {:,} between the two parts. . The size (or weight) of a cut in an unweighted graph is the cardinality of the cutset, i.e., the number of edges between the two parts

  7. Template:Random page in category - Wikipedia

    en.wikipedia.org/wiki/Template:Random_page_in...

    No description. Template parameters [Edit template data] Parameter Description Type Status Category 1 Category from which page will be selected Page name optional Namespace ns no description Unknown optional type type no description Unknown optional action action no description Unknown optional text text no description Unknown optional Examples {{Random page in category}} would produce on ...

  8. Extractor (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Extractor_(mathematics)

    An (,,,,)-extractor is a bipartite graph with nodes on the left and nodes on the right such that each node on the left has neighbors (on the right), which has the added property that for any subset of the left vertices of size at least , the distribution on right vertices obtained by choosing a random node in and then following a random edge to ...

  9. Fiend Folio - Wikipedia

    en.wikipedia.org/wiki/Fiend_Folio

    The Monstrous Compendium Fiend Folio Appendix (ISBN 1-56076-428-7) was published by TSR, Inc. in April 1992, for use with the 2nd edition AD&D rules. It is the fourteenth volume of the Monstrous Compendium series (abbreviated "MC14"), consisting of a cardboard cover, sixty four loose-leaf pages, and four divider pages.