o C›]b•<ã@sŽddlmZddlmZddlmZddlmZddlm Z ddlZGdd„dƒZ d d „Z d d „Z d d„Zdd„Zdd„Zdd„Zdd„ZdS)é)Úprint_function)Úsleep)Ústart)Úproperty_interning_dict)Ú interfaceNc@s6eZdZdZdZdZdZd dd„Zdd„Zdd „Z dS) ÚStatez4 Helper class for representing states in A* NéÿÿÿÿcCs"||_||_|dur||_dSdS©N)ÚxÚzÚprevious)Úselfr r r ©rúz:\Documents\Temple_master\Spring_2022\ai\minecraft_proj\CIS-5603-Minecraft-Settlement-Generation-AI\temple_mc_ai\generation\pathGenerator.pyÚ__init__s  ÿzState.__init__cCs dt|jƒdt|jƒdS)Nú(ú, ú))Ústrr r )r rrrÚ to_strings zState.to_stringcCs|j|jko |j|jkSr )r r )r ÚstaterrrÚequalssz State.equals)rrN) Ú__name__Ú __module__Ú __qualname__Ú__doc__r r r rrrrrrrr s  rcCst|ƒtt||ƒ|ƒS)z- Evaluation function for use with A* N)ÚcostÚhr)Ú current_stateÚmÚnrrrÚfsr!cCs*d}|}|dur|j}|d7}|dus|S)zr Helper function which calculates the cost to a certain state (i.e., how many steps it took to get there) rNé)r )rZcost_valrrrrr%sþrcCs t|j|jƒt|j|jƒS)z, Hueristic function for use with A* N©Úabsr r )Ú goal_staterrrrr1s rcCs | |¡S)zO Helper function to determine whether or not the goal has been reached N)r)rr%rrrÚhas_reached_goal8s r&cCs4t||j||j|f||j||j|fƒS)zP Helper function which returns the height difference between two points Nr#)Zstate1Zstate2ÚheightsÚheight_start_xÚheight_start_zrrrÚget_height_difference?s4r*c %Cs tdƒtd|d|dƒtd|d|dƒd} t||ƒ} g} |  t| j| jƒ¡g} d} t| ƒdkr¹d}td t| ƒƒD];}t| |||ƒt| |||ƒkrP|}q;t| |||ƒt| |||ƒkrvtt||ƒ| |ƒtt||ƒ| |ƒkrv|}q;t| |j| |j| |j ƒ} |  t| j| jƒ¡d}|t| ƒkr¶t| j| jƒ  | |¡r¬|   | |¡n|d 7}|t| ƒks˜t | t||ƒƒrÆtd ƒd } q¹| jd |krd}tt| ƒƒD]}t| j| jd ƒ  | |¡rêd }qëqÖd}t | t| j| jd ƒ|||ƒ}|d krd }|dur|dur|  t| j| jd | ƒ¡| jd |krqd}tt| ƒƒD]}t| j| jd ƒ  | |¡r@d }qBq*d}t | t| j| jd ƒ|||ƒ}|d krZd }|durq|durq|  t| j| jd | ƒ¡| jd |krÈd}tt| ƒƒD]}t| jd | jƒ  | |¡r—d }q™qd}t | t| jd | jƒ|||ƒ}|d kr±d }|durÈ|durÈ|  t| jd | j| ƒ¡| jd |krd}tt| ƒƒD]}t| jd | jƒ  | |¡rîd }qðqØd}t | t| jd | jƒ|||ƒ}|d krd }|dur|dur|  t| jd | j| ƒ¡| jd |kr„| jd |kr„d}tt| ƒƒD]}t| jd | jd ƒ  | |¡rOd }qQq7d}t | t| jd | jd ƒ|||ƒ}|d krkd }|dur„|dur„|  t| jd | jd | ƒ¡| jd |kré| jd |kréd}tt| ƒƒD]}t| jd | jd ƒ  | |¡r´d }q¶qœd}t | t| jd | jd ƒ|||ƒ}|d krÐd }|duré|duré|  t| jd | jd | ƒ¡| jd |krN| jd |krNd}tt| ƒƒD]}t| jd | jd ƒ  | |¡rd }qqd}t | t| jd | jd ƒ|||ƒ}|d kr5d }|durN|durN|  t| jd | jd | ƒ¡| jd |kr³| jd |kr³d} tt| ƒƒD]}t| jd | jd ƒ  | |¡r~d } q€qfd}!t | t| jd | jd ƒ|||ƒ}|d kršd }!| dur³|!dur³|  t| jd | jd | ƒ¡t| ƒdks2g}"| }#|#d urÏ|" |#¡|#j }#|#d usÂ| durØtdƒtt|"ƒƒD]«}||"|j||"|j|fd }$t |"|j|$|"|j| ¡t |"|jd |$|"|j| ¡t |"|jd |$|"|jd | ¡t |"|jd |$|"|jd | ¡t |"|j|$|"|jd | ¡t |"|j|$|"|jd | ¡t |"|jd |$|"|jd | ¡t |"|jd |$|"|jd | ¡t |"|jd |$|"|j| ¡qÞtƒd S)zH Builds a simple path between the two specified points using A* zBuilding path...zPath starting at coordinates: (rrzPath ending at coordinates: (Z grass_pathFrr"z Reached the goal, terminating A*TéNzTNO SOLUTION, path not possible given current settings, placing what was found so far)ÚprintrÚappendr r ÚlenÚranger!rr rÚremover&r*ÚINTFÚ placeBlock)%Ústart_xÚstart_zÚend_xÚend_zr'r(r)Ú height_end_xÚ height_end_zZpath_material_idrZopen_setZ closed_setZ goal_reachedZ best_moveÚiÚkZleft_is_exploredZleft_is_obstacleZ height_diffZright_is_exploredZright_is_obstacleZup_is_exploredZup_is_obstacleZdown_is_exploredZdown_is_obstacleZup_left_is_exploredZup_left_is_obstacleZup_right_is_exploredZup_right_is_obstacleZdown_left_is_exploredZdown_left_is_obstacleZdown_right_is_exploredZdown_right_is_obstacleÚpathZcurrent_state_copyÚheightrrrÚ build_pathFs:   (€  üþ þ þ þ  "þ"  "þ"  "þ"  "þ"  ¬X   þ $ $$  $$$ r=c Csltt|ƒdƒD]+}||\}}||d\} } t d¡tt|ƒt|ƒt| ƒt| ƒd|||||ƒ qdS)z^ Helper function to take in an array of coordinates and build paths between each pair r"gà?r+N)r/r.Útimerr=Úint) Ú door_coordsr'r(r)r7r8r9ÚstartxÚstartzÚendxÚendzrrrÚbuild_paths_between_housesOs   .úrE)Ú __future__rr>rÚ tracemallocrZxml.sax.handlerrÚgdpcrr1rr!rrr&r*r=rErrrrÚs