<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE rss [<!ENTITY % HTMLlat1 PUBLIC "-//W3C//ENTITIES Latin 1 for XHTML//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml-lat1.ent">]>
<rss version="0.92" xml:base="http://forum.cubeman.org">
<channel>
 <title>NoLongerUnsolvedButSolved's blog</title>
 <link>http://forum.cubeman.org/?q=blog/view/148530</link>
 <description></description>
 <language>en</language>
<item>
 <title>Finally hitting depth 13 consistently with my 5x5x5 solver</title>
 <link>http://forum.cubeman.org/?q=node/view/551</link>
 <description>&lt;img src ="http://i.imgur.com/cq9J6SC.jpg"&gt;&lt;br /&gt;
&lt;br /&gt;
It finally occurred to me why my hash table was sometimes not finding the shortest solutions 100% of the time. When I upgraded my computer to one with 128 GB of RAM, I had enough to load more positions into RAM. The number of hash table entries exceeded 4.2 billion, which is more than 32 bits. I never adjusted all of my access code to use 64-bit indices which were now necessary. All I had to do was change the data type, and, lo and behold, it found a 13-move solution to this arrangement, which previously it was reporting required 14 moves!&lt;br /&gt;
&lt;br /&gt;
A very happy day for me.</description>
<pubDate>Fri, 17 Jun 2016 19:52:37 -0400</pubDate></item>
</channel>
</rss>
