<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Terminal Hacking Tool For Fallout 3</title>
	<atom:link href="http://mediumexposure.com/terminal-hacking-tool-fallout-3/feed/" rel="self" type="application/rss+xml" />
	<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/</link>
	<description>by Maxim Chernyak</description>
	<lastBuildDate>Fri, 03 Feb 2012 23:30:49 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
	<item>
		<title>By: HERP</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-17115</link>
		<dc:creator>HERP</dc:creator>
		<pubDate>Fri, 30 Sep 2011 00:13:46 +0000</pubDate>
		<guid isPermaLink="false">#comment-17115</guid>
		<description>&lt;p&gt;DERP!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>DERP!</p></div>]]></content:encoded>
	</item>
	<item>
		<title>By: John K</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-16926</link>
		<dc:creator>John K</dc:creator>
		<pubDate>Sun, 25 Sep 2011 20:01:29 +0000</pubDate>
		<guid isPermaLink="false">#comment-16926</guid>
		<description>&lt;p&gt;I am surprised there are so many positive comments because something in the code is backwards; it chooses the LEAST OPTIMAL path!!!  For example, input these 13 words:&lt;/p&gt;

&lt;p&gt;viral dared wires lines lives sorts agree mines likes parts harem lined warns&lt;/p&gt;

&lt;p&gt;If you first try &quot;lined&quot;, there can be 0, 1, 2, 3 or 4 matches, and the remaining possibilities will be at most 3.  If you first try &quot;wires&quot;, as this tool tells you to do, there can only be 2 or 3 matches, and the remaining possibilities will be (assuming wires is not correct) 5 or 7.  Compare this with http://hackfallout.analogbit.com/ and see for yourself.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>I am surprised there are so many positive comments because something in the code is backwards; it chooses the LEAST OPTIMAL path!!!  For example, input these 13 words:</p>

<p>viral dared wires lines lives sorts agree mines likes parts harem lined warns</p>

<p>If you first try &#8220;lined&#8221;, there can be 0, 1, 2, 3 or 4 matches, and the remaining possibilities will be at most 3.  If you first try &#8220;wires&#8221;, as this tool tells you to do, there can only be 2 or 3 matches, and the remaining possibilities will be (assuming wires is not correct) 5 or 7.  Compare this with <a href="http://hackfallout.analogbit.com/" rel="nofollow">http://hackfallout.analogbit.com/</a> and see for yourself.</p></div>]]></content:encoded>
	</item>
	<item>
		<title>By: J-HxC</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-15871</link>
		<dc:creator>J-HxC</dc:creator>
		<pubDate>Sun, 28 Aug 2011 23:09:32 +0000</pubDate>
		<guid isPermaLink="false">#comment-15871</guid>
		<description>&lt;p&gt;Maxim, this thing has failed me twice. In the entire time I&#039;ve been playing Fallout 3 and NV, out of all the hacked terminals, there has only been two times I have double checked all my spelling and it was unable to find a solution. Cheers to an invaluable tool that has saved me countless hours of old save reload time, and has taken some strain of my brain. You figure nothing&#039;s perfect and 2 Wrong out of hundreds is pretty damn accurate. Thanks, J-HxC&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>Maxim, this thing has failed me twice. In the entire time I&#8217;ve been playing Fallout 3 and NV, out of all the hacked terminals, there has only been two times I have double checked all my spelling and it was unable to find a solution. Cheers to an invaluable tool that has saved me countless hours of old save reload time, and has taken some strain of my brain. You figure nothing&#8217;s perfect and 2 Wrong out of hundreds is pretty damn accurate. Thanks, J-HxC</p></div>]]></content:encoded>
	</item>
	<item>
		<title>By: Justin</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-14519</link>
		<dc:creator>Justin</dc:creator>
		<pubDate>Sun, 24 Jul 2011 05:23:09 +0000</pubDate>
		<guid isPermaLink="false">#comment-14519</guid>
		<description>&lt;p&gt;I don&#039;t often look up guides on how to hack Fallout 3 terminals, but when I do, I use Medium Exposure&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>I don&#8217;t often look up guides on how to hack Fallout 3 terminals, but when I do, I use Medium Exposure</p></div>]]></content:encoded>
	</item>
	<item>
		<title>By: keplerk</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-14036</link>
		<dc:creator>keplerk</dc:creator>
		<pubDate>Mon, 11 Jul 2011 04:00:26 +0000</pubDate>
		<guid isPermaLink="false">#comment-14036</guid>
		<description>&lt;p&gt;This work in Fallout: New Vegas. Thanks.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>This work in Fallout: New Vegas. Thanks.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: david jorge</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-13081</link>
		<dc:creator>david jorge</dc:creator>
		<pubDate>Mon, 20 Jun 2011 12:26:58 +0000</pubDate>
		<guid isPermaLink="false">#comment-13081</guid>
		<description>&lt;p&gt;thak you so much i can t belive it works i was trying to gain entrance to vault 87 in little lamp light and i did it&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>thak you so much i can t belive it works i was trying to gain entrance to vault 87 in little lamp light and i did it</p>]]></content:encoded>
	</item>
	<item>
		<title>By: Mr. Pottymouth</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-11025</link>
		<dc:creator>Mr. Pottymouth</dc:creator>
		<pubDate>Mon, 09 May 2011 07:18:03 +0000</pubDate>
		<guid isPermaLink="false">#comment-11025</guid>
		<description>&lt;p&gt;As much as I like to do it manually your tool has saved my bacon a few times!&lt;/p&gt;

&lt;p&gt;Just wanted to say thanks for publishing the Terminal Hack tool.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>As much as I like to do it manually your tool has saved my bacon a few times!</p>

<p>Just wanted to say thanks for publishing the Terminal Hack tool.</p></div>]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Walker</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-10048</link>
		<dc:creator>Greg Walker</dc:creator>
		<pubDate>Thu, 14 Apr 2011 07:12:30 +0000</pubDate>
		<guid isPermaLink="false">#comment-10048</guid>
		<description>&lt;p&gt;I&#039;m not exactly sure how your algorithm works, but I believe the one I wrote is significantly better (I&#039;m not going to bother hosting it anywhere) and since yours is the first to come up on google for &#039;fallout hacking&#039; thought I&#039;d offer it up if you wanted to improve yours or for anyone else.&lt;/p&gt;

&lt;p&gt;If anyone wants the code as a full c# function email me: OZBNGQHNQDES removethis @spammotel.com&lt;/p&gt;

&lt;p&gt;Heres the part after finding the Valid Matches.&lt;/p&gt;

&lt;p&gt;Pseudo-code:
&lt;code&gt;
Loop through all ValidMatches
  For each word, count how many matches it has for each other word, keeping track of the number of 2 letter matches, number of 3 letter matches, etc
  Square each of those counts, average the non-zero values, take the words with the lowest values
    -This will make it try to find a word that reduces the count the most, because knowing the match count of it will distribute them into the most smallest buckets
&lt;/code&gt;&lt;/p&gt;

&lt;p&gt;In my limited testing it cuts it down to at most 4 or 5 after the first word, where yours often came up with 7 after the first.&lt;/p&gt;

&lt;p&gt;Written in C#, what I think is optimized so probably not super obvious to most people:
&lt;code&gt;
int MaxWordLenth = ValidMatches.Max(l =&gt; l.Length);
int[][] matrixCount = new int[ValidMatches.Count][];
for (int i = 0; i &lt; ValidMatches.Count; ++i) matrixCount[i] = new int[MaxWordLenth];

for (int i = 0; i &lt; ValidMatches.Count; ++i)
{
    for (int j = i + 1; j &lt; ValidMatches.Count; ++j)
    {
        //Filling out the matrix of matching with the least looping
        int SamePositionCount = SamePositionL(ValidMatches[i], ValidMatches[j]);
        matrixCount[i][SamePositionCount]++;
        matrixCount[j][SamePositionCount]++;
    }

    var ThisWordsValuesNotZero = matrixCount[i].Where(q =&gt; q &gt; 0);
    //Calculate the average of the squared values (This is to make the lowest average have the smallest &quot;buckets&quot;)
    double ThisAvg = ThisWordsValuesNotZero.Count() &gt; 0 ? ThisWordsValuesNotZero.Average(q =&gt; q * q) : 0.0;
    if (BestAvgDistributionCount &gt; ThisAvg)
    {
        BestAvgDistributionCount = ThisAvg;
        BestAvgDistributionWords = new List&lt;string&gt;();
    }
    if (ThisAvg == BestAvgDistributionCount)
    {
        BestAvgDistributionWords.Add(ValidMatches[i]);
    }
}
&lt;/code&gt;&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>I&#8217;m not exactly sure how your algorithm works, but I believe the one I wrote is significantly better (I&#8217;m not going to bother hosting it anywhere) and since yours is the first to come up on google for &#8216;fallout hacking&#8217; thought I&#8217;d offer it up if you wanted to improve yours or for anyone else.</p>

<p>If anyone wants the code as a full c# function email me: OZBNGQHNQDES removethis @spammotel.com</p>

<p>Heres the part after finding the Valid Matches.</p>

<p>Pseudo-code:

<div class="codecolorer-container text default" style="overflow:auto;white-space:nowrap;border:1px solid #9F9F9F;"><div class="text codecolorer" style="padding:5px;font:normal 12px/1.4em Monaco, Lucida Console, monospace;white-space:nowrap">Loop through all ValidMatches<br />
&nbsp; For each word, count how many matches it has for each other word, keeping track of the number of 2 letter matches, number of 3 letter matches, etc<br />
&nbsp; Square each of those counts, average the non-zero values, take the words with the lowest values<br />
&nbsp; &nbsp; -This will make it try to find a word that reduces the count the most, because knowing the match count of it will distribute them into the most smallest buckets</div></div>

</p>

<p>In my limited testing it cuts it down to at most 4 or 5 after the first word, where yours often came up with 7 after the first.</p>

<p>Written in C#, what I think is optimized so probably not super obvious to most people:

<div class="codecolorer-container text default" style="overflow:auto;white-space:nowrap;border:1px solid #9F9F9F;"><div class="text codecolorer" style="padding:5px;font:normal 12px/1.4em Monaco, Lucida Console, monospace;white-space:nowrap">int MaxWordLenth = ValidMatches.Max(l =&gt; l.Length);<br />
int[][] matrixCount = new int[ValidMatches.Count][];<br />
for (int i = 0; i &lt; ValidMatches.Count; ++i) matrixCount[i] = new int[MaxWordLenth];<br />
<br />
for (int i = 0; i &lt; ValidMatches.Count; ++i)<br />
{<br />
&nbsp; &nbsp; for (int j = i + 1; j &lt; ValidMatches.Count; ++j)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; //Filling out the matrix of matching with the least looping<br />
&nbsp; &nbsp; &nbsp; &nbsp; int SamePositionCount = SamePositionL(ValidMatches[i], ValidMatches[j]);<br />
&nbsp; &nbsp; &nbsp; &nbsp; matrixCount[i][SamePositionCount]++;<br />
&nbsp; &nbsp; &nbsp; &nbsp; matrixCount[j][SamePositionCount]++;<br />
&nbsp; &nbsp; }<br />
<br />
&nbsp; &nbsp; var ThisWordsValuesNotZero = matrixCount[i].Where(q =&gt; q &gt; 0);<br />
&nbsp; &nbsp; //Calculate the average of the squared values (This is to make the lowest average have the smallest &quot;buckets&quot;)<br />
&nbsp; &nbsp; double ThisAvg = ThisWordsValuesNotZero.Count() &gt; 0 ? ThisWordsValuesNotZero.Average(q =&gt; q * q) : 0.0;<br />
&nbsp; &nbsp; if (BestAvgDistributionCount &gt; ThisAvg)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; BestAvgDistributionCount = ThisAvg;<br />
&nbsp; &nbsp; &nbsp; &nbsp; BestAvgDistributionWords = new List&lt;string&gt;();<br />
&nbsp; &nbsp; }<br />
&nbsp; &nbsp; if (ThisAvg == BestAvgDistributionCount)<br />
&nbsp; &nbsp; {<br />
&nbsp; &nbsp; &nbsp; &nbsp; BestAvgDistributionWords.Add(ValidMatches[i]);<br />
&nbsp; &nbsp; }<br />
}</div></div>

</p>]]></content:encoded>
	</item>
	<item>
		<title>By: cosmicalex</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-2/#comment-8421</link>
		<dc:creator>cosmicalex</dc:creator>
		<pubDate>Sun, 27 Feb 2011 05:52:01 +0000</pubDate>
		<guid isPermaLink="false">#comment-8421</guid>
		<description>&lt;p&gt;Thank you so much I was trying to blow up the brotherhood of steel compound and the terminal was vary hard. After trying countless times just guessing this solved it in 3 try&#039;s. Again thank you.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Thank you so much I was trying to blow up the brotherhood of steel compound and the terminal was vary hard. After trying countless times just guessing this solved it in 3 try&#8217;s. Again thank you.</p>]]></content:encoded>
	</item>
	<item>
		<title>By: barfa</title>
		<link>http://mediumexposure.com/terminal-hacking-tool-fallout-3/comment-page-1/#comment-6637</link>
		<dc:creator>barfa</dc:creator>
		<pubDate>Mon, 10 Jan 2011 22:49:05 +0000</pubDate>
		<guid isPermaLink="false">#comment-6637</guid>
		<description>&lt;p&gt;sweet tool, now when will there be an android app that uses the camera so I don&#039;t have to type all the words? ;&#039;&#039;&#039;&lt;/p&gt;

&lt;p&gt;&#039;&#039;-)&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<div style=""><p></p><p>sweet tool, now when will there be an android app that uses the camera so I don&#8217;t have to type all the words? ;&#8221;&#8217;</p>

<p>&#8221;-)</p></div>]]></content:encoded>
	</item>
</channel>
</rss>

