Cody

# Daniel Turizo

Rank
Badges
##### 1155
Score
51 – 100 of 201
 on 23 Oct 2017 Daniel Turizo received Creator badge for Problem 44390. Test your luck! on 23 Oct 2017 on 22 Oct 2017 on 22 Oct 2017 on 22 Oct 2017 on 22 Oct 2017 Daniel Turizo submitted a Comment to Solution 1308504 This problem was so difficult for me to solve, would you mind explaining what search algorithm did you implement? Thanks. on 22 Oct 2017 on 22 Oct 2017 Daniel Turizo received Promoter badge for Problem 44376. The sliding puzzle: 3D on 22 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 Daniel Turizo submitted a Comment to Problem 44387. Birthday cake That right. I am also using an analytical solution and I had to introduce that ugly 1.0003 factor too. on 21 Oct 2017 on 21 Oct 2017 Quite right James! It took me some time to fix the repeating combinations error, but it was worth :D on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 21 Oct 2017 on 20 Oct 2017 on 20 Oct 2017 Can you please further explain the coding of the walls? I have already solved the 2D problem, but I still don't get the wall encoding in 5D. The end position is always encoded as 31, but wouldn't 31 mean the end position has walls in all dimensions, thus making inaccessible?. on 20 Oct 2017 on 20 Oct 2017 Daniel Turizo submitted a Comment to Problem 44387. Birthday cake The last two cases have a solution of 258.83 and 517.65, I am getting 258.82 and 517.64 respectively. Is this intended and I am wrong? or is it just numerical roundoff? on 20 Oct 2017 Daniel Turizo submitted a Comment to Solution 1291915 Does the problem statement have a typo?, it says 2310 is a pandigital number of order 4, but it should be 3, right? on 19 Oct 2017 Thank you very much! I was missing that condition, but I have fixed it now. on 19 Oct 2017 on 19 Oct 2017 It is possible to check test case 17? I have done it by hand and what I got is that It is not possible for Scott to assert statement 5, because are are two possible solutions: [4,18] and [6,16]. I am also getting the same result of two possible solutions in cases 14 and 18. Thank you very much. on 19 Oct 2017 It is possible to check test case 17? I have done it by hand and what I got is that It is not possible for Scott to assert statement 5, because are are two possible solutions: [4,18] and [6,16]. Thank you very much. on 19 Oct 2017 Daniel Turizo received Commenter badge for Problem 44377. Five steps to enlightenment on 19 Oct 2017 on 18 Oct 2017 on 18 Oct 2017 on 18 Oct 2017 on 18 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017 on 17 Oct 2017
51 – 100 of 201