<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sat, 16 May 2026 21:29:37 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/dumanje/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[There are more possible iterations of a game of chess than there are atoms in the known universe.]]></title><description><![CDATA[Shannon number The Shannon number, named after Claude Shannon, is a conservative lower bound (not an estimate) of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities]]></description><link>http://direct.ecency.com/steemit/@pr1m3/there-are-more-possible-iterations-of-a-game-of-chess-than-there-are-atoms-in-the-known-universe</link><guid isPermaLink="true">http://direct.ecency.com/steemit/@pr1m3/there-are-more-possible-iterations-of-a-game-of-chess-than-there-are-atoms-in-the-known-universe</guid><category><![CDATA[steemit]]></category><dc:creator><![CDATA[pr1m3]]></dc:creator><pubDate>Mon, 12 Jun 2017 22:59:03 GMT</pubDate><enclosure url="https://i.ecency.com/p/2gsjgna1uruvUuS7ndh9YqVwYGPLVszbFLwwpAYXZk3G49pc28mh9Eo9nnJ2oUXN5rY4vZ4BNKJHsVngV8F2Zw9W9eEspZWXcfEnxYZKnZXJC2fDMG?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>