September 2016

Batalov · 2016-08-28, 16:49

Ponder This, Sept.2016

science_man_88 · 2016-08-28, 17:46

Quote:

Originally Posted by Batalov

Ponder This, Sept.2016

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

science_man_88 · 2016-08-30, 01:41

Quote:

Originally Posted by Batalov

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

Batalov · 2016-08-30, 01:49

Quote:

Originally Posted by science_man_88

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

No.

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

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!

) 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 to 2).

Xyzzy · 2016-10-04, 14:10

http://www.research.ibm.com/haifa/po...ember2016.html

2016-08-28, 16:49	#1
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 10,061 Posts	September 2016 Ponder This, Sept.2016

2016-09-03, 05:07	#7
LaurV Romulan Interpreter "name field" Jun 2011 Thailand 2829₁₆ Posts	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] Last fiddled with by LaurV on 2016-09-03 at 05:11

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
September 2017	R. Gerbicz	Puzzles	21	2018-03-17 13:19
A Desperate appeal! (by Richard K. Guy)... deadline is September 30, 2016	philmoore	Factoring	102	2016-10-01 12:16
September 2015	Xyzzy	Puzzles	12	2015-10-07 14:43
September 2014	Xyzzy	Puzzles	3	2014-11-02 19:04
Anyone going to Vienna in September?	fivemack	Factoring	1	2007-09-07 00:29

2016-08-30, 01:34	#3
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 10,061 Posts

2016-08-30, 01:57	#6
LaurV Romulan Interpreter "name field" Jun 2011 Thailand 3×23×149 Posts	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! ) and hold Alice on my lap, and of course, if she agrees (otherwise it will be a violation...)

2016-09-03, 15:57	#8
Batalov "Serge" Mar 2008 Phi(4,2^7658614+1)/2 10,061 Posts	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 to 2).

2016-10-04, 14:10	#9
Xyzzy Aug 2002 20563₈ Posts	http://www.research.ibm.com/haifa/po...ember2016.html