![]() |
October 2015
They put it on. Very nice one.
([URL="https://www.research.ibm.com/haifa/ponderthis/challenges/October2015.html"]link[/URL]) I am still waiting for solution for September, to post my reasoning in the former thread. |
This month puzzle seems very easy.. The only issue is how many functions can we save?
A simple 3-2 mapping will use 8 functions. From the resolver list 6 is the minimum functions used currently. Can it be further reduced? |
[QUOTE=kitutwas;412445]This month puzzle seems very easy.. The only issue is how many functions can we save?
[/QUOTE] Yes, probably this is the explanation why this problem solved by 3 (three) people on the first day, and in the first 11 day by 18 people. (Just for comparison May 2015 solved by 96 people in the first 11 days.) "From the resolver list 6 is the minimum functions used currently. Can it be further reduced?" Wrong and yes, seeing the table ****Michael Brand, so he is now at 5 functions. |
[url]https://www.research.ibm.com/haifa/ponderthis/solutions/October2015.html[/url]
|
| All times are UTC. The time now is 02:47. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.