mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Puzzles (https://www.mersenneforum.org/forumdisplay.php?f=18)
-   -   September 2016 (https://www.mersenneforum.org/showthread.php?t=21532)

Batalov 2016-08-28 16:49

September 2016
 
[URL="https://www.research.ibm.com/haifa/ponderthis/challenges/September2016.html"]Ponder This, Sept.2016[/URL]

science_man_88 2016-08-28 17:46

[QUOTE=Batalov;440910][URL="https://www.research.ibm.com/haifa/ponderthis/challenges/September2016.html"]Ponder This, Sept.2016[/URL][/QUOTE]

best idea I've come up with so far is making a matrix of possible arrangements and then using the two dimensions to sort by first and second letter and then like matdet not concerning myself with the members of each row or each column as that would break one of the rules ( it might help if I can arrange them based on connected last letters as well).

Batalov 2016-08-30 01:34

[YOUTUBE]haT8g7oKnns[/YOUTUBE]

science_man_88 2016-08-30 01:41

[QUOTE=Batalov;441027][YOUTUBE]haT8g7oKnns[/YOUTUBE][/QUOTE]

is this another form of calling me stupid that I don't really get ?

Batalov 2016-08-30 01:49

[QUOTE=science_man_88;441028]is this another form of calling me stupid that I don't really get ?[/QUOTE]
No.

[SPOILER]Is everything written on this forum addressed to you? I don't think so.[/SPOILER]

LaurV 2016-08-30 01:57

I can solve this problem without any violation if you allow me to be Charlie (no! I don't want to be Bob! No way! :razz:) and hold Alice on my lap, and of course, if she agrees (otherwise it will be a violation...)

LaurV 2016-09-03 05:07

Dealing with the morning coffee in a wonderful Saturday morning here.
Solved this baby puzzle, less than 20 seconds running time (no cheating).
[edit: laptop, single core, not a performant system]
[edit: from which 90% is actually printing on the screen, grrrr]

Batalov 2016-09-03 15:57

Pruning the tree works one-derfully here, because the answer is such a small number.
If the answer was, say, a two digit number, then much more of the tree would have been to be visited. My program runs for milliseconds (if the bound is set to 20 or 40) and for microseconds (if the bound is set [SPOILER]to 2[/SPOILER]).

Xyzzy 2016-10-04 14:10

[url]http://www.research.ibm.com/haifa/ponderthis/solutions/September2016.html[/url]


All times are UTC. The time now is 20:15.

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