|
Dave Kreskowiak wrote:Wrong again!
100 : 511247092564
Exactly this time !
Regards, R
|
|
|
|
|
Great!
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
What base?
The length is 10 -- in some base I haven't determined yet.
modified 2-Dec-17 1:10am.
|
|
|
|
|
string Morris(int S, int N)
{
string projectPath = System.IO.Path.GetFullPath(@"..\..\..\");
using (BinaryWriter writer = new BinaryWriter(File.Open(projectPath + "input.txt", FileMode.Create)))
{
writer.Write(S > 2);
writer.Write(S == 2);
}
for (int i = 1; i < N; i++)
{
Debug.WriteLine(i+1);
using (BinaryReader reader = new BinaryReader(File.Open(projectPath + "input.txt", FileMode.Open)))
{
int count = 1;
bool currMSB = reader.ReadBoolean();
bool currLSB = reader.ReadBoolean();
bool nextMSB, nextLSB;
using (BinaryWriter writer = new BinaryWriter(File.Open(projectPath + "output.txt", FileMode.Create)))
{
while (reader.BaseStream.Position != reader.BaseStream.Length)
{
nextMSB = reader.ReadBoolean();
nextLSB = reader.ReadBoolean();
if ((currMSB == nextMSB) && (currLSB == nextLSB))
{
count++;
}
else
{
writer.Write(count > 2);
writer.Write(count == 2);
writer.Write(currMSB);
writer.Write(currLSB);
currMSB = nextMSB;
currLSB = nextLSB;
count = 1;
}
}
writer.Write(count > 2);
writer.Write(count == 2);
writer.Write(currMSB);
writer.Write(currLSB);
}
}
File.Delete(projectPath + "input.txt");
System.IO.File.Copy(projectPath + "output.txt", projectPath + "input.txt");
System.IO.File.WriteAllText(projectPath + "output.txt", string.Empty);
}
StringBuilder output = new StringBuilder();
using (BinaryReader reader = new BinaryReader(File.Open(projectPath + "input.txt", FileMode.Open)))
{
bool nextMSB, nextLSB;
while (reader.BaseStream.Position != reader.BaseStream.Length)
{
nextMSB = reader.ReadBoolean();
nextLSB = reader.ReadBoolean();
if (nextMSB)
output.Append("3");
else
{
if (nextLSB)
output.Append("2");
else
output.Append("1");
}
}
}
return output.ToString();
}
Seems to work quite well, but what did you do?
|
|
|
|
|
Interesting but I question if this is actually writing one byte per value? Don't have time to test right now.
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
I suspect that it is using a byte for each boolean value. As per the usual answers:
Why is a boolean 4 bytes in .NET? - Stack Overflow[^]
I could store them in a BitVector32 or a BitArray and write that to the file, but I don't have the time to implement it now.
|
|
|
|
|
I tried doing this in a BitArray, but found it to be limited in flexibility and performance. This was about 10 years that I originally worked on this problem.
I was doing some cleaning around the drive to get rid of old stuff and ran into the project. Then, of course, I just had to run it again and maybe update the code a little bit. 
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
string MorrisBitVector32(int S, int N)
{
int[] _masks = new int[32];
{
_masks[0] = BitVector32.CreateMask();
}
for (int i = 1; i < 32; i++)
{
_masks[i] = BitVector32.CreateMask(_masks[i - 1]);
}
string projectPath = System.IO.Path.GetFullPath(@"..\..\..\");
using (BinaryWriter writer = new BinaryWriter(File.Open(projectPath + "input.txt", FileMode.Create)))
{
BitVector32 v = new BitVector32();
v[_masks[0]] = S >= 2;
v[_masks[1]] = S != 2;
writer.Write(v.Data);
}
for (int i = 1; i < N; i++)
{
Debug.WriteLine(i + 1);
using (BinaryReader reader = new BinaryReader(File.Open(projectPath + "input.txt", FileMode.Open)))
{
bool currMSB, currLSB, firstRun;
firstRun = true;
currMSB = false;
currLSB = false;
int count = 0;
int k = 0;
BitVector32 outputBits = new BitVector32();
using (BinaryWriter writer = new BinaryWriter(File.Open(projectPath + "output.txt", FileMode.Create)))
{
while (reader.BaseStream.Position != reader.BaseStream.Length)
{
BitVector32 inputBits = new BitVector32(reader.ReadInt32());
if (firstRun)
{
count = 1;
currMSB = inputBits[_masks[0]];
currLSB = inputBits[_masks[1]];
}
bool nextMSB, nextLSB;
for (int j = (firstRun ? 2 : 0); j < 32; j += 2)
{
nextMSB = inputBits[_masks[j]];
nextLSB = inputBits[_masks[j + 1]];
if (!(nextLSB || nextMSB))
{
break;
}
if ((currMSB == nextMSB) && (currLSB == nextLSB))
{
count++;
}
else
{
if (k == 32)
{
writer.Write(outputBits.Data);
outputBits = new BitVector32();
k = 0;
outputBits[_masks[k]] = count >= 2;
k++;
outputBits[_masks[k]] = count != 2;
k++;
outputBits[_masks[k]] = currMSB;
k++;
outputBits[_masks[k]] = currLSB;
k++;
currMSB = nextMSB;
currLSB = nextLSB;
count = 1;
}
else
{
outputBits[_masks[k]] = count >= 2;
k++;
outputBits[_masks[k]] = count != 2;
k++;
outputBits[_masks[k]] = currMSB;
k++;
outputBits[_masks[k]] = currLSB;
k++;
currMSB = nextMSB;
currLSB = nextLSB;
count = 1;
}
}
if (firstRun)
firstRun = false;
}
}
if (k == 32)
{
writer.Write(outputBits.Data);
outputBits = new BitVector32();
k = 0;
outputBits[_masks[k]] = count >= 2;
k++;
outputBits[_masks[k]] = count != 2;
k++;
outputBits[_masks[k]] = currMSB;
k++;
outputBits[_masks[k]] = currLSB;
k++;
writer.Write(outputBits.Data);
}
else
{
outputBits[_masks[k]] = count >= 2;
k++;
outputBits[_masks[k]] = count != 2;
k++;
outputBits[_masks[k]] = currMSB;
k++;
outputBits[_masks[k]] = currLSB;
k++;
writer.Write(outputBits.Data);
}
}
}
File.Delete(projectPath + "input.txt");
System.IO.File.Copy(projectPath + "output.txt", projectPath + "input.txt");
System.IO.File.WriteAllText(projectPath + "output.txt", string.Empty);
}
StringBuilder output = new StringBuilder();
using (BinaryReader reader = new BinaryReader(File.Open(projectPath + "input.txt", FileMode.Open)))
{
bool nextMSB, nextLSB;
while (reader.BaseStream.Position != reader.BaseStream.Length)
{
BitVector32 InputData = new BitVector32(reader.ReadInt32());
for (int i = 0; i < 32; i+=2)
{
nextMSB = InputData[_masks[i]];
nextLSB= InputData[_masks[i+1]];
if (!(nextLSB || nextMSB))
break;
if (nextMSB && nextLSB)
output.Append("3");
else
{
if (nextMSB)
output.Append("2");
else
output.Append("1");
}
}
}
}
return output.ToString();
}
Files are now very small, and it is reasonably fast.
|
|
|
|
|
My instant impression of it is that there has to be a better way than brute force: there's something very Fibonacci-sequence-like about the output... in my head, I can almost predict the pattern from one iteration to the next, without trying to describe anything... if only I had better coffee... if only Dijkstra were still alive... damn it: now you've got me interested.
|
|
|
|
|
I know there has to be a better way to do it because I did find a list that gave the lengths for the first 3000 numbers in the sequence. Let's just say there are more digits in the 3000th number than there are atoms in the observable universe. I'll post the answer and the length of #3000 Monday morning.
It does make for any interesting problem!
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
level 1 size = 1
level 2 size = 2
level 3 size = 2
level 4 size = 4
level 5 size = 6
level 6 size = 6
level 7 size = 8
level 8 size = 10
level 9 size = 14
level 10 size = 20
level 11 size = 26
level 12 size = 34
level 13 size = 46
level 14 size = 62
level 15 size = 78
level 16 size = 102
level 17 size = 134
level 18 size = 176
level 19 size = 226
level 20 size = 302
level 21 size = 408
level 22 size = 528
level 23 size = 678
level 24 size = 904
level 25 size = 1182
level 26 size = 1540
level 27 size = 2012
level 28 size = 2606
level 29 size = 3410
level 30 size = 4462
level 31 size = 5808
level 32 size = 7586
level 33 size = 9898
level 34 size = 12884
level 35 size = 16774
level 36 size = 21890
level 37 size = 28528
level 38 size = 37158
level 39 size = 48410
level 40 size = 63138
level 41 size = 82350
level 42 size = 107312
level 43 size = 139984
level 44 size = 182376
level 45 size = 237746
level 46 size = 310036
level 47 size = 403966
level 48 size = 526646
level 49 size = 686646
level 50 size = 894810
level 51 size = 1166642
level 52 size = 1520986
level 53 size = 1982710
level 54 size = 2584304
level 55 size = 3369156
level 56 size = 4391702
level 57 size = 5724486
level 58 size = 7462860
level 59 size = 9727930
level 60 size = 12680852
level 61 size = 16530884
level 62 size = 21549544
level 63 size = 28091184
level 64 size = 36619162
level 65 size = 47736936
level 66 size = 62226614
level 67 size = 81117366
level 68 size = 105745224
level 69 size = 137842560
level 70 size = 179691598
level 71 size = 234241786
level 72 size = 305351794
level 73 size = 398049970
level 74 size = 518891358
level 75 size = 676414798
level 76 size = 881752750
level 77 size = 1149440192
level 78 size = 1498380104
level 79 size = 1953245418
level 80 size = 2546222700
level 81 size = 3319186080
level 82 size = 4326816254
level 83 size = 5640348764
level 84 size = 7352630884
level 85 size = 9584715106
level 86 size = 12494412020
level 87 size = 16287462624
level 88 size = 21231903676
level 89 size = 27677468012
level 90 size = 36079732206
level 91 size = 47032657188
level 92 size = 61310766500
level 93 size = 79923316046
level 94 size = 104186199146
level 95 size = 135814773100
level 96 size = 177045063068
level 97 size = 230791944956
level 98 size = 300854953626
level 99 size = 392187941864
level 100 size = 511247092564
finished computation at Fri Dec 1 16:48:41 2017
elapsed time: 7205.75secs
modified 3-Dec-17 18:14pm.
|
|
|
|
|
Congratulations! You're the first to post the correct answer.
Extra credit: how did you do it in 2 hours?
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
Since we only need to compute the length, storing the entire string isn't necessary. Furthermore, the computation can be done recursively and requires very little code/storage for each level of recursion. The memory footprint while running was about 16k IIRC.
I removed some extraneous code and got the runtime at l=100 to about 1.5 hours. Probably could optimize it even more, but I don't see the point.
I'd post code here but it seems to be discouraged.
|
|
|
|
|
It would be interesting to see. Code has been an exception in the past for challenges like this.
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
OK, here it is...
#include <iostream>
#include <chrono>
#include <ctime>
using namespace std;
#define maxLevel 100
static uint32_t currentLevel = 0;
static chrono::time_point<chrono::system_clock> start, timeFinished;
class LevelProcessor
{
public:
LevelProcessor() :
currentOccurrence(0),
currentPrefix(0),
myLevel(currentLevel++),
totalSize(0)
{
}
void ProcessLevel(uint32_t prefix);
void FinishLevel();
uint32_t currentOccurrence;
uint32_t currentPrefix;
const uint32_t myLevel;
uint64_t totalSize;
};
static LevelProcessor processors[maxLevel];
void LevelProcessor::ProcessLevel(uint32_t prefix)
{
if (prefix == currentPrefix)
{
++currentOccurrence;
return;
}
if (currentOccurrence != 0)
{
if (myLevel < maxLevel - 1)
{
processors[myLevel + 1].ProcessLevel(currentOccurrence);
processors[myLevel + 1].ProcessLevel(currentPrefix);
}
++totalSize;
}
currentPrefix = prefix;
currentOccurrence = 1;
}
void LevelProcessor::FinishLevel()
{
++totalSize;
if (myLevel < maxLevel - 1)
{
processors[myLevel + 1].ProcessLevel(currentOccurrence);
processors[myLevel + 1].ProcessLevel(currentPrefix);
}
chrono::time_point<chrono::system_clock> timeFinished = chrono::system_clock::now();
chrono::duration<double> elapsed_seconds = timeFinished - start;
time_t end_time = chrono::system_clock::to_time_t(timeFinished);
cout << "level " << myLevel + 1 << " is done, size = " << totalSize * 2 << " at " << "elapsed time: " << elapsed_seconds.count() << "secs" << endl;
if (myLevel < maxLevel - 1)
processors[myLevel + 1].FinishLevel();
}
int main()
{
start = chrono::system_clock::now();
processors[1].ProcessLevel(1);
processors[1].FinishLevel();
timeFinished = chrono::system_clock::now();
chrono::duration<double> elapsed_seconds = timeFinished - start;
time_t end_time = chrono::system_clock::to_time_t(timeFinished);
cout << "finished computation at " << ctime(&end_time)
<< "elapsed time: " << elapsed_seconds.count() << "secs" << endl;
}
So much for my indenting, oh well.
|
|
|
|
|
Interesting. When I originally did the research into this thing I saw the pattern developing in the brute force results but I was never able to get any code to work that looked for and tracked the pattern.
I'll have to dig into this later to see exactly how it works and where I made my mistakes. I still have a couple of the broken projects from way back then.
Thanks for sharing!
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
I wish I could say that this is exploiting some underlying pattern, but it's really just a more efficient brute force implementation. It's more like a depth-first tree traversal - you never have to compute and store the entire string at one level before working on the next.
|
|
|
|
|
That's what I thought. When I originally started looking at this, I found the storage requirements for a single iteration were going to jump exponentially. I was looking for a method to do this, something like what you've done, but couldn't get it to work.
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
Wow, I see where my previous mistakes were compared to yours.
I got a couple of hints from your code that got my old code working, and what I was misinterpreting.
Your code, on my machine, does the 100 numbers in an hour and ten minutes. FAR faster than my brute force runs that store every iteration on disk in a byte-compressed format and takes just under 6 hours to run.
Thanks for the help!
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
No problem. It was an interesting challenge!
FWIW, I was looking further at the code and at how to optimize it.
One interesting thing I found is that if the order of ProcessLevel() calls is reversed we get the same sequences but reversed!
This means that the initial prefix for each level is always 1 and can be initialized as such, which then means the check for currentOccurrence != 0 in ProcessLevel() can be removed. Doesn't seem like much, but when that function is executed trillions of times it makes a noticeable difference.
You must have a fast machine, 100 takes quite a bit longer for me.
|
|
|
|
|
Interesting. I'll have to play around with that some more.
I'm wondering how long it would take to get to 200, let alone 3,000. And how to hang onto numbers that big. It seems a BigInt class would be needed but performance may suffer greatly.
I just built a new machine about 9 months ago, overclocked and water cooled of course. 
System.ItDidntWorkException: Something didn't work as expected.
C# - How to debug code[ ^].
Seriously, go read these articles.
Dave Kreskowiak
|
|
|
|
|
My runtimes are about 3500 sec at l=100 and about 50000 sec at l=110 for an increase of about 14.3x.
So from l=100 to l=200 is 14.3 ^ 10 x the time, or 347,636,939,799 hours. ~39 million years, give or take
l=3000? heh. I think that's a pretty good definition of "forever".
|
|
|
|
|
![Elephant | [mastadon]](https://www.codeproject.com/script/Forums/Images/elephant.gif) OK, I'll see how far I get doing it "my way" -- but I'll address the more general problem, allowing the starting input to be more than one symbol and not limited to the symbols 1, 2, and 3. Also, allowing the caller to specify the maximum subsequence length -- that'll be the hard part.
I think the only alcohol in the place is one shot of tequila; it will have to be enough.
Sunday morning update: By midnight I had the basic functionality (subsequence lengths 0 and 1) working and tested -- but using a List<T> which means that there are allocation issues.
This morning's immediate goal -- implement a SegmentedList<T> class.
Sunday afternoon update: The SegmentedList<T> is working well, and it allows for multiple threads for improved speed.
modified 3-Dec-17 18:31pm.
|
|
|
|
|
Since the only requirement was to determine the length, it is not necessary to store the full string. A simple 100 level recursion that, at each level, returns the next digit in sequence suffices - it takes a long time to run, but does not need huge amounts of space.
At each level above the first it is only necessary to store at most two digits - the digit of which you have just counted the repetitions, and the digit that broke the sequence. Each invocation at any level alternates between returning the count and returning the counted digit.
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
