<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
     xmlns:admin="http://webns.net/mvcb/"
     xmlns:content="http://purl.org/rss/1.0/modules/content/"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel>
	  <title>Ask MetaFilter questions tagged with settheory</title>
      <link>http://ask.metafilter.com/tags/settheory</link>
      <description>Questions tagged with 'settheory' at Ask MetaFilter.</description>
	  <pubDate>Fri, 30 Oct 2009 13:31:34 -0800</pubDate> <lastBuildDate>Fri, 30 Oct 2009 13:31:34 -0800</lastBuildDate>

      <language>en-us</language>
	  <docs>http://blogs.law.harvard.edu/tech/rss</docs>
	  <ttl>60</ttl>	  
	<item>
	<title>Countdown</title>
	<link>http://ask.metafilter.com/136882/Countdown</link>	
	<description>Is there an enumeration of complete chess games? Has anyone made an accurate (ideally, &quot;closed form&quot;) count of possible chess games?&lt;br&gt;
&lt;br&gt;
I found an older article via Google that does a very rough guess-timate of how many complete chess games are possible.&lt;br&gt;
&lt;br&gt;
I&apos;m curious if anyone has since tried to count all possible games, given standard FIDE rules, played to completion. Presumably, for example, it is not exponential because some moves will result in an end state (&quot;checkmate&quot; or &quot;stalemate&quot;) faster than other moves.&lt;br&gt;
&lt;br&gt;
&lt;small&gt;&lt;ul&gt;&lt;li&gt;&lt;b&gt;Please do not offer speculation about the answer&lt;/b&gt;&lt;/li&gt;&lt;li&gt;&lt;b&gt;Please do not link to Google search results&lt;/b&gt; (unless you have found something that answers the question as specifically framed)&lt;/li&gt;&lt;li&gt;Thanks!&lt;/li&gt;&lt;/ul&gt;&lt;/small&gt;</description>
	<guid isPermaLink="false">tag:ask.metafilter.com,2009:site.136882</guid>
	<pubDate>Fri, 30 Oct 2009 13:31:34 -0800</pubDate>
	<category>chess</category>
	<category>enumeration</category>
	<category>math</category>
	<category>mathematics</category>
	<category>set</category>
	<category>settheory</category>
	<dc:creator>Blazecock Pileon</dc:creator>
	</item>
	<item>
	<title>Difference between a bag and a purse?</title>
	<link>http://ask.metafilter.com/92322/Difference%2Dbetween%2Da%2Dbag%2Dand%2Da%2Dpurse</link>	
	<description>What is the difference between a purse and a bag? It is 11 PM on Friday and I need to know this. My friend has a bag which I say is a purse. When I saw it I thought at first it was some girl&apos;s purse. Men can carry purses, and purses are subsets of bags, but let&apos;s have a logical definition.&lt;br&gt;
&lt;br&gt;
My theory is that a purse is accessed while being carried/worn, while backpacks and messenger bags, for example, are generally removed before opening.</description>
	<guid isPermaLink="false">tag:ask.metafilter.com,2008:site.92322</guid>
	<pubDate>Sat, 24 May 2008 20:06:36 -0800</pubDate>
	<category>accessories</category>
	<category>bags</category>
	<category>fashion</category>
	<category>purses</category>
	<category>settheory</category>
	<dc:creator>TheOnlyCoolTim</dc:creator>
	</item>
	<item>
	<title>SQL Combinations</title>
	<link>http://ask.metafilter.com/69352/SQL%2DCombinations</link>	
	<description>Any SQL / math ninja&apos;s on the green fancy a quick challenge..? So I&apos;ve got this table containing number pairs, right, and I need to compute all the possible combinations.  For example:  I have the following pairs: {1,2}, {1,3}, {3,4}, {2,5}&lt;br&gt;
&lt;br&gt;
The implementation I need will produce the following combinations: {1,2}, {1,3}, {3,4}, {2, 5}, {1,3,4}, {1,2,3}, {1,2,5}, {1,2,3,5}, {1,2,3,4}, {1,2,3,4,5}&lt;br&gt;
&lt;br&gt;
But not these:  {1,4}, {1,5}, {3,5}, {1,2,4}, {1,3,5}&lt;br&gt;
&lt;br&gt;
I know, I know, sounds like homework filter but I can assure you it&apos;s not - I&apos;m building a shopping cart app thing on LAMP and I can&apos;t quite see a clear way around this conundrum.  I mean, it could be done recursively in PHP but thats going to involve a) lots of connections / queries to the database, and b) the kind of headaches that only recursion can induce.&lt;br&gt;
&lt;br&gt;
Can you see a way of doing this in SQL?  Or even an algo which won&apos;t hammer the DB server with zillions of l&apos;il queries?</description>
	<guid isPermaLink="false">tag:ask.metafilter.com,2007:site.69352</guid>
	<pubDate>Wed, 15 Aug 2007 03:38:28 -0800</pubDate>
	<category>database</category>
	<category>settheory</category>
	<category>SQL</category>
	<dc:creator>whoojemaflip</dc:creator>
	</item>
	
	</channel>
</rss>

