<?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>New projects need corny project names, so...</title>
		<link>/blogentry/186460</link>
		<atom:link href="https://www.lotterypost.com/rss/blogcomments/186460" rel="self" type="application/rss+xml" />
		<description>hypersoniq's Blog: New projects need corny project names, so...</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Original Blog Entry: New projects need corny project names, so...</title>
			<link>/blogentry/186460</link>
			<guid isPermaLink="true">/blogentry/186460</guid>
			<pubDate>Sun, 08 Sep 2024 20:03:07 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>I have begun planning of Vertical Horizon ...<br /><br />This is the combo frequency analysis program. It will be using the vertical follower analysis from Follower Foundry as the seed combo.<br /><br />Some early file read systems to put it in the correct data structure were successful.<br /><br />Initializing the list as history = [ ] creates the main list, and when reading in the rows,<br /><br />Row_x = history.append()<br /><br />Creates an addressable combo entry.<br /><br />What we have is the ability to isolate internal combos by position, so the first position of the 1,000th draw would be<br /><br />history[999][0]<br /><br />This is respecting the 0 indexing of Python.<br /><br />To gather information on a specific first digit, would need to iterate<br /><br />history[n][0] == 5<br /><br />And count history[n][1] and history[n][2] for the pick 3.<br /><br />In that way, the accumulator for the main loop could be<br /><br />For each [n][0] == 5:<br /><br />If [n][1] == 0:<br /><br />B_zero += 1<br /><br />Etc. Then the B zero through 9s will be combined with their counts into an accumulator list of lists, sorted by the count... this will then be used in printing the results side by side by highest count. Same for the C numbers.<br /><br />Whole process repeated for the history[n][1] and history [n][2] positional seeds.<br /><br />The play strategy has been revised to include only one pass at the pick 5 on a pick 3 win, eliminating the pick 2 and pick 4. Will also probably play the seed number as it is a follower pick.<br /><br />Cost...<br /><br />Pick 3 day $4<br /><br />Pick 3 eve $4<br /><br />Pick 5 day $6<br /><br />Pick 5 eve $6<br /><br />Though the pick 5 numbers won&#x27;t see the light of day until there is a pick 3 win. (If one happens)<br /><br />The hardest part of this setup will be verification... never worked across columns before in any meaningful way. Unless I count the top result from the history in excel and see if that number combo matches the frequency... that might work.... &#x5b;&#xa0;<a href="/blogentry/186460">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Blog Entry</category>
			<category>hypersoniq</category>
			<wfw:comment>https://www.lotterypost.com/blogentry/186460</wfw:comment>
		</item>
	</channel>
</rss>

