<xmp><body><script type="text/javascript"> function setAttributeOnload(object, attribute, val) { if(window.addEventListener) { window.addEventListener('load', function(){ object[attribute] = val; }, false); } else { window.attachEvent('onload', function(){ object[attribute] = val; }); } } </script> <div id="navbar-iframe-container"></div> <script type="text/javascript" src="https://apis.google.com/js/platform.js"></script> <script type="text/javascript"> gapi.load("gapi.iframes:gapi.iframes.style.bubble", function() { if (gapi.iframes && gapi.iframes.getContext) { gapi.iframes.getContext().openChild({ url: 'https://www.blogger.com/navbar.g?targetBlogID\x3d7309733\x26blogName\x3dIntellections+Of+A+Lesser+Mortal\x26publishMode\x3dPUBLISH_MODE_BLOGSPOT\x26navbarType\x3dBLUE\x26layoutType\x3dCLASSIC\x26searchRoot\x3dhttps://holdensays.blogspot.com/search\x26blogLocale\x3den_US\x26v\x3d2\x26homepageUrl\x3dhttp://holdensays.blogspot.com/\x26vt\x3d-3678984846494381971', where: document.getElementById("navbar-iframe-container"), id: "navbar-iframe", messageHandlersFilter: gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER, messageHandlers: { 'blogger-ping': function() {} } }); } }); </script></xmp>

Saturday, October 29, 2005

Solution: Mindsport / Endgame 30 October, Sunday Times Of India (STOI)

Today's question is actually pretty simple or may be its not that simple I just got lucky. Mukul does not update his site regularly so I cannot post a link to the question. End

Answer:
Snakes -- 13 to 32, 45 to 66. Rest are ladders.

Solution:
Total number of moves made / squares covered because of 6 on the die = 12 * 6 = 72
Total number of moves required to be made to reach 100 = 100 - 1 = 99
This means that 27 (99 - 72) moves / squares to be covered with the help of snakes and ladders.
They are 13 to 32 ie 19 squares
25 to 48 ie 23 squares
35 to 54 ie 19 squares
45 to 66 ie 21 squares
63 to 88 ie 25 squares
79 to 84 ie 15 squares.
There are three options possible when one is present at these position.
a) She goes up ie she is at the foot of the ladder. (a factor of +1)
b) She remains at the same place ie she is at the top of a ladder or at the tail of a snake. (a factor of 0)
c) She goes down ie she is at the head of a snake.(a factor of -1)
So the question will be reduced to:
19*n1 + 23*n2 + 19*n3 + 21*n4 + 25*n5 + 15*n6 = 27
where ni is such that it belongs to {-1,0,1}.
and i is such that it belongs to (1,2,3,4,5,6}.
The above equations gives us a unique solution which has n1 = n3 = n6 = 0, n2 = 1, n4 = -1, n5 = 1
A simple checking reveals that all n1 is a snake and n3, n6 are ladders.
n2, n5 have to be ladders because their coefficients are 1.
n4 has to be a snake.
|

0 Comments:

Post a Comment

<< Home