![]() |
![]() |
#1 |
Aug 2012
Mass., USA
1001111102 Posts |
![]()
The recent Numberphile video about Mondrian art puzzles has an error.
It claims that the best Mondrian score for an 18x18 square is 10. But I've achieved a Mondrian score of 8 for it. Code:
~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ? ? ? ?
^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ^ ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % < < < < < # # # # # # ? ? ? ?
% % % > > > > > > > + + + + ? ? ? ?
% % % > > > > > > > + + + + = = = =
% % % > > > > > > > + + + + = = = =
% % % > > > > > > > + + + + = = = =
% % % > > > > > > > + + + + = = = =
@ @ @ @ @ @ @ @ @ @ + + + + = = = =
@ @ @ @ @ @ @ @ @ @ + + + + = = = =
@ @ @ @ @ @ @ @ @ @ + + + + = = = =
|
![]() |
![]() |
![]() |
#3 | |
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
![]() Quote:
Last fiddled with by science_man_88 on 2016-11-27 at 22:10 |
|
![]() |
![]() |
![]() |
#5 |
Aug 2012
Mass., USA
2×3×53 Posts |
![]()
Ed has informed me that A276523 has now been corrected. The correction also include new values for 15x15 and 19x19 cases, found by Ed after further checking.
|
![]() |
![]() |
![]() |
#6 |
Aug 2006
3×1,987 Posts |
![]() |
![]() |
![]() |
![]() |
#7 |
"Robert Gerbicz"
Oct 2005
Hungary
26258 Posts |
![]()
Really fascinating puzzle!
My exahaustive code gives the following better solutions (these are optimal): a(14)=6 (!!!) Code:
aaaaaaaaaabbbb aaaaaaaaaabbbb aaaaaaaaaabbbb cccdddddddbbbb cccdddddddbbbb cccdddddddbbbb cccdddddddbbbb cccdddddddbbbb ccceeeeeffffff ccceeeeeffffff ccceeeeeffffff ccceeeeeffffff ccceeeeeffffff ccceeeeeffffff Code:
aaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaa bbbbbbbbbbccccdd bbbbbbbbbbccccdd bbbbbbbbbbccccdd eeefffffffccccdd eeefffffffccccdd eeefffffffccccdd eeefffffffccccdd eeefffffffccccdd eeeggggghhhhhhdd eeeggggghhhhhhdd eeeggggghhhhhhdd eeeggggghhhhhhdd eeeggggghhhhhhdd eeeggggghhhhhhdd Code:
aaaaaaaaaaaaaaaaaabbbbb aaaaaaaaaaaaaaaaaabbbbb aaaaaaaaaaaaaaaaaabbbbb aaaaaaaaaaaaaaaaaabbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb cccccccceeeeffffffbbbbb ddddddddeeeeffffffbbbbb ddddddddeeeeffffffbbbbb ddddddddeeeeffffffbbbbb ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg ddddddddeeeeggggggggggg Code:
aaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaa bbbbbbbbbbbbbbbbbbbbccccc bbbbbbbbbbbbbbbbbbbbccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeeffffkkkkkkkccccc ddeeeeeeefffflllllllllmmm ddggghhhhfffflllllllllmmm ddggghhhhfffflllllllllmmm ddggghhhhfffflllllllllmmm ddggghhhhfffflllllllllmmm ddggghhhhjjjjjjjjnnnnnmmm ddggghhhhjjjjjjjjnnnnnmmm ddggghhhhjjjjjjjjnnnnnmmm ddggghhhhjjjjjjjjnnnnnmmm ddggghhhhjjjjjjjjnnnnnmmm ddggghhhhjjjjjjjjnnnnnmmm ddgggiiiiiiiiiiiinnnnnmmm ddgggiiiiiiiiiiiinnnnnmmm ddgggiiiiiiiiiiiinnnnnmmm ddgggiiiiiiiiiiiinnnnnmmm Code:
aaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaa bbbbbbbbbbbbbbbbccccccccdd bbbbbbbbbbbbbbbbccccccccdd bbbbbbbbbbbbbbbbccccccccdd eeegggggggggggggccccccccdd eeegggggggggggggccccccccdd eeegggggggggggggccccccccdd eeegggggggggggggccccccccdd eeehhhhiiiiiiiiiiiiiiiiidd eeehhhhiiiiiiiiiiiiiiiiidd eeehhhhiiiiiiiiiiiiiiiiidd eeehhhhjjjjjkkkkkkkkkkkkdd eeehhhhjjjjjkkkkkkkkkkkkdd eeehhhhjjjjjkkkkkkkkkkkkdd eeehhhhjjjjjkkkkkkkkkkkkdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd eeehhhhjjjjjlllllllmmmmmdd fffffffffffffffffffmmmmmdd fffffffffffffffffffmmmmmdd fffffffffffffffffffmmmmmdd Code:
aaaaaaaaaaaaaaaaaaaaaaaabbb aaaaaaaaaaaaaaaaaaaaaaaabbb ccdddddddddddddddeeeefffbbb ccdddddddddddddddeeeefffbbb ccdddddddddddddddeeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccgghhhhhhiiiiiiieeeefffbbb ccggjjjjjjlllllllllllfffbbb ccggjjjjjjlllllllllllfffbbb ccggjjjjjjlllllllllllfffbbb ccggjjjjjjlllllllllllfffbbb ccggjjjjjjmmmmmmmmmmmmnnnnn ccggjjjjjjmmmmmmmmmmmmnnnnn ccggjjjjjjmmmmmmmmmmmmnnnnn ccggjjjjjjmmmmmmmmmmmmnnnnn ccggkkkkkkkkoooooooooonnnnn ccggkkkkkkkkoooooooooonnnnn ccggkkkkkkkkoooooooooonnnnn ccggkkkkkkkkoooooooooonnnnn ccggkkkkkkkkoooooooooonnnnn ccggppppppppppppppppppppppp ccggppppppppppppppppppppppp Code:
aaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaa bbbbbbbbbbbbbbbbbbbbbbbbbccc bbbbbbbbbbbbbbbbbbbbbbbbbccc ddddddddddddddddddeeeffffccc ddddddddddddddddddeeeffffccc ddddddddddddddddddeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhjjjjjjkkkkkkkeeeffffccc hhhhhllllmmmmmmmmmeeeffffccc hhhhhllllmmmmmmmmmeeeffffccc iiiiillllmmmmmmmmmeeeffffccc iiiiillllmmmmmmmmmeeeggggggg iiiiillllmmmmmmmmmeeeggggggg iiiiillllmmmmmmmmmeeeggggggg iiiiillllnnnnnnnnnnnnggggggg iiiiillllnnnnnnnnnnnnggggggg iiiiillllnnnnnnnnnnnnggggggg iiiiillllnnnnnnnnnnnnggggggg iiiiillllooooooooooooooooooo iiiiillllooooooooooooooooooo iiiiillllooooooooooooooooooo |
![]() |
![]() |
![]() |
#8 |
"Forget I exist"
Jul 2009
Dumbassville
203008 Posts |
![]()
you can upper bound if for even n by using either 2n if the solution for n/2 is greater than n\4 or 4 times the solution for n\2 otherwise. edit: so for example using the 17 by 17 bound in the video is 8 so we can say with confidence that for 34 by 34 the minimum solution is upper bounded by 32. and for the n=23 example above we can say that now for n=46 the minimal solution is not greater than 32 as well. sorry adding trivialities to the thread.
Last fiddled with by science_man_88 on 2016-11-29 at 01:54 |
![]() |
![]() |
![]() |
#9 | |
Aug 2012
Mass., USA
2×3×53 Posts |
![]() Quote:
A little bit more about my initial find... This web page listed what had been believed to be the optimal Mondrian scores for 4x4 up to 17x17. So after I found solutions that I thought were optimal for squares up to 17x17, I looked for a solution for the 18x18 square with a score that matched the 17x17 value. After my program generated many solutions (having a score of 8), I tried to find one manually on my own. I struggled for awhile, so I finally peeked at part of one of the solutions found by my computer. I was able to complete the 18x18 square by trial and error from the set of rectangles the computer was using, and that is the solution I posted. It probably wasn't until a couple days later or so that I realized that this solution had a score that was better by 2 than what was being claimed to be the best possible score. Until then, I didn't think my solution was anything special. Of course, I then realized I should post my solution online right away. |
|
![]() |
![]() |
![]() |
#10 |
Nov 2016
1610 Posts |
![]()
Many thanks for the improved solutions. I found a few bugs in my coding. I'll be posting an update at http://demonstrations.wolfram.com/MondrianArtProblem/ in the near future.
|
![]() |
![]() |
![]() |
#11 | |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
47×197 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Near repdigit primes on Numberphile | lavalamp | Lounge | 68 | 2018-09-09 19:01 |
a numberphile like channel by kids | science_man_88 | science_man_88 | 0 | 2017-11-17 21:37 |
Trinity Hall Prime (from Numberphile) | Mini-Geek | Lounge | 3 | 2017-09-08 06:18 |
prime gap- numberphile vid | firejuggler | Prime Gap Searches | 8 | 2017-07-19 20:22 |
Leyland Numbers - Numberphile | Mini-Geek | Lounge | 5 | 2014-10-29 07:28 |