{"id":3154,"date":"2014-03-06T09:00:34","date_gmt":"2014-03-06T14:00:34","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3154"},"modified":"2025-12-10T09:54:07","modified_gmt":"2025-12-10T14:54:07","slug":"1eva2006tii_t3-conejo-en-tablero","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva10\/1eva2006tii_t3-conejo-en-tablero\/","title":{"rendered":"1Eva2006TII_T3 Conejo en tablero"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">1ra Evaluaci\u00f3n II T\u00e9rmino 2006 - 2007 \/ICM00794<\/h2>\n\n\n\n<figure class=\"wp-block-image alignright\"><img loading=\"lazy\" decoding=\"async\" width=\"165\" height=\"203\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2015\/03\/conejoperfil.png\" alt=\"conejo perfil sombra\" class=\"wp-image-1996\" \/><\/figure>\n\n\n\n<p><strong>Tema 3<\/strong>. (30 puntos) Suponga que un conejo se encuentra ubicado en el centro de un tablero cercado de 10x10 y con una salida en el lugar que se muestra en la figura. <\/p>\n\n\n\n<p>Si cada vez que el conejo salta 1 casilla, se conoce que lo puede realizar de forma aleatoria hacia arriba, abajo, izquierda o derecha.<\/p>\n\n\n\n<p>Elabore un algoritmo que determine <strong>cu\u00e1ntos<\/strong> intentos debe realizar el conejo hasta que sale del tablero.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>10<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>salida<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>9<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>8<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>7<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>6<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>5<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>Inicio<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>4<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>3<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>2<\/strong><\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td><strong>1<\/strong><\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><td>...<\/td><\/tr><tr><td>&nbsp;<\/td><td><strong>1<\/strong><\/td><td><strong>2<\/strong><\/td><td><strong>3<\/strong><\/td><td><strong>4<\/strong><\/td><td><strong>5<\/strong><\/td><td><strong>6<\/strong><\/td><td><strong>7<\/strong><\/td><td><strong>8<\/strong><\/td><td><strong>9<\/strong><\/td><td><strong>10<\/strong><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>1ra Evaluaci\u00f3n II T\u00e9rmino 2006 - 2007 \/ICM00794 Tema 3. (30 puntos) Suponga que un conejo se encuentra ubicado en el centro de un tablero cercado de 10x10 y con una salida en el lugar que se muestra en la figura. Si cada vez que el conejo salta 1 casilla, se conoce que lo puede [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[113],"tags":[146,151],"class_list":["post-3154","post","type-post","status-publish","format-standard","hentry","category-fp-1eva10","tag-aleatorios","tag-condicionales"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3154","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=3154"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3154\/revisions"}],"predecessor-version":[{"id":16495,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3154\/revisions\/16495"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3154"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3154"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}