<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/">
  <channel>
    <title>Timed Entry into RPS game using Entropy sees gains of &gt; 50% (Win/Total ratio)</title>
    <link>http://www.lotterypost.com/blogentry/31408</link>
    <atom:link href="http://www.lotterypost.com/rss/blogcomments/31408" rel="self" type="application/rss+xml" />
    <description>edge's Blog: Timed Entry into RPS game using Entropy sees gains of &gt; 50% (Win/Total ratio)</description>
    <dc:language>en-us</dc:language>
    <generator>Lottery Post RSS Generator</generator>
    <item>
      <title>Original Blog Entry: Timed Entry into RPS game using Entropy sees gains of &gt; 50% (Win/Total ratio)</title>
      <link>http://www.lotterypost.com/blogentry/31408</link>
      <guid isPermaLink="true">http://www.lotterypost.com/blogentry/31408</guid>
      <pubDate>Sat, 18 Jul 2009 23:52:40 GMT</pubDate>
      <dc:creator>edge</dc:creator>
      <description><![CDATA[<p>First a little background, what is <strong>Entropy</strong> ?</p><p>According to Wiki entry (ref. 1) In information theory, entropy is a measure of the uncertainty associated with a random variable. (there are other types of entropies such as associated with thermodynamics, but they don't apply in our context)</p><p>The concept was introduced by Claude E. Shannon in his 1948 paper &quot;A Mathematical Theory of Communication&quot;. (ref. 2)</p><p>Very short way to describe information entropy (H) is to understand it in terms of measure of certainty (maximum certainty H = 1.0) or uncertainty (maximum uncertainty H = 0.0) and of course anything in between (0.0 &lt; H &lt; 1.0)&nbsp;representing degree of (un) certainty in the information content.&nbsp;</p><p>For the purpose of using it in a random strategy game (ie RPS) we want to measure value of using H in timing profitable entry into the game when certainty of the information is&nbsp;at the lowest (H = 0.0) (see graph 1).</p><p>These single events (H = 0.0) were measured to be few (in the span of 100 game iterations) and surprisingly result in up-wards of 50% (Win/Total ratio) gain!&nbsp; when measured against a player that does &quot;blind&quot; bets.</p><p>Below, is application (ref. 3) console output representing run using 2 types of strategies (0 strategy (-) and strategy employing entropy measurement with a threshold of 0, that is a bets&nbsp;are made &lt;=&gt; [only and only iff] Entropy H = 0.0</p><p>Each run (total of 5) consists of 525 game iterations, notice player using Entropy strategy places significantly less bets than player using no strategy and betting on every single game occurence. Results are consistent and show not only gains but also that no single game resulted in the loss bet.</p><p>Strategy without(-)<br />Total Game Iterations: 525 Super Agent Played: 525 times. Wins: 179 Losses: 170 Ties: 176 Ratio Win/Total: 0.340952</p><p>Strategy with&nbsp; &nbsp;(+) Entropy (sampling time window: 5, Threshold min: 0, max: 0)<br />Total Game Iterations: 525 Super Agent Played: 49 times. Wins: 35 Losses: 14 Ties: 0 Ratio Win/Total: <strong>0.714286</strong>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;<strong>[GAIN of 2 x]</strong></p><p>Press any key to continue . . .</p><p><br />Strategy without(-)<br />Total Game Iterations: 525 Super Agent Played: 525 times. Wins: 167 Losses: 176 Ties: 182 Ratio Win/Total: 0.31809....</p><p>[ <a href="http://www.lotterypost.com/blogentry/31408">More</a> ]</p>]]></description>
      <category>* Original Blog Entry</category>
      <wfw:comment>http://www.lotterypost.com/blogentry/31408</wfw:comment>
    </item>
  </channel>
</rss>
