- Do not add any imports, the ones that you need will be given to you. - Do not use recursion. - Do not use break/continue. - Do not use try-except statements, you should be able to anticipate or...


- Do not add any imports, the ones that you need will be given to you.
- Do not use recursion.
- Do not use break/continue.
- Do not use try-except statements, you should be able to anticipate
or prevent any errors from happening at all!


def cost_to_hike_naive (m: list[list[int]], start_point: tuple[int, int],<br>end point: tuple[int, int]) -> int:<br>Given an elevation map <m> and a start and end point, calculate the cost it<br>would take to hike from <start_point> to <end_point>. If the start and end<br>points are the same, then return 0.<br>Some definitions and rules:<br>1. You can only hike to either a vertically or horizontally adjacent<br>location (you cannot travel diagonally).<br>2. You must only travel in the direction of the <end_point>. More<br>explicitly, this means that any move you make MUST take you closer<br>to the end point, so you cannot travel in the other direction.<br>3. We define the cost to travel between two adjacent blocks as the<br>absolute difference in elevation between those blocks.<br>4. You will calculate the naive route here, so at every position, you<br>will have two choices, to either move closer to the end point along<br>a row, or along a column, and you will chose the position that costs<br>the least at that point (you do not need to look ahead to see if the<br>costlier route now will result in an overall cheaper route).<br>5. If two choices along the route have the exact same cost, you will<br>choose the direction that comes first clockwise. For example, you<br>will choose to move horizontally right before vertically down,<br>vertically down before horizontally left, horizontally left before<br>vertically up, and vertically up before horizontally right.<br>

Extracted text: def cost_to_hike_naive (m: list[list[int]], start_point: tuple[int, int], end point: tuple[int, int]) -> int: Given an elevation map and a start and end point, calculate the cost it would take to hike from to . If the start and end points are the same, then return 0. Some definitions and rules: 1. You can only hike to either a vertically or horizontally adjacent location (you cannot travel diagonally). 2. You must only travel in the direction of the . More explicitly, this means that any move you make MUST take you closer to the end point, so you cannot travel in the other direction. 3. We define the cost to travel between two adjacent blocks as the absolute difference in elevation between those blocks. 4. You will calculate the naive route here, so at every position, you will have two choices, to either move closer to the end point along a row, or along a column, and you will chose the position that costs the least at that point (you do not need to look ahead to see if the costlier route now will result in an overall cheaper route). 5. If two choices along the route have the exact same cost, you will choose the direction that comes first clockwise. For example, you will choose to move horizontally right before vertically down, vertically down before horizontally left, horizontally left before vertically up, and vertically up before horizontally right.
Preconditions:<br>the start and end points will be a valid position on the map.<br>Tips to get started:<br>since there is no guarantee where the start and end points will be in<br>relation to each other, it may be easier to use your rotate function<br>from last week to rotate the map such that the end point is always to<br>the bottom right of the start point. That is, rotate the map such that<br>start_point[0] <= end_point[0] and start_point[1] <= end_point[1].<br>Keep in mind that if you choose to rotate the map, the start and end<br>point coordinates will change as well. If you choose to do it this way,<br>then you can code your function to only consider moving horizontally<br>right, or vertically down. Not rotating is fine as well, but you would<br>have to consider moves in all 4 directions, depending on the start and<br>end coordinates. If you choose to rotate the map, you may also find the<br>crop function you implmented last week useful, as that will guarantee<br>that the start and end points will be at corners of the map.<br>>>> sample_map = [[1, 3],<br>[0, 4]]<br>>>> cost_to_hike_naive (sample_map, (0, 0), (1, 1))<br>5<br>>>> cost to_hike_naive (sample_map, (1, 1), (0, 0))<br>3<br>pass<br>

Extracted text: Preconditions: the start and end points will be a valid position on the map. Tips to get started: since there is no guarantee where the start and end points will be in relation to each other, it may be easier to use your rotate function from last week to rotate the map such that the end point is always to the bottom right of the start point. That is, rotate the map such that start_point[0] <= end_point[0]="" and="" start_point[1]=""><= end_point[1].="" keep="" in="" mind="" that="" if="" you="" choose="" to="" rotate="" the="" map,="" the="" start="" and="" end="" point="" coordinates="" will="" change="" as="" well.="" if="" you="" choose="" to="" do="" it="" this="" way,="" then="" you="" can="" code="" your="" function="" to="" only="" consider="" moving="" horizontally="" right,="" or="" vertically="" down.="" not="" rotating="" is="" fine="" as="" well,="" but="" you="" would="" have="" to="" consider="" moves="" in="" all="" 4="" directions,="" depending="" on="" the="" start="" and="" end="" coordinates.="" if="" you="" choose="" to="" rotate="" the="" map,="" you="" may="" also="" find="" the="" crop="" function="" you="" implmented="" last="" week="" useful,="" as="" that="" will="" guarantee="" that="" the="" start="" and="" end="" points="" will="" be="" at="" corners="" of="" the="" map.="">>> sample_map = [[1, 3], [0, 4]] >>> cost_to_hike_naive (sample_map, (0, 0), (1, 1)) 5 >>> cost to_hike_naive (sample_map, (1, 1), (0, 0)) 3 pass
Jun 10, 2022
SOLUTION.PDF
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here
Have files?