mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 31
Search took 0.01 seconds.
Search: Posts Made By: 0scar
Forum: Puzzles 2021-03-20, 20:20
Replies: 27
Views: 2,468
Posted By 0scar
After such an explicit challenge... 96...

After such an explicit challenge...

96 words:
000100010001000
000100010001000
000100010001000
110001000100011
000010001000000
000000100010000
000100010001000
Forum: Puzzles 2021-02-13, 04:25
Replies: 27
Views: 2,468
Posted By 0scar
Block-version is the most interesting one. I...

Block-version is the most interesting one.
I slightly modif├Čed my candidate to fit your additional constraint.
Less words, but more symmetries.

86 words:
000100010001000
000100010001000...
Forum: Puzzles 2021-02-08, 04:24
Replies: 27
Views: 2,468
Posted By 0scar
nice puzzle; not sure about minimality of my...

nice puzzle; not sure about minimality of my candidates.

"bars" version, fixing 150-word near-solution by Dr Sardonicus.
5 words and 4 bars per row/column;
150 words, 120 bars placed along 8...
Forum: Puzzles 2020-12-06, 19:08
Replies: 3
Views: 2,131
Posted By 0scar
The published four-step base solution is flawed. ...

The published four-step base solution is flawed.
At the very first step, (2^2)^31 is equal to 2^(2*31), not to 2^(2^31).
We can get a working four-step solution by modifying the starting list to...
Forum: Puzzles 2020-11-08, 07:57
Replies: 34
Views: 5,951
Posted By 0scar
For bonus problem, there's some trade-off between...

For bonus problem, there's some trade-off between code length and code speed.
The published solution uses 12 lines and needs 16 steps to reach 1970 paths.
I worked on minimizing the number of steps...
Forum: Puzzles 2020-11-08, 02:48
Replies: 34
Views: 5,951
Posted By 0scar
As an example, we can try to minimize code...

As an example, we can try to minimize code length.
In this sense, published solutions are hard to beat.
For base problem, we can save one line by applying the CHAOS trick described in post #23....
Forum: Puzzles 2020-11-06, 03:12
Replies: 34
Views: 5,951
Posted By 0scar
I still believe that variable "Z" stands for...

I still believe that variable "Z" stands for "Zaphod Beeblebrox" :-)
Forum: Puzzles 2020-11-05, 08:32
Replies: 34
Views: 5,951
Posted By 0scar
As a joke, we could say that few people were...

As a joke, we could say that few people were stupid enough to solve the puzzle
Forum: Puzzles 2020-11-04, 17:30
Replies: 34
Views: 5,951
Posted By 0scar
I don't fully understand the second block of code...

I don't fully understand the second block of code within published base solution.
I suppose that new code lines must be inserted as follows:



If a and b are non-negative integers with a >= b,...
Forum: Puzzles 2020-10-23, 09:41
Replies: 34
Views: 5,951
Posted By 0scar
The "trick" itself is just one more degree of...

The "trick" itself is just one more degree of freedom in writing code.
Of course I can remove all "tricky" edges from my solutions; the easiest way requires to keep the same number of...
Forum: Puzzles 2020-10-21, 11:10
Replies: 34
Views: 5,951
Posted By 0scar
I agree at 100% with you. Had it been...

I agree at 100% with you.
Had it been necessary, writing it would have been too spoiling.
I only wrote that I found it useful (shorter code, faster reaching 1970)
Forum: Puzzles 2020-10-21, 02:39
Replies: 34
Views: 5,951
Posted By 0scar
I wish I could call you "pessimistic". Looking...

I wish I could call you "pessimistic".
Looking at the past three years, Oct20 seems somehow similar to Nov17, another "find-constrained-algorithm" challenge. Nov17 was actually solved by 23 people...
Forum: Puzzles 2020-10-14, 09:04
Replies: 34
Views: 5,951
Posted By 0scar
In my opinion, May19 and Oct18 (different area...

In my opinion, May19 and Oct18 (different area triangles) were much harder than Oct20.
Perhaps now many frequent solvers actually submitted wrong solutions or no solutions at all due to the...
Forum: Puzzles 2020-10-12, 18:09
Replies: 34
Views: 5,951
Posted By 0scar
"I think I'm paranoid / And complicated..." ...

"I think I'm paranoid / And complicated..."
(Garbage, Version 2.0, 1998)

At least, now the text seems unambiguous enough to ponder this problem...
Forum: Puzzles 2020-10-12, 03:06
Replies: 33
Views: 9,524
Posted By 0scar
I followed uau's suggestion. Given a RPS(n)...

I followed uau's suggestion.

Given a RPS(n) game, we can always extend it to a RPS(n+2) game:
aaavw
aaavw
aaa10
ww001
vv100
where A is the adjacency matrix of the RPS(n) game, V is a column...
Forum: Puzzles 2020-10-11, 10:31
Replies: 33
Views: 9,524
Posted By 0scar
After a slight modification, uau's "algebric"...

After a slight modification, uau's "algebric" construction also explains the RPS(13) game with 39 automorphisms (which is optimal, according to the paper referenced within September's solution)....
Forum: Puzzles 2020-10-07, 05:28
Replies: 33
Views: 9,524
Posted By 0scar
A very elegant construction, thanks uau! ...

A very elegant construction, thanks uau!

Another nice construction works for composite n and solves n=9.
Given two games RPS(a) and RPS(b), build a game RPS(a*b).

Let z = x*b+y, with...
Forum: Puzzles 2020-10-06, 10:53
Replies: 33
Views: 9,524
Posted By 0scar
As a lucky guess, I searched for RPS(n) games...

As a lucky guess, I searched for RPS(n) games which admit at least one n-cycle as an automorphism.
So they admit at least n automorphisms (by repeatedly applying the cyclic shift).
Can we get n*q...
Forum: Puzzles 2020-10-06, 10:41
Replies: 34
Views: 5,951
Posted By 0scar
Unless it implies that the chaos operator can let...

Unless it implies that the chaos operator can let the program move to next instruction or force a jump to an instruction from the list, an even more "chaotic" (and undocumented) behaviour.
Forum: Puzzles 2020-09-12, 03:25
Replies: 33
Views: 9,524
Posted By 0scar
I didn't know the chosen "cycle notation" too, I...

I didn't know the chosen "cycle notation" too, I always used the "one-line notation" described by SmartMersenne.
Wikipedia has an useful paragraph about them...
Forum: Puzzles 2020-08-28, 14:28
Replies: 6
Views: 5,123
Posted By 0scar
Spin-off solution

The target sequence G(n) = F(n)*F(n+1) satisfies an order-3 homogeneous linear recurrence:
G(n) = 2*G(n-1) + 2*G(n-2) - G(n-3),
so we need a homogeneous linear system of order at least three to...
Forum: Puzzles 2020-07-30, 05:57
Replies: 6
Views: 5,123
Posted By 0scar
As LENGTH(n) grows exponentially, I think that it...

As LENGTH(n) grows exponentially, I think that it makes sense to compute the ratios for n up to 10, or their limits as n grows to infinity (only for the brave)

For my currently best solution,
IBM...
Forum: Puzzles 2020-07-30, 05:33
Replies: 6
Views: 5,123
Posted By 0scar
Spin-off

A friend of mine suggested a nice "spin-off" puzzle.

If you solved July 2020 main problem by using three letters or more,
and your dictionary includes letters "I", "B", and "M",
then how many...
Forum: Puzzles 2020-04-24, 05:46
Replies: 1
Views: 4,599
Posted By 0scar
What about tiling an infinite board?

Asymptotically, leave a fraction r of empty squares, and place each symbol in 1/3 of the remaining squares; ensure winning chance for no player.

Can you do so for some explicit fraction r>0?
Can...
Forum: Puzzles 2020-04-14, 17:30
Replies: 44
Views: 17,179
Posted By 0scar
I think that someone didn't stop on day 10 or on...

I think that someone didn't stop on day 10 or on day 19, but he always checked every t until p >=.7 was reached. And he eventually found some p very, very close.
My guess: somewhere before day 81.
Showing results 1 to 25 of 31

 
All times are UTC. The time now is 22:34.

Thu Apr 15 22:34:37 UTC 2021 up 7 days, 17:15, 1 user, load averages: 2.83, 2.62, 2.48

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.