<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Asteroid &#187; rpg</title>
	<atom:link href="http://asteroid.divnull.com/tags/rpg/feed/" rel="self" type="application/rss+xml" />
	<link>http://asteroid.divnull.com</link>
	<description>A mind forever meandering.</description>
	<lastBuildDate>Wed, 11 Jan 2012 00:00:34 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>An observation on the state of the gaming industry</title>
		<link>http://asteroid.divnull.com/2010/09/sota-rpg/</link>
		<comments>http://asteroid.divnull.com/2010/09/sota-rpg/#comments</comments>
		<pubDate>Thu, 09 Sep 2010 06:50:07 +0000</pubDate>
		<dc:creator>Wordman</dc:creator>
				<category><![CDATA[Commerce]]></category>
		<category><![CDATA[Gaming]]></category>
		<category><![CDATA[Predictions]]></category>
		<category><![CDATA[BattleTech]]></category>
		<category><![CDATA[gamma world]]></category>
		<category><![CDATA[rpg]]></category>

		<guid isPermaLink="false">http://asteroid.divnull.com/?p=885</guid>
		<description><![CDATA[The recent reboot of the Gamma World role-playing game flicked a switch in my brain, tuning me on to something I should have noticed sooner, and that we&#8217;re going to see a lot more of: mainstream role-playing game makers have turned the corner on what they do. Going forward, their core business will be less [...]]]></description>
			<content:encoded><![CDATA[<p>The recent reboot of the <a href="http://www.robotviking.com/2010/06/25/gamma-worlds-big-awesome-secret/"><cite>Gamma World</cite> role-playing game</a> flicked a switch in my brain, tuning me on to something I should have noticed sooner, and that we&#8217;re going to see a lot more of: mainstream role-playing game makers have turned the corner on what they do. Going forward, their core business will be less and less about producing gaming rules (with supplements <em>ad nauseum</em>) and will instead center on producing <em>gaming artifacts</em>. That is, games that, like board games, revolve around fiddly bits that are difficult for the average player to produce by himself.</p>
<p>For example, in addition to its 160-page rulebook, <cite>Gamma World</cite>, now comes with several decks of cards. None of the previous six editions of the game used cards, but now they are <em>required</em> for play. While it is possible for the end user to produce card-like artifacts themselves fairly easily, the end result is not particularly satisfying or sturdy. Producing actual cards is <a href="http://www.lybrary.com/make-your-playing-cards-a-11.html">fairly difficult, requiring specialized paper, techniques and equipment</a>. Why would you bother going through the expense, when you can just buy the professionally produced artifact for cheaper?</p>
<p>And that, really, is the point. It&#8217;s an end run around the electronic age. Rather than combat the bittorrenting horde, gaming companies will just build products that can&#8217;t be replicated in a satisfying way from an electronic copy, at least not without spending more than it would cost to just buy the original.</p>
<p>Cards are only one option (and we&#8217;ll see how long it takes before making quality cards at home becomes painless). <cite>Gamma World</cite> also comes with &#8220;two sheets of die-cut character and monster tokens&#8221;. These are, in effect, a cheaper version of miniatures but, even so, they are still artifacts the home user would have to do special work to replicate themselves. This would be easier than making cards, but still a hassle that many would be willing to pay to avoid. Plus, even more would rather use real miniatures anyway. If <cite>Gamma World</cite> is anything like <cite>Dungeons &#038; Dragons 4E</cite> (and, being rules compatible with D&#038;D4, it is) it relies heavily on tactically maneuvering pieces on a map, creating a market for the miniatures artifact. It is probably not a coincidence, for example, that the <cite>Gamma World</cite> setting can make use of many of the figures in Wizards&#8217; <a href="http://www.wizards.com/Company/Brands/Heroscape.aspx">Heroscape</a> line of miniatures that would be out of place in D&#038;D (such as the <a href="http://www.cyberfab.fr/gfx/heroscape_malliddonset/snipers.jpg">omnicron snipers</a>).</p>
<p>In a similar vein, the $100 game <a href="http://www.fantasyflightgames.com/edge_minisite_sec.asp?eidm=93&#038;esem=1">Warhammer Fantasy Roleplay</a> is based entirely around custom made dice and comes with &#8220;more than 300 cards&#8221;. (No doubt it will find uses for the extensive line of Warhammer miniatures as well.)</p>
<p>None of this is particularly new. Games like <a href="http://www.classicbattletech.com/">BattleTech</a>, which is more of a board game than an RPG, have long offered game artifacts, like the old <a href="http://www.boardgamegeek.com/boardgame/29524/battletech-reinforcements-2">Reinforcements</a> boxes, with card stock versions of most mechs with little plastic stands, and recently their map packs have <a href="http://www.classicbattletech.com/index.php?action=products&#038;mode=full&#038;id=291">become a bit more interesting</a>. But RPGs used to focus mostly on books. Those days, it seems, may be ending.</p>
<img src="http://asteroid.divnull.com/?ak_action=api_record_view&id=885&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://asteroid.divnull.com/2010/09/sota-rpg/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Inside joke</title>
		<link>http://asteroid.divnull.com/2008/05/inside-joke/</link>
		<comments>http://asteroid.divnull.com/2008/05/inside-joke/#comments</comments>
		<pubDate>Mon, 19 May 2008 23:48:15 +0000</pubDate>
		<dc:creator>Wordman</dc:creator>
				<category><![CDATA[Gaming]]></category>
		<category><![CDATA[Humor]]></category>
		<category><![CDATA[rpg]]></category>
		<category><![CDATA[thorn]]></category>

		<guid isPermaLink="false">http://asteroid.divnull.com/?p=173</guid>
		<description><![CDATA[Only seven people in the world will actually understand this, much less think it is as funny as I do. And only half of them are probably reading this. But hey, my blog, my rules. In doing some spring cleaning, I came across this scrap of paper in one of the many piles in my [...]]]></description>
			<content:encoded><![CDATA[<p>Only seven people in the world will actually understand this, much less think it is as funny as I do. And only half of them are probably reading this. But hey, my blog, my rules.</p>
<p>In doing some spring cleaning, I came across this scrap of paper in one of the many piles in my office:</p>
<p><center><img src="http://asteroid.divnull.com/images/rash.png" height="250" width="350" alt="Tanador note"/></center></p>
<p>Good times.</p>
<p>UPDATE: not long after posting this, I got a &#8220;mysterious&#8221; text page from one of the seven people saying &#8220;There is no rash.&#8221; Trust me, that was hilarious.</p>
<img src="http://asteroid.divnull.com/?ak_action=api_record_view&id=173&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://asteroid.divnull.com/2008/05/inside-joke/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Open letter to White Wolf</title>
		<link>http://asteroid.divnull.com/2008/04/open-letter-to-white-wolf/</link>
		<comments>http://asteroid.divnull.com/2008/04/open-letter-to-white-wolf/#comments</comments>
		<pubDate>Wed, 16 Apr 2008 00:47:50 +0000</pubDate>
		<dc:creator>Wordman</dc:creator>
				<category><![CDATA[Commerce]]></category>
		<category><![CDATA[Gaming]]></category>
		<category><![CDATA[DriveThruRPG]]></category>
		<category><![CDATA[Exalted]]></category>
		<category><![CDATA[pdf]]></category>
		<category><![CDATA[rpg]]></category>

		<guid isPermaLink="false">http://asteroid.divnull.com/?p=171</guid>
		<description><![CDATA[To: White Wolf The advantage of electronic books is that they are easier to store, searchable and, until now, cheaper. As you know, electronic versions of your two recent releases (Yu-Shan and Scroll of Kings) are listed for $18, nearly $5 more than books with equivalent page counts released just months ago. That&#8217;s a price [...]]]></description>
			<content:encoded><![CDATA[<p>To: White Wolf</p>
<p>The advantage of electronic books is that they are easier to store, searchable and, until now, cheaper.</p>
<p>As you know, electronic versions of your two recent releases (<cite><a href="http://rpg.drivethrustuff.com/product_info.php?products_id=55190">Yu-Shan</a></cite> and <cite><a href="http://rpg.drivethrustuff.com/product_info.php?products_id=55187">Scroll of Kings</a></cite>) are listed for $18, nearly $5 more than books with equivalent page counts released just months ago. That&#8217;s a price increase of almost 50% and marks the first time I can remember the electronic version of one of your books costs more than the print version. While retail for the print version is $25, Amazon sells it for $17. (They also continue to sell the &#8220;books with equivalent page counts&#8221; mentioned above for $17.)</p>
<p>As someone who has legally purchased electronic copies of nearly all of your <a href="http://rpg.drivethrustuff.com/index.php?filters=0_0_1810">First</a> and <a href="http://rpg.drivethrustuff.com/index.php?filters=0_0_1820">Second Edition</a> Exalted titles, I find this, of course, extremely irritating. But, more to the point, if this price change is here to stay (which I hope it doesn&#8217;t), then I will now be much more demanding of features in these electronic books that, until now, I&#8217;ve been giving you a pass on not providing. In particular, for the additional $5 for a bunch of electrons, I now expect and demand&hellip;</p>
<ul>
<li>&hellip;reduced security. At the very least, I should be permitted to edit and save my own bookmarks and have the ability to add margin notes and save them. At best, eliminate it entirely. (Yes, I do know how to strip it off, but I&#8217;d prefer not to have to.)</li>
<li>&hellip;free updated versions of all affected files whenever you make corrections or errata to existing books. (Other companies, much smaller than you, do this already, by the way.)</li>
<li>&hellip;the person producing the PDF to spend time to make sure the file size is small and the page render times fast. Many of your books (particularly the <cite><a href="http://rpg.drivethrustuff.com/product_info.php?products_id=24516&#038;it=1&#038;filters=0_0_1820">White and Black Treatises</a></cite>) have exceedingly long draw times. (A good test here is to keep clicking on the &#8220;next page&#8221; button. If you do this quickly and the majority of the pages barely render before you click the next one, it&#8217;s to slow.)
</li>
</ul>
<p>Or, you could, you know, put your prices back down to a reasonable level.</p>
<p>I learned a while ago that I follow the following pattern when buying gaming books, even if I can&#8217;t explain exactly why: if the PDF costs around a third of the cost of the printed version, I buy <em>both</em> the printed version and the PDF. If the PDF costs around half the cost of the printed version, I buy the PDF only. If the PDF costs more than half of the printed version, I buy <em>neither</em>.</p>
<p><strong>Update</strong>: I thought posted this a while ago, but it looks like I didn&#8217;t. In the interim, White Wolf released a new &#8220;<a href="http://rpg.drivethrustuff.com/product_info.php?products_id=55410">fatsplat</a>&#8221; book for the same price as other flatsplats <em>when they were first offered</em>. Older flatsplats are now $16, so it looks like White Wolf might be pricing at a premium when the book is initially released, then reducing prices later. I think this practice really, really sucks, and has made me take another big step toward abandoning Exalted entirely. In a much better move, they also, for the first time, reissued <a href="http://rpg.drivethrustuff.com/product_info.php?products_id=3671&#038;it=1&#038;filters=0_0_1820">a title</a> with corrections as a free upgrade. While I welcome this development, I must note that it is much less compelling when the bookmarks in the new version are much, much worse than those in the original. Given how easy it is to automatically generate bookmarks in programs like InDesign, this is disgusting.</p>
<img src="http://asteroid.divnull.com/?ak_action=api_record_view&id=171&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://asteroid.divnull.com/2008/04/open-letter-to-white-wolf/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Chance of Reign</title>
		<link>http://asteroid.divnull.com/2008/01/chance-of-reign/</link>
		<comments>http://asteroid.divnull.com/2008/01/chance-of-reign/#comments</comments>
		<pubDate>Thu, 31 Jan 2008 05:37:57 +0000</pubDate>
		<dc:creator>Wordman</dc:creator>
				<category><![CDATA[Gaming]]></category>
		<category><![CDATA[Greg Stolze]]></category>
		<category><![CDATA[probablity]]></category>
		<category><![CDATA[Reign]]></category>
		<category><![CDATA[rpg]]></category>

		<guid isPermaLink="false">http://asteroid.divnull.com/2008/01/chance-of-reign/</guid>
		<description><![CDATA[Based on an opinion voiced in an Exalted forum, I picked up the hardback of Reign, a game self-published by Greg Stolze. Stolze is the co-author of the incredibly good Unknown Armies and wrote the best &#8220;how to run a game&#8221; chapter that I&#8217;ve ever read (published in the otherwise unremarkable Gamma World Game Master&#8217;s [...]]]></description>
			<content:encoded><![CDATA[<p>Based on an <a href="http://www.patternspider.net/forums/viewtopic.php?p=85652#85652">opinion voiced in an Exalted forum</a>, I picked up the <a href="http://www.lulu.com/content/825234">hardback</a> of <cite><a href="http://www.gregstolze.com/reign/">Reign</a></cite>, a game self-published by <a href="http://www.gregstolze.com/">Greg Stolze</a>. Stolze is the co-author of the incredibly good <cite><a href="http://www.atlas-games.com/unknownarmies/">Unknown Armies</a></cite> and wrote the best &#8220;how to run a game&#8221; chapter that I&#8217;ve ever read (published in the otherwise unremarkable <cite><a href="http://en.wikipedia.org/wiki/Gamma_World">Gamma World</a> Game Master&#8217;s Guide</cite>), so I was excited to see how he tackled the epic fantasy genre. Mechanically, he does so with something called the <a href="http://en.wikipedia.org/wiki/ORE">One Roll Engine</a>. (If you want to sign up to a site with a not-very-helpful user interface, you can <a href="http://www.nemesis-system.com/downloads/nemesis/details.html">download a version of the basic system</a> for free.) This engine makes use of dice in a way I haven&#8217;t seen a game utilize before, and I figured I&#8217;d blog about the probability of the system because a) I didn&#8217;t immediately know how to calculate it, b) a post on how to do such probability calculations will hopefully be useful to fellow gamers and c) I wanted an excuse to play with the statistical and graphing features of <a href="http://www.apple.com/iwork/numbers/">Numbers</a>.</p>
<p><img src="http://asteroid.divnull.com/images/d10.jpg" class="inset" align="right" border="1" height="121" width="150"/>Reign uses pools of ten-sided dice (d10s), where results are determined by looking at how many dice match <em>each other</em>. It is a bit like poker, where a roll might generate, say, a three-of-a-kind, a pair, and some singles. Each of these matches is called a &#8220;set&#8221;, and the number of dice in the set is called the &#8220;width&#8221; of the set. So, for example, if you roll five dice and get 4, 4, 4, 2, 8, you have one set of width three. For many rolls in Reign, the actual number being matched, called the &#8220;height&#8221; of the set (4 in the previous example), doesn&#8217;t particularly matter. For other rolls, <em>only</em> the height matters. Still others rely on both the height and the width. Usually only a single set in a roll matters, but there are some mechanics that make use of the other sets as well. In this way, the rules in Reign pull a lot of meaning out of a single roll mechanic, and the probabilities employed are interesting but not obvious. I&#8217;ve done some (very) minor probability documentation on some other systems (an <a href="http://exalted.xi.co.nz/wiki/wiki.pl?Somori/DragonsGambit">invented five-suit card game</a> and the <a href="http://exalted.xi.co.nz/wiki/wiki.pl?ExcellencyMath">&#8220;excellencies&#8221; of Exalted</a>, for example), but this is a bit more tricky.</p>
<h3>Simple calculations</h3>
<p>The first basic observation to make is that if you have a pool with more than 10 dice in it, you will <em>always</em> get at least one set. If you have <em>n</em>+1 items that can only have <em>n</em> distinct values, at least one of those values will come up more than once. Reign is well aware of this, and has rules to match. Consequently, pools only exceed 10 dice in very extraordinary circumstances; however, these circumstances, though rare, do exist in the game, so this post will consider results with up to 15 die pools.</p>
<p>Secondly, for any given roll, the odds of achieving <em>exactly</em> a specific height are identical to achieving any other exact height. That is, odds of rolling two tens using 5d10 are exactly the same as rolling two nines. This means that, were you to build a chart where rolling height <em>x</em> means one thing and height <em>y</em> means something else, you have equal chances of getting either result. Thus, if you want one result more than the others, you need to assign that result to more than one height on the chart. Reign makes use of this idea at least once in the rules (as a hit-location table). More often, however, height is used in rules where the height must be <em>at least</em> that number or higher. This makes reaching a certain height harder as the number increases. A height of 10, for example, can only be reached if the dice conspired to built a set containing 10s, but a height of nine is reached by those same sets <em>plus</em> sets containing nines, making it more likely. As a result, when this post considers height, it will do so in the sense of reaching at least that height.</p>
<h3>Tools</h3>
<p>Because Reign deals with sets, the key technique in calculating probability is <a href="http://en.wikipedia.org/wiki/Combinatorics">combinatorics</a>. In particular, the concept of a <a href="http://en.wikipedia.org/wiki/Combinations">combination</a> is crucial. This looks scary, but you probably had to do some of this in high school math class. The basic idea is that you have some number of items in your hand, and you have to select a certain (smaller) number of those items. The combination calculation measures how many different ways you could make such as selection, where <em>order does not matter</em>. For example, say you have four cubes in your hand, one red (<span style="color: red; font-style: italic;">r</span>), one blue (<span style="color: blue; font-style: italic;">b</span>), one green(<span style="color: green; font-style: italic;">g</span>), one violet (<span style="color: darkviolet; font-style: italic;">v</span>). You are instructed to select two cubes, where the order doesn&#8217;t matter. You can do this, it turns out, six different ways: <span style="color: red; font-style: italic;">r</span><span style="color: blue; font-style: italic;">b</span>, <span style="color: red; font-style: italic;">r</span><span style="color: green; font-style: italic;">g</span>, <span style="color: red; font-style: italic;">r</span><span style="color: darkviolet; font-style: italic;">v</span>, <span style="color: blue; font-style: italic;">b</span><span style="color: green; font-style: italic;">g</span>, <span style="color: blue; font-style: italic;">b</span><span style="color: darkviolet; font-style: italic;">v</span>, <span style="color: green; font-style: italic;">g</span><span style="color: darkviolet; font-style: italic;">v</span>. This would be notated as C(4,2), read &#8220;four choose two&#8221;. Generically, C(<em>n</em>,<em>k</em>), or &#8220;<em>n</em> choose <em>k</em>&#8220;. You may also have vague memories of a <a href="http://en.wikipedia.org/wiki/Permutation">permutation</a>, which is the same idea as combination except that order <em>does</em> matter. For example, <span style="color: red; font-style: italic;">r</span><span style="color: blue; font-style: italic;">b</span> and <span style="color: blue; font-style: italic;">b</span><span style="color: red; font-style: italic;">r</span> are considered the same combination, but different permutations. A permutation of two items from a set of four is notated as P(4,2). Calculating both combinations and permutations makes use of the <a href="http://en.wikipedia.org/wiki/Factorial">factorial</a> operator. This is a fairly simple idea to wrap your head around. A number like &#8220;4 factorial&#8221;, notated &#8220;4!&#8221; just means to multiply 4 &times; 3 &times; 2 &times; 1. So <em>n</em>! just means <em>n</em> &times; <em>n</em>&minus;1 &times; <em>n</em>&minus;2 &times; &hellip; &times; 3 &times; 2 &times; 1. Combinations and permutations are calculated as follows:</p>
<table class="center">
<tr>
<td rowspan="2" style="font-size: xx-large;">C</td>
<td><em>n</em></td>
<td rowspan="2">=</td>
<td rowspan="2" style="font-size: xx-large;">(</td>
<td><em>n</em></td>
<td rowspan="2" style="font-size: xx-large;">)</td>
<td rowspan="2">=</td>
<td style="text-align: center; border-bottom: 1px solid black;"><em>n</em>!</td>
<td rowspan="2" width="100">&nbsp;</td>
<td rowspan="2" style="font-size: xx-large;">P(<em>n</em>,<em>r</em>)</td>
<td rowspan="2">=</td>
<td style="text-align: center; border-bottom: 1px solid black;"><em>n</em>!</td>
</tr>
<tr>
<td><em>k</em></td>
<td><em>k</em></td>
<td><em>k</em>! (<em>n</em> &minus; <em>k</em>)!</td>
<td>(<em>n</em> &minus; <em>r</em>)!</td>
</tr>
</table>
<p>Fortunately, before you run screaming from this, most spreadsheets (and more advanced calculators) have functions for combinatorics. Excel, for example, uses <code><a href="http://www.techonthenet.com/excel/formulas/combin.php">combin(n,k)</a></code>. It also has <code><a href="http://www.techonthenet.com/excel/formulas/permut.php">permut(n,r)</a></code>, <code><a href="http://www.techonthenet.com/excel/formulas/fact.php">fact(n)</a></code> and <code><a href="http://www.techonthenet.com/excel/formulas/power.php">power(x,y)</a></code>, which are also useful. (One note here: Numbers lacks a <code>permut(n,r)</code> method, which is extremely irritating.)</p>
<h3>Stepping-stone calculations</h3>
<p>Calculating odds of rolls like this is somewhat similar to <a href="http://en.wikipedia.org/wiki/Poker_probability">calculating odds in poker</a>: you figure out how many possible ways there are to get a certain result, and you divide by the total number of all results. This gives the percent chance of achieving that result. Calculating the total possible results for a die roll is easy: start with a single die and figure out how many results this die can yield. Unless you are using very strange dice, this will equal the number of faces on the die. For each die you add to the pool, multiply by the number of ways that die can come up. So, if you roll a d20, a d12 and a d6, the total possible outcomes are 20 &times; 12 &times; 6. Since Reign uses pools of <em>n</em> d10s, for any given roll the total possible outcomes are 10<sup><em>n</em></sup>.</p>
<p>Calculating the ways to get a given result is usually more difficult. One very trivial thing to figure out: what are the odds of all of the dice of a roll matching? In this case, all of the dice have to match, and there are ten possible values this match can have. Thus, no matter how many dice are rolled, there are only ten possible rolls that result in all of them matching. This means the probability is always 10 &divide; 10<sup><em>n</em></sup> = 1 &divide; 10<sup><em>n</em>&minus;1</sup> = 10<sup>1&minus;<em>n</em></sup>.</p>
<p>Another basic building block is also easy to calculate: when rolling <em>n</em> dice, what is the chance that you will get <em>no</em> set at all? To figure this out, you need to know how many ways you can roll the dice such that none match any of the others. So, try to actually construct such a roll, rolling one die at a time. The first die could come up as anything, so it would have 10 possible outcomes. The second die could be anything but the value of the first, so would have nine possible outcomes. The third could have eight possible values and so on. This sequence is sort of like 10! (that is 10 &times; 9 &times; 8 &times; 7 &times; 6 &times; 5 &times; 4 &times; 3 &times; 2 &times; 1) with the last few terms hacked off based on how many dice you had. If you had six dice, for example, you&#8217;d need to hack off the 4 &times; 3 &times; 2 &times; 1 part. Note that this is 4! and that &#8220;hacking off&#8221; the terms would be done by taking 10! &divide; 4!. Note that this is exactly the formula of P(10,6), above. (This is not a coincidence, but rather exactly what permutation is.) Knowing the chance of no match, you can take 1 minus this number to figure out the chance of at least one match. The outcome looks like this (note that this matches with page 57 of the main <em>Reign</em> rulebook):</p>
<table class="center">
<tr>
<td>
<table class="data">
<tr>
<th>Dice</th>
<th>Rolls without match</th>
<th>Possible rolls</th>
<th>Chance of no match</th>
<th>Chance of at least one match</th>
</tr>
<tr>
<td>1</td>
<td>P(10,1) = 10</td>
<td>10</td>
<td>100.000%</td>
<td>0.00%</td>
</tr>
<tr>
<td>2</td>
<td>P(10,2) = 90</td>
<td>100</td>
<td>90.000%</td>
<td>10.00%</td>
</tr>
<tr>
<td>3</td>
<td>P(10,3) = 720</td>
<td>1,000</td>
<td>72.000%</td>
<td>28.00%</td>
</tr>
<tr>
<td>4</td>
<td>P(10,4) = 5,040</td>
<td>10,000</td>
<td>50.400%</td>
<td>49.60%</td>
</tr>
<tr>
<td>5</td>
<td>P(10,5) = 30,240</td>
<td>100,000</td>
<td>30.240%</td>
<td>69.76%</td>
</tr>
<tr>
<td>6</td>
<td>P(10,6) = 151,200</td>
<td>1,000,000</td>
<td>15.120%</td>
<td>84.88%</td>
</tr>
<tr>
<td>7</td>
<td>P(10,7) = 604,800</td>
<td>10,000,000</td>
<td>6.048%</td>
<td>93.95%</td>
</tr>
<tr>
<td>8</td>
<td>P(10,8) = 1,814,400</td>
<td>100,000,000</td>
<td>1.814%</td>
<td>98.19%</td>
</tr>
<tr>
<td>9</td>
<td>P(10,9) = 3,628,800</td>
<td>1,000,000,000</td>
<td>0.363%</td>
<td>99.64%</td>
</tr>
<tr>
<td>10</td>
<td>P(10,10) = 3,628,800</td>
<td>10,000,000,000</td>
<td>0.036%</td>
<td>99.96%</td>
</tr>
<tr>
<td>11</td>
<td>0</td>
<td>100,000,000,000</td>
<td>0.000%</td>
<td>100.00%</td>
</tr>
</table>
</td>
<td><img src="http://asteroid.divnull.com/images/reignodds1.png" height="237" width="400"/></td>
</tr>
</table>
<p>Getting more detailed results requires more complexity. It happens that one of the tools needed to proceed requires figuring out the odds of rolling exactly one set with a given width, and all the rest of the dice not matching at all. By itself, this number is more of an intermediate result, but a general formula for figuring it out will help calculating more important results. We&#8217;ll call this formula &#8220;exact&#8221; and we do it like this:</p>
<ol>
<li>Let <em>n</em> be the pool size, i.e. the number of dice.</li>
<li>Let <em>d</em> be the number of sides. In <cite>Reign</cite>, <em>d</em> is always 10.</li>
<li>Let <em>w</em> be the desired width.</li>
<li>If you were to hand pick a set of the desired width from your pool, you would need to select the height of the set you are going to build, and a number of dice. The number of possible ways to do this is <em>d</em> &times; C(<em>n</em>,<em>w</em>).</li>
<li>The dice that are <em>not</em> part of the set have <em>d</em><sup><em>n</em>&minus;<em>w</em></sup> possible values, but some of these would either make the current set larger, or could combine to make sets of their own. We want to make sure that all of the remaining dice not only don&#8217;t match the set set, they don&#8217;t match each other, either. Since we used <em>w</em> dice to make the set, that leaves <em>n</em>&minus;<em>w</em> dice. Using ten-sided dice, the first of these dice would have nine possible ways of not matching the set. The next would only have eight possibilities, as it should match neither the set nor the previous die. The next die (if there is one), would have seven possibilities and so on. If you look at the pattern, you can see that this winds up being equal to P(<em>d</em>&minus;1,<em>n</em>&minus;<em>w</em>).</li>
<li>Taking these all together, that makes <em>d</em> &times; C(<em>n</em>,<em>w</em>) &times; P(<em>d</em>&minus;1,<em>n</em>&minus;<em>w</em>) possible ways to roll <em>n</em> <em>d</em>-sided dice such that they generate <em>exactly</em> one set of <em>exactly</em> width <em>w</em>.</li>
<li>In <cite>Reign</cite>, the formula is Exact(<em>n</em>,<em>w</em>) = 10 &times; C(<em>n</em>,<em>w</em>) &times; P(9,<em>n</em>&minus;<em>w</em>)
</li>
</ol>
<p>For reference, this formula gives the following values:</p>
<table class="center">
<tr>
<td>
<table class="data">
<tr>
<th rowspan="2">Width</th>
<th colspan="14">Dice</th>
</tr>
<tr>
<th>2</th>
<th>3</th>
<th>4</th>
<th>5</th>
<th>6</th>
<th>7</th>
<th>8</th>
<th>9</th>
<th>10</th>
<th>11</th>
<th>12</th>
<th>13</th>
<th>14</th>
<th>15</th>
</tr>
<tr>
<th>2</th>
<td>10</td>
<td>270</td>
<td>4,320</td>
<td>50,400</td>
<td>453,600</td>
<td>3,175,200</td>
<td>16,934,400</td>
<td>65,318,400</td>
<td>163,296,000</td>
<td>199,584,000</td>
<td></td>
<td></td>
<td></td>
<td></td>
</tr>
<tr>
<th>3</th>
<td></td>
<td>10</td>
<td>360</td>
<td>7,200</td>
<td>100,800</td>
<td>1,058,400</td>
<td>8,467,200</td>
<td>50,803,200</td>
<td>217,728,000</td>
<td>598,752,000</td>
<td>798,336,000</td>
<td></td>
<td></td>
<td></td>
</tr>
<tr>
<th>4</th>
<td></td>
<td></td>
<td>10</td>
<td>450</td>
<td>10,800</td>
<td>176,400</td>
<td>2,116,800</td>
<td>19,051,200</td>
<td>127,008,000</td>
<td>598,752,000</td>
<td>1,796,256,000</td>
<td>2,594,592,000</td>
<td></td>
<td></td>
</tr>
<tr>
<th>5</th>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>540</td>
<td>15,120</td>
<td>282,240</td>
<td>3,810,240</td>
<td>38,102,400</td>
<td>279,417,600</td>
<td>1,437,004,800</td>
<td>4,670,265,600</td>
<td>7,264,857,600</td>
<td></td>
</tr>
<tr>
<th>6</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>630</td>
<td>20,160</td>
<td>423,360</td>
<td>6,350,400</td>
<td>69,854,400</td>
<td>558,835,200</td>
<td>3,113,510,400</td>
<td>10,897,286,400</td>
<td>18,162,144,000</td>
</tr>
<tr>
<th>7</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>720</td>
<td>25,920</td>
<td>604,800</td>
<td>9,979,200</td>
<td>119,750,400</td>
<td>1,037,836,800</td>
<td>6,227,020,800</td>
<td>23,351,328,000</td>
</tr>
<tr>
<th>8</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>810</td>
<td>32,400</td>
<td>831,600</td>
<td>14,968,800</td>
<td>194,594,400</td>
<td>1,816,214,400</td>
<td>11,675,664,000</td>
</tr>
<tr>
<th>9</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>900</td>
<td>39,600</td>
<td>1,108,800</td>
<td>21,621,600</td>
<td>302,702,400</td>
<td>3,027,024,000</td>
</tr>
<tr>
<th>10</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>990</td>
<td>47,520</td>
<td>1,441,440</td>
<td>30,270,240</td>
<td>454,053,600</td>
</tr>
<tr>
<th>11</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>1,080</td>
<td>56,160</td>
<td>1,834,560</td>
<td>41,277,600</td>
</tr>
<tr>
<th>12</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>1,170</td>
<td>65,520</td>
<td>2,293,200</td>
</tr>
<tr>
<th>13</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>1,260</td>
<td>75,600</td>
</tr>
<tr>
<th>14</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
<td>1,350</td>
</tr>
<tr>
<th>15</th>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td></td>
<td>10</td>
</tr>
</table>
</td>
</tr>
</table>
<h3>Calculating width odds</h3>
<p>Armed with this information we can start answering real questions about the probability of specific results. Unfortunately, there is no one formula that provides a generic answer. Each roll of <em>n</em> dice acts a bit like a poker hand of <em>n</em> single-suited cards or, more closely, a roll in a game of <a href="http://www.math.uah.edu/stat/games/PokerDice.xhtml">poker dice</a> (which is essentially a simplified version of <a href="http://mathworld.wolfram.com/Yahtzee.html">Yahtzee</a>). You have to look at the various possible results, and count them independently. Unfortunately, you have to do this separately for each value of <em>n</em>. We&#8217;ll show details of <em>n</em>=7, since it is large enough for interesting things to occur. With seven dice, you have 10<sup>7</sup> possible rolls, with the following possibilities:</p>
<ul>
<li><em>No match (0x)</em>. This we calculated above: P(10,7)</li>
<li><em>Single pair (2x)</em>. This we calculated above: Exact(7,2)</li>
<li><em>Two pair (2x,2x)</em>. There are C(10,2) ways to select the heights of the pairs. The first pair can be selected C(7,2) ways, the second C(5,2). The remaining three die can come up P(8,3) different ways without matching the two pair or creating new pair of their own (that is, 8 &times; 7 &times; 6). So, the  total number of exactly two pair rolls with seven dice is C(10,2) &times; C(7,2) &times; C(5,2) &times; P(8,3). Note that this suggests a general formula for the number of exactly two pair results for any number of dice <em>n</em>: C(10,2) &times; C(<em>n</em>,2) &times; C(<em>n</em>&minus;2,2) &times; P(8,<em>n</em>&minus;4), with the realization that this is only possible for some values of <em>n</em> (i.e. if <em>n</em> is less than 4, you can&#8217;t actually build two pair, and P(8,<em>n</em>&minus;4) becomes undefined as well).</li>
<li><em>Three pair (2x,2x,2x)</em>. Similar to two pair, using this general formula: C(10,3) &times; C(<em>n</em>,2) &times; C(<em>n</em>&minus;2,2) &times; C(<em>n</em>&minus;4,2) &times; P(7,<em>n</em>&minus;6).</li>
<li><em>Single triple (3x)</em>. This we calculated above: Exact(7,3)</li>
<li><em>Triple and a pair (3x,2x)</em>. Ten ways to select the height of the triple, the dice for which can be chosen C(7,3) ways. That leaves nine possibilities for the height of the pair, the dice of which can be selected C(4,2) ways. For the remaining two dice, there are 8 possible values for the height for the first and seven for the second (otherwise they match either each other or one of the other sets). Note that this is P(8,2). The total is then 10 &times; C(7,3) &times; 9 &times; C(4,2) &times; P(8,2). Again, a general formula suggests itself: 10 &times; C(<em>n</em>,3) &times; 9 &times; C(<em>n</em>&minus;3,2) &times; P(8,<em>n</em>&minus;5)</li>
<li><em>Triple and two pair (3x,2x,2x)</em>. Ten ways to select the height of the triple, the dice for which can be chosen C(7,3) ways. There are C(9,2) ways to select the heights of the pairs. The first pair can be selected C(4,2) ways, the second C(2,2). The remaining three die can come up 7 different ways without matching the other sets (note that this is P(7,1)). 10 &times; C(7,3) &times; C(9,2) &times; C(4,2) &times; C(2,2). For more than seven dice, there would dice left over that could not match the value of any of the sets or each other, so permutations of the seven remaining possible values would be used: 10 &times; C(<em>n</em>,3) &times; C(9,2) &times; C(<em>n</em>&minus;3,2) &times; C(<em>n</em>&minus;5,2) &times; P(7,<em>n</em>&minus;7).</li>
<li><em>Two triples</em>. Calculated much like two pair, with a general formula of C(10,2) &times; C(<em>n</em>,3) &times; C(<em>n</em>&minus;3,3) &times; P(8,<em>n</em>&minus;6).</li>
<li><em>Four of a kind (4x)</em>. This we calculated above: Exact(7,4)</li>
<li><em>Four of a kind and a pair (4x,2x)</em>. Similar to a triple and a pair: 10 &times; C(<em>n</em>,4) &times; 9 &times; C(<em>n</em>&minus;4,2) &times; P(8,<em>n</em>&minus;6)</li>
<li><em>Five of a kind (5x)</em>. This we calculated above: Exact(7,5)</li>
<li><em>Five of a kind and a pair (5x,2x)</em>. Similar to a triple and a pair: 10 &times; C(<em>n</em>,5) &times; 9 &times; C(<em>n</em>&minus;5,2) &times; P(8,<em>n</em>&minus;7)</li>
<li><em>Six of a kind (6x)</em>. This we calculated above: Exact(7,6)</li>
<li><em>Seven of a kind (7x)</em>. This we calculated above: Exact(7,7)</li>
</ul>
<p>You can do similar analysis of all the other lengths, and you end up with the table below. Each row in the table shows a possible set combination that may be rolled, and the general formula to figure out how many possible outcomes will generate that set combination. Naturally, not all combinations are possible for a given number of dice. Try as you might, you&#8217;ll never get a width three set from two dice. Each cell in the table shows two different bits of information for given result for a given number of dice. The first is the numeric result of that number. The second, in <strong>bold</strong>, is the percentage chance of that result when rolling that many dice. Because the table gets obnoxious as the number of dice increases, this only shows results for two to 10 dice, but you should be able to use techniques shown above to extend it to more if you need to. (I also wrote some really horrid Python code to double-check these numbers by counting the sets made by every possible roll from 2 to 10 dice. It all matches.)</p>
<table class="center">
<tr>
<td>
<table class="data">
<tr>
<th rowspan="2">Result</th>
<th rowspan="2">General Formula</th>
<th colspan="14">Dice Rolled</th>
</tr>
<tr>
<th>2</th>
<th>3</th>
<th>4</th>
<th>5</th>
<th>6</th>
<th>7</th>
<th>8</th>
<th>9</th>
<th>10</th>
</tr>
<tr>
<th>0x</th>
<td>P(10,n)</td>
<td>90<br /><strong>90.0%</strong></td>
<td>720<br /><strong>72.0%</strong></td>
<td>5,040<br /><strong>50.4%</strong></td>
<td>30,240<br /><strong>30.24%</strong></td>
<td>151,200<br /><strong>15.120%</strong></td>
<td>604,800<br /><strong>6.0480%</strong></td>
<td>1,814,400<br /><strong>1.81440%</strong></td>
<td>3,628,800<br /><strong>0.362880%</strong></td>
<td>3,628,800<br /><strong>0.0362880%</strong></td>
</tr>
<tr>
<th>2x</th>
<td>10 &times; C(n,2) &times; P(9,n&minus;2)</td>
<td>10<br /><strong>10.0%</strong></td>
<td>270<br /><strong>27.0%</strong></td>
<td>4,320<br /><strong>43.2%</strong></td>
<td>50,400<br /><strong>50.40%</strong></td>
<td>453,600<br /><strong>45.360%</strong></td>
<td>3,175,200<br /><strong>31.7520%</strong></td>
<td>16,934,400<br /><strong>16.93440%</strong></td>
<td>65,318,400<br /><strong>6.531840%</strong></td>
<td>163,296,000<br /><strong>1.6329600%</strong></td>
</tr>
<tr>
<th>3x</th>
<td>10 &times; C(n,3) &times; P(9,n&minus;3)</td>
<td><strong></strong></td>
<td>10<br /><strong>1.0%</strong></td>
<td>360<br /><strong>3.6%</strong></td>
<td>7,200<br /><strong>7.20%</strong></td>
<td>100,800<br /><strong>10.080%</strong></td>
<td>1,058,400<br /><strong>10.5840%</strong></td>
<td>8,467,200<br /><strong>8.46720%</strong></td>
<td>50,803,200<br /><strong>5.080320%</strong></td>
<td>217,728,000<br /><strong>2.1772800%</strong></td>
</tr>
<tr>
<th>4x</th>
<td>10 &times; C(n,4) &times; P(9,n&minus;4)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.1%</strong></td>
<td>450<br /><strong>0.45%</strong></td>
<td>10,800<br /><strong>1.080%</strong></td>
<td>176,400<br /><strong>1.7640%</strong></td>
<td>2,116,800<br /><strong>2.11680%</strong></td>
<td>19,051,200<br /><strong>1.905120%</strong></td>
<td>127,008,000<br /><strong>1.2700800%</strong></td>
</tr>
<tr>
<th>5x</th>
<td>10 &times; C(n,5) &times; P(9,n&minus;5)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.01%</strong></td>
<td>540<br /><strong>0.054%</strong></td>
<td>15,120<br /><strong>0.1512%</strong></td>
<td>282,240<br /><strong>0.28224%</strong></td>
<td>3,810,240<br /><strong>0.381024%</strong></td>
<td>38,102,400<br /><strong>0.3810240%</strong></td>
</tr>
<tr>
<th>6x</th>
<td>10 &times; C(n,6) &times; P(9,n&minus;6)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.001%</strong></td>
<td>630<br /><strong>0.0063%</strong></td>
<td>20,160<br /><strong>0.02016%</strong></td>
<td>423,360<br /><strong>0.042336%</strong></td>
<td>6,350,400<br /><strong>0.0635040%</strong></td>
</tr>
<tr>
<th>7x</th>
<td>10 &times; C(n,7) &times; P(9,n&minus;7)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.0001%</strong></td>
<td>720<br /><strong>0.00072%</strong></td>
<td>25,920<br /><strong>0.002592%</strong></td>
<td>604,800<br /><strong>0.0060480%</strong></td>
</tr>
<tr>
<th>8x</th>
<td>10 &times; C(n,8) &times; P(9,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.00001%</strong></td>
<td>810<br /><strong>0.000081%</strong></td>
<td>32,400<br /><strong>0.0003240%</strong></td>
</tr>
<tr>
<th>9x</th>
<td>10 &times; C(n,9) &times; P(9,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.000001%</strong></td>
<td>900<br /><strong>0.0000090%</strong></td>
</tr>
<tr>
<th>10x</th>
<td>10 &times; C(n,10) &times; P(9,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10<br /><strong>0.0000001%</strong></td>
</tr>
<tr>
<th>2x,2x</th>
<td>C(10,2) &times; C(n,2) &times; C(n&minus;2,2) &times; P(8,n&minus;4)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>270<br /><strong>2.7%</strong></td>
<td>10,800<br /><strong>10.80%</strong></td>
<td>226,800<br /><strong>22.680%</strong></td>
<td>3,175,200<br /><strong>31.7520%</strong></td>
<td>31,752,000<br /><strong>31.75200%</strong></td>
<td>228,614,400<br /><strong>22.861440%</strong></td>
<td>1,143,072,000<br /><strong>11.4307200%</strong></td>
</tr>
<tr>
<th>3x,2x</th>
<td>10 &times; C(n,3) &times; 9 &times; C(n&minus;3,2) &times; P(8,n&minus;5)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>900<br /><strong>0.90%</strong></td>
<td>43,200<br /><strong>4.320%</strong></td>
<td>1,058,400<br /><strong>10.5840%</strong></td>
<td>16,934,400<br /><strong>16.93440%</strong></td>
<td>190,512,000<br /><strong>19.051200%</strong></td>
<td>1,524,096,000<br /><strong>15.2409600%</strong></td>
</tr>
<tr>
<th>3x,3x</th>
<td>C(10,2) &times; C(n,3) &times; C(n&minus;3,3) &times; P(8,n&minus;6)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>900<br /><strong>0.090%</strong></td>
<td>50,400<br /><strong>0.5040%</strong></td>
<td>1,411,200<br /><strong>1.41120%</strong></td>
<td>25,401,600<br /><strong>2.540160%</strong></td>
<td>317,520,000<br /><strong>3.1752000%</strong></td>
</tr>
<tr>
<th>4x,2x</th>
<td>10 &times; C(n,4) &times; 9 &times; C(n&minus;4,2) &times; P(8,n&minus;6)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>1,350<br /><strong>0.135%</strong></td>
<td>75,600<br /><strong>0.7560%</strong></td>
<td>2,116,800<br /><strong>2.11680%</strong></td>
<td>38,102,400<br /><strong>3.810240%</strong></td>
<td>476,280,000<br /><strong>4.7628000%</strong></td>
</tr>
<tr>
<th>4x,3x</th>
<td>10 &times; C(n,4) &times; 9 &times; C(n&minus;4,3) &times; P(8,n&minus;7)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>3,150<br /><strong>0.0315%</strong></td>
<td>201,600<br /><strong>0.20160%</strong></td>
<td>6,350,400<br /><strong>0.635040%</strong></td>
<td>127,008,000<br /><strong>1.2700800%</strong></td>
</tr>
<tr>
<th>4x,4x</th>
<td>C(10,2) &times; C(n,4) &times; C(n&minus;4,4) &times; P(8,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>3,150<br /><strong>0.00315%</strong></td>
<td>226,800<br /><strong>0.022680%</strong></td>
<td>7,938,000<br /><strong>0.0793800%</strong></td>
</tr>
<tr>
<th>5x,2x</th>
<td>10 &times; C(n,5) &times; 9 &times; C(n&minus;5,2) &times; P(8,n&minus;7)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>1,890<br /><strong>0.0189%</strong></td>
<td>120,960<br /><strong>0.12096%</strong></td>
<td>3,810,240<br /><strong>0.381024%</strong></td>
<td>76,204,800<br /><strong>0.7620480%</strong></td>
</tr>
<tr>
<th>5x,3x</th>
<td>10 &times; C(n,5) &times; 9 &times; C(n&minus;5,3) &times; P(8,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>5,040<br /><strong>0.00504%</strong></td>
<td>362,880<br /><strong>0.036288%</strong></td>
<td>12,700,800<br /><strong>0.1270080%</strong></td>
</tr>
<tr>
<th>5x,4x</th>
<td>10 &times; C(n,5) &times; 9 &times; C(n&minus;5,4) &times; P(8,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>11,340<br /><strong>0.001134%</strong></td>
<td>907,200<br /><strong>0.0090720%</strong></td>
</tr>
<tr>
<th>5x,5x</th>
<td>C(10,2) &times; C(n,5) &times; C(n&minus;5,5) &times; P(8,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>11,340<br /><strong>0.0001134%</strong></td>
</tr>
<tr>
<th>6x,2x</th>
<td>10 &times; C(n,6) &times; 9 &times; C(n&minus;6,2) &times; P(8,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>2,520<br /><strong>0.00252%</strong></td>
<td>181,440<br /><strong>0.018144%</strong></td>
<td>6,350,400<br /><strong>0.0635040%</strong></td>
</tr>
<tr>
<th>6x,3x</th>
<td>10 &times; C(n,6) &times; 9 &times; C(n&minus;6,3) &times; P(8,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>7,560<br /><strong>0.000756%</strong></td>
<td>604,800<br /><strong>0.0060480%</strong></td>
</tr>
<tr>
<th>6x,4x</th>
<td>10 &times; C(n,6) &times; 9 &times; C(n&minus;6,4) &times; P(8,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>18,900<br /><strong>0.0001890%</strong></td>
</tr>
<tr>
<th>7x,2x</th>
<td>10 &times; C(n,7) &times; 9 &times; C(n&minus;7,2) &times; P(8,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>3,240<br /><strong>0.000324%</strong></td>
<td>259,200<br /><strong>0.0025920%</strong></td>
</tr>
<tr>
<th>7x,3x</th>
<td>10 &times; C(n,7) &times; 9 &times; C(n&minus;7,3) &times; P(8,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10,800<br /><strong>0.0001080%</strong></td>
</tr>
<tr>
<th>8x,2x</th>
<td>10 &times; C(n,8) &times; 9 &times; C(n&minus;8,2) &times; P(8,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>4,050<br /><strong>0.0000405%</strong></td>
</tr>
<tr>
<th>2x,2x,2x</th>
<td>C(10,3) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />C(n&minus;4,2) &times; P(7,n&minus;6)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>10,800<br /><strong>1.080%</strong></td>
<td>529,200<br /><strong>5.2920%</strong></td>
<td>12,700,800<br /><strong>12.70080%</strong></td>
<td>190,512,000<br /><strong>19.051200%</strong></td>
<td>1,905,120,000<br /><strong>19.0512000%</strong></td>
</tr>
<tr>
<th>3x,2x,2x</th>
<td>C(10,2) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />8 &times; C(n&minus;4,3) &times; P(7,n&minus;7)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>75,600<br /><strong>0.7560%</strong></td>
<td>4,233,600<br /><strong>4.23360%</strong></td>
<td>114,307,200<br /><strong>11.430720%</strong></td>
<td>1,905,120,000<br /><strong>19.0512000%</strong></td>
</tr>
<tr>
<th>3x,3x,2x</th>
<td>C(10,2) &times; C(n,3) &times; C(n&minus;3,3) &times;<br />8 &times; C(n&minus;6,2) &times; P(7,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>201,600<br /><strong>0.20160%</strong></td>
<td>12,700,800<br /><strong>1.270080%</strong></td>
<td>381,024,000<br /><strong>3.8102400%</strong></td>
</tr>
<tr>
<th>3x,3x,3x</th>
<td>C(10,3) &times; C(n,3) &times; C(n&minus;3,3) &times;<br />C(n&minus;6,6) &times; P(7,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>201,600<br /><strong>0.020160%</strong></td>
<td>14,112,000<br /><strong>0.1411200%</strong></td>
</tr>
<tr>
<th>4x,2x,2x</th>
<td>C(10,2) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />8 &times; C(n&minus;4,4) &times; P(7,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>151,200<br /><strong>0.15120%</strong></td>
<td>9,525,600<br /><strong>0.952560%</strong></td>
<td>285,768,000<br /><strong>2.8576800%</strong></td>
</tr>
<tr>
<th>4x,3x,2x</th>
<td>10 &times; C(n,4) &times; 9 &times; C(n&minus;4,3) &times;<br />8 &times; C(n&minus;7,3) &times; P(7,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>907,200<br /><strong>0.090720%</strong></td>
<td>63,504,000<br /><strong>0.6350400%</strong></td>
</tr>
<tr>
<th>4x,3x,3x</th>
<td>C(10,2) &times; C(n,3) &times; C(n&minus;3,3) &times;<br />8 &times; C(n&minus;6,4) &times; P(7,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>1,134,000<br /><strong>0.0113400%</strong></td>
</tr>
<tr>
<th>4x,4x,2x</th>
<td>C(10,2) &times; C(n,4) &times; C(n&minus;4,4) &times;<br />8 &times; C(n&minus;8,2) &times; P(7,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>1,134,000<br /><strong>0.0113400%</strong></td>
</tr>
<tr>
<th>5x,2x,2x</th>
<td>C(10,2) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />8 &times; C(n&minus;4,5) &times; P(7,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>272,160<br /><strong>0.027216%</strong></td>
<td>19,051,200<br /><strong>0.1905120%</strong></td>
</tr>
<tr>
<th>5x,3x,2x</th>
<td>10 &times; C(n,5) &times; 9 &times; C(n&minus;5,3) &times;<br />8 &times; C(n&minus;8,3) &times; P(7,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>1,814,400<br /><strong>0.0181440%</strong></td>
</tr>
<tr>
<th>6x,2x,2x</th>
<td>C(10,2) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />8 &times; C(n&minus;4,6) &times; P(7,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>453,600<br /><strong>0.0045360%</strong></td>
</tr>
<tr>
<th>2x,2x,2x,2x</th>
<td>C(10,4) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />C(n&minus;4,2) &times; C(n&minus;6,2) &times; P(6,n&minus;8)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>529,200<br /><strong>0.52920%</strong></td>
<td>28,576,800<br /><strong>2.857680%</strong></td>
<td>714,420,000<br /><strong>7.1442000%</strong></td>
</tr>
<tr>
<th>3x,2x,2x,2x</th>
<td>C(10,3) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />C(n&minus;4,2) &times; 7 &times; C(n&minus;6,3) &times; P(6,n&minus;9)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>6,350,400<br /><strong>0.635040%</strong></td>
<td>381,024,000<br /><strong>3.8102400%</strong></td>
</tr>
<tr>
<th>3x,3x,2x,2x</th>
<td>C(10,2) &times; C(n,3) &times; C(n&minus;3,3) &times;<br />C(8,2) &times; C(n&minus;6,2) &times; C(n&minus;8,2) &times; P(6,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>31,752,000<br /><strong>0.3175200%</strong></td>
</tr>
<tr>
<th>4x,2x,2x,2x</th>
<td>C(10,3) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />C(n&minus;4,2) &times; 7 &times; C(n&minus;6,4) &times; P(6,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>15,876,000<br /><strong>0.1587600%</strong></td>
</tr>
<tr>
<th>2x,2x,2x,2x,2x</th>
<td>C(10,5) &times; C(n,2) &times; C(n&minus;2,2) &times;<br />C(n&minus;4,2) &times; C(n&minus;6,2) &times; C(n&minus;8,2) &times; P(4,n&minus;10)</td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td><strong></strong></td>
<td>28,576,800<br /><strong>0.2857680%</strong></td>
</tr>
</table>
</td>
</tr>
</table>
<h3>Calculating height</h3>
<p>As mentioned above, calculating odds for height is only interesting when you need a roll of <em>at least</em> a given height. Such calculation is surprisingly cumbersome, even if you mostly leave width out of it. In order for width to &#8220;count&#8221;, you must have at least one match, and this is what makes things hard to figure. It is honestly easier just to write code to count all possible outcomes, but if you want to figure it out do the following:</p>
<ol>
<li>Let <em>n</em> be the pool size, i.e. the number of dice.</li>
<li>Let <em>d</em> be the number of sides. In <cite>Reign</cite>, <em>d</em> is always 10.</li>
<li>Let <em>h</em> be the minimum height needed. Naturally, 0&lt;<em>h</em>&le;<em>d</em>.</li>
<li>You now need to break the problem into sub-problems. So let <em>m</em> take on values from 2 to <em>n</em>. For each value of <em>m</em>, figure out the following:
<ol>
<li>Figure out how many rolls of <em>n</em> dice of <em>d</em> sides generate exactly <em>m</em> dice that have values of <em>h</em> or greater. This can be done with a function X(<em>n</em>,<em>d</em>,<em>m</em>,<em>h</em>) = C(<em>n</em>,<em>m</em>) &times; (<em>d</em>-(<em>h</em>-1))<sup><em>m</em></sup> &times; (<em>h</em>-1)<sup>(<em>n</em>-<em>m</em>)</sup>. Note that when <em>h</em>=1 and <em>m</em>=<em>n</em>, the final term in that function is 0<sup>0</sup>, which is technically undefined, so is omitted in that case.</li>
<li>Figure out how many possible ways the <em>n</em> dice of <em>d</em> sides can come up. We did this above: <em>d</em><sup><em>n</em></sup>.</li>
<li>Find the probability of X(<em>n</em>,<em>d</em>,<em>m</em>,<em>h</em>). This is just the value of the function, divided by the total number of possible rolls. So ProbX<sub><em>m</em></sub> = X(<em>n</em>,<em>d</em>,<em>m</em>,<em>h</em>) &divide; <em>d</em><sup><em>n</em></sup>.</li>
<li>Now, given the <em>m</em> dice that came up <em>h</em> or greater, figure out the number of possible ways those dice can match. We do this much the same way we figured out the chance of at least one match, above. This time, though, we have only <em>d</em>-(<em>h</em>-1) possible values. So the possible ways to have <em>no</em> match with these dice is P(<em>d</em>-(<em>h</em>-1),<em>m</em>). The number of possible ways these dice can come up is &divide; (<em>d</em>-(<em>h</em>-1))<sup><em>m</em></sup>. So Y(<em>d</em>,<em>m</em>,<em>h</em>) = (<em>d</em>-(<em>h</em>-1))<sup><em>m</em></sup> &minus; P(<em>d</em>-(<em>h</em>-1),<em>m</em>).</li>
<li>Figure ProbY<sub><em>m</em></sub> = Y(<em>d</em>,<em>m</em>,<em>h</em>) &divide; (<em>d</em>-(<em>h</em>-1))<sup><em>m</em></sup>.</li>
<li>Remember Prob<sub><em>m</em></sub> = ProbX<sub><em>m</em></sub> &times; ProbY<sub><em>m</em></sub>.</li>
</ol>
</li>
<li>Now add up all values of Prob<sub><em>m</em></sub>, and you have the probability of rolling at least height <em>h</em> on <em>n</em> dice of <em>d</em> sides.
</li>
</ol>
<p>This looks like this, again with the total number of rolls that meet a given height, followed by the percentage chance:</p>
<table class="center">
<tr>
<td>
<table class="data">
<tr>
<th rowspan="2">Height</th>
<th colspan="9">Dice Rolled</th>
</tr>
<tr>
<th>2</th>
<th>3</th>
<th>4</th>
<th>5</th>
<th>6</th>
<th>7</th>
<th>8</th>
<th>9</th>
<th>10</th>
</tr>
<tr>
<th>1</th>
<td>10<br /><strong>10.0%</strong></td>
<td>280<br /><strong>28.0%</strong></td>
<td>4,960<br /><strong>49.60%</strong></td>
<td>69,760<br /><strong>69.760%</strong></td>
<td>848,800<br /><strong>84.8800%</strong></td>
<td>9,395,200<br /><strong>93.95200%</strong></td>
<td>98,185,600<br /><strong>98.185600%</strong></td>
<td>996,371,200<br /><strong>99.6371200%</strong></td>
<td>9,996,371,200<br /><strong>99.96371200%</strong></td>
</tr>
<tr>
<th>2</th>
<td>9<br /><strong>9.0%</strong></td>
<td>252<br /><strong>25.2%</strong></td>
<td>4,491<br /><strong>44.91%</strong></td>
<td>63,954<br /><strong>63.954%</strong></td>
<td>792,225<br /><strong>79.2225%</strong></td>
<td>8,952,624<br /><strong>89.52624%</strong></td>
<td>95,403,447<br /><strong>95.403447%</strong></td>
<td>982,427,886<br /><strong>98.2427886%</strong></td>
<td>9,941,058,909<br /><strong>99.41058909%</strong></td>
</tr>
<tr>
<th>3</th>
<td>8<br /><strong>8.0%</strong></td>
<td>224<br /><strong>22.4%</strong></td>
<td>4,016<br /><strong>40.16%</strong></td>
<td>57,888<br /><strong>57.888%</strong></td>
<td>729,600<br /><strong>72.9600%</strong></td>
<td>8,413,056<br /><strong>84.13056%</strong></td>
<td>91,453,568<br /><strong>91.453568%</strong></td>
<td>957,516,032<br /><strong>95.7516032%</strong></td>
<td>9,803,680,256<br /><strong>98.03680256%</strong></td>
</tr>
<tr>
<th>4</th>
<td>7<br /><strong>7.0%</strong></td>
<td>196<br /><strong>19.6%</strong></td>
<td>3,535<br /><strong>35.35%</strong></td>
<td>51,562<br /><strong>51.562%</strong></td>
<td>660,835<br /><strong>66.0835%</strong></td>
<td>7,771,456<br /><strong>77.71456%</strong></td>
<td>86,191,903<br /><strong>86.191903%</strong></td>
<td>918,898,750<br /><strong>91.8898750%</strong></td>
<td>9,546,080,131<br /><strong>95.46080131%</strong></td>
</tr>
<tr>
<th>5</th>
<td>6<br /><strong>6.0%</strong></td>
<td>168<br /><strong>16.8%</strong></td>
<td>3,048<br /><strong>30.48%</strong></td>
<td>44,976<br /><strong>44.976%</strong></td>
<td>585,840<br /><strong>58.5840%</strong></td>
<td>7,022,784<br /><strong>70.22784%</strong></td>
<td>79,471,872<br /><strong>79.471872%</strong></td>
<td>863,672,832<br /><strong>86.3672832%</strong></td>
<td>9,124,660,224<br /><strong>91.24660224%</strong></td>
</tr>
<tr>
<th>6</th>
<td>5<br /><strong>5.0%</strong></td>
<td>140<br /><strong>14.0%</strong></td>
<td>2,555<br /><strong>25.55%</strong></td>
<td>38,130<br /><strong>38.130%</strong></td>
<td>504,525<br /><strong>50.4525%</strong></td>
<td>6,162,000<br /><strong>61.62000%</strong></td>
<td>71,144,375<br /><strong>71.144375%</strong></td>
<td>788,768,750<br /><strong>78.8768750%</strong></td>
<td>8,490,265,625<br /><strong>84.90265625%</strong></td>
</tr>
<tr>
<th>7</th>
<td>4<br /><strong>4.0%</strong></td>
<td>112<br /><strong>11.2%</strong></td>
<td>2,056<br /><strong>20.56%</strong></td>
<td>31,024<br /><strong>31.024%</strong></td>
<td>416,800<br /><strong>41.6800%</strong></td>
<td>5,184,064<br /><strong>51.84064%</strong></td>
<td>61,057,792<br /><strong>61.057792%</strong></td>
<td>690,950,656<br /><strong>69.0950656%</strong></td>
<td>7,588,071,424<br /><strong>75.88071424%</strong></td>
</tr>
<tr>
<th>8</th>
<td>3<br /><strong>3.0%</strong></td>
<td>84<br /><strong>8.4%</strong></td>
<td>1,551<br /><strong>15.51%</strong></td>
<td>23,658<br /><strong>23.658%</strong></td>
<td>322,575<br /><strong>32.2575%</strong></td>
<td>4,083,936<br /><strong>40.83936%</strong></td>
<td>49,057,983<br /><strong>49.057983%</strong></td>
<td>566,816,382<br /><strong>56.6816382%</strong></td>
<td>6,357,469,311<br /><strong>63.57469311%</strong></td>
</tr>
<tr>
<th>9</th>
<td>2<br /><strong>2.0%</strong></td>
<td>56<br /><strong>5.6%</strong></td>
<td>1,040<br /><strong>10.40%</strong></td>
<td>16,032<br /><strong>16.032%</strong></td>
<td>221,760<br /><strong>22.1760%</strong></td>
<td>2,856,576<br /><strong>28.56576%</strong></td>
<td>34,988,288<br /><strong>34.988288%</strong></td>
<td>412,797,440<br /><strong>41.2797440%</strong></td>
<td>4,731,954,176<br /><strong>47.31954176%</strong></td>
</tr>
<tr>
<th>10</th>
<td>1<br /><strong>1.0%</strong></td>
<td>28<br /><strong>2.8%</strong></td>
<td>523<br /><strong>5.23%</strong></td>
<td>8,146<br /><strong>8.146%</strong></td>
<td>114,265<br /><strong>11.4265%</strong></td>
<td>1,496,944<br /><strong>14.96944%</strong></td>
<td>18,689,527<br /><strong>18.689527%</strong></td>
<td>225,159,022<br /><strong>22.5159022%</strong></td>
<td>2,639,010,709<br /><strong>26.39010709%</strong></td>
</tr>
</table>
</td>
</tr>
<tr>
<td><img src="http://asteroid.divnull.com/images/reignodds2.png" height="392" width="677"/></td>
</tr>
</table>
<img src="http://asteroid.divnull.com/?ak_action=api_record_view&id=156&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://asteroid.divnull.com/2008/01/chance-of-reign/feed/</wfw:commentRss>
		<slash:comments>9</slash:comments>
		</item>
		<item>
		<title>Burying the dragon</title>
		<link>http://asteroid.divnull.com/2007/08/burying-the-dragon/</link>
		<comments>http://asteroid.divnull.com/2007/08/burying-the-dragon/#comments</comments>
		<pubDate>Thu, 16 Aug 2007 18:00:03 +0000</pubDate>
		<dc:creator>Wordman</dc:creator>
				<category><![CDATA[Gaming]]></category>
		<category><![CDATA[d&d]]></category>
		<category><![CDATA[Dragon]]></category>
		<category><![CDATA[OGL]]></category>
		<category><![CDATA[rpg]]></category>

		<guid isPermaLink="false">http://asteroid.divnull.com/2007/08/burying-the-dragon/</guid>
		<description><![CDATA[Unsurprisingly, after canceling all of its licensing agreements, publisher Wizards of the Coast (WotC) is releasing Dungeons &#38; Dragons, 4th Edition. While a forum thread seems to be tracking all the details, one thing strikes me about their announcement: it doesn&#8217;t make any mention of the Open Gaming License (OGL) or the d20 System. Since [...]]]></description>
			<content:encoded><![CDATA[<p>Unsurprisingly, after <a href="http://asteroid.divnull.com/2007/04/dragon/">canceling all of its licensing agreements</a>, publisher <a href="http://www.wizards.com/">Wizards of the Coast</a> (WotC) is <a href="http://home.businesswire.com/portal/site/google/index.jsp?ndmViewId=news_view&#038;newsId=20070816005037">releasing Dungeons &amp; Dragons, 4th Edition</a>.</p>
<p>While a <a href="http://www.enworld.org/showthread.php?t=204119">forum thread</a> seems to be tracking all the details, one thing strikes me about their announcement: it doesn&#8217;t make any mention of the <a href="http://en.wikipedia.org/wiki/Open_Gaming_License">Open Gaming License</a> (OGL) or the <a href="http://en.wikipedia.org/wiki/D20_System">d20 System</a>. Since WotC has the power to revoke the latter, I&#8217;m assuming that they will soon do so, probably as quietly as possible. So you may want to download the <a href="http://www.d20srd.org/">SRD</a> while you still can. <strong>Update:</strong> <a href="http://www.enworld.org/showpost.php?p=3703604">Evidently</a>, during a press conference, Wizards did state that 4th Edition <em>would</em> use OGL and a new SRD. This still doesn&#8217;t prevent them from revoking d20, however.</p>
<p>One other interesting bit is their on-line strategy, which really does look a bit like they are trying to pull a Steve Jackson and become the central, perhaps only, online hub for the game, all built around the horribly named <a href="http://www.gleemax.com/articles/faq.html">Gleemax</a>. Though I can&#8217;t find a more official link, in another <a href="http://www.rplionline.com/boards/viewtopic.php?t=546">forum post</a>, something called &#8220;D&#038;D Insider Fact Sheet&#8221; is reproduced, claiming this is &#8220;one community to rule them all&#8221;.</p>
<p>You can bet that non-WotC publishers of d20 games will be scrambling. Perhaps they will move to Green Ronin&#8217;s <a href="http://true20.com/">True20</a> license, which seems to have been constructed specifically to deal with this eventuality.</p>
<p>Wizards is clearly betting that their fan base will follow them. I&#8217;m not sure that&#8217;s true. It&#8217;s not clear to me if the Third Edition succeeded on its own merits, or because the OGL and d20 gave players a much larger and more diverse product line. I suspect the latter. </p>
<img src="http://asteroid.divnull.com/?ak_action=api_record_view&id=140&type=feed" alt="" />]]></content:encoded>
			<wfw:commentRss>http://asteroid.divnull.com/2007/08/burying-the-dragon/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

