https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EB%8D%B0%EB%B8%94%EC%8A%A4%EC%BA%A0%ED%94%842005%2FRUR-PLE%2FSorting 2026-05-15T13:33:36Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EB%8D%B0%EB%B8%94%EC%8A%A4%EC%BA%A0%ED%94%842005/RUR-PLE/Sorting&diff=85385&oldid=prev 2026-03-27T00:37:19Z

<p>Repair batch-0004 pages from live compare</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 00:37, 27 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l387">Line 387:</td> <td colspan="2" class="diff-lineno">Line 387:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>----</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>----</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[데블스캠프2005/RUR-PLE]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[데블스캠프2005/RUR-PLE]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"></del></div></td><td colspan="2" class="diff-side-added"></td></tr> </table>

Maintenance script https://mediawiki.zeropage.org/index.php?title=%EB%8D%B0%EB%B8%94%EC%8A%A4%EC%BA%A0%ED%94%842005/RUR-PLE/Sorting&diff=46105&oldid=prev 2021-02-07T05:28:59Z

<p></p> <p><b>New page</b></p><div>__TOC__<br /> = 데블스캠프2005/RUR-PLE/Sorting =<br /> == 남상협 ==<br /> def turn_back():<br /> repeat(turn_left,2)<br /> def turn_right():<br /> repeat(turn_left,3)<br /> turn_left()<br /> move()<br /> <br /> def go_to_left_end():<br /> while front_is_clear(): # go to left end<br /> move()<br /> <br /> while next_to_a_beeper():<br /> turn_right()<br /> move()<br /> while next_to_a_beeper(): #search minimum column<br /> move()<br /> turn_right() <br /> if front_is_clear():<br /> move()<br /> if next_to_a_beeper():#inspect whether it&#039;s empty column or not<br /> turn_back() <br /> move()<br /> turn_left()<br /> go_to_left_end() # go to left end<br /> if not next_to_a_beeper(): # it&#039;s sorted<br /> turn_back()<br /> while not next_to_a_beeper(): # go to unsorted section<br /> move() <br /> if next_to_a_beeper(): <br /> pick_beeper() # move the beeper from larger column to smaller column<br /> move()<br /> while next_to_a_beeper():<br /> move() # search the smallest column in unordered columns<br /> put_beeper()<br /> #return to the larger column which must be sorted<br /> elif next_to_a_beeper(): <br /> pick_beeper() # move the beeper from larger column to smaller column<br /> turn_back()<br /> move()<br /> while next_to_a_beeper():<br /> move() # search the smallest column in unordered columns<br /> put_beeper()<br /> else: # one column sorting finished<br /> turn_back()<br /> move()<br /> turn_left()<br /> go_to_left_end()<br /> turn_back()<br /> continue<br /> if not next_to_a_beeper():<br /> turn_back()<br /> move()<br /> turn_left()<br /> go_to_left_end()<br /> turn_back()<br /> while not next_to_a_beeper():<br /> move()<br /> turn_left()<br /> else:<br /> turn_back()<br /> while next_to_a_beeper():<br /> move()<br /> turn_right()<br /> if next_to_a_beeper():<br /> move()<br /> else:<br /> move()<br /> if not next_to_a_beeper():<br /> turn_back()<br /> while not next_to_a_beeper():<br /> move()<br /> turn_back()<br /> move()<br /> turn_right()<br /> move()<br /> turn_left()<br /> turn_off()<br /> == 조현태 ==<br /> def such():<br /> while not next_to_a_beeper():<br /> if right_is_clear():<br /> turn_right()<br /> move()<br /> else:<br /> if front_is_clear():<br /> move()<br /> else:<br /> turn_left()<br /> <br /> def move_end():<br /> if front_is_clear():<br /> if next_to_a_beeper():<br /> move()<br /> else:<br /> move()<br /> if next_to_a_beeper():<br /> turn_left()<br /> turn_left()<br /> move()<br /> turn_left()<br /> turn_left()<br /> <br /> def move_wall():<br /> while front_is_clear():<br /> move()<br /> <br /> def sort_sub():<br /> while front_is_clear():<br /> if front_is_clear():<br /> move()<br /> if next_to_a_beeper():<br /> pick_beeper()<br /> turn_left()<br /> turn_left()<br /> move()<br /> put_beeper()<br /> else:<br /> turn_left()<br /> turn_left()<br /> move_endof_sub()<br /> repeat(move_end,10)<br /> <br /> def gaedan():<br /> repeat(move_end,10)<br /> repeat(sort_sub,20)<br /> turn_left()<br /> turn_left()<br /> move_endof()<br /> turn_right()<br /> move()<br /> turn_left()<br /> <br /> def move_endof_sub():<br /> move_wall()<br /> turn_right()<br /> move()<br /> turn_right()<br /> while not next_to_a_beeper():<br /> move()<br /> turn_right()<br /> move()<br /> turn_left()<br /> <br /> def move_endof():<br /> move_wall()<br /> turn_left()<br /> turn_left()<br /> while not next_to_a_beeper():<br /> move()<br /> <br /> def sort():<br /> move_endof()<br /> repeat(gaedan,9)<br /> <br /> def turn_right(): <br /> repeat(turn_left,3) <br /> <br /> <br /> def go_pick(): <br /> move() <br /> if next_to_a_beeper():<br /> pick_beeper() <br /> <br /> def go_go():<br /> turn_right() <br /> move() <br /> if next_to_a_beeper():<br /> pick_beeper() <br /> turn_right() <br /> repeat(go_pick,5) <br /> turn_left() <br /> move() <br /> if next_to_a_beeper(): <br /> pick_beeper() <br /> turn_left() <br /> repeat(go_pick,5) <br /> <br /> def havest():<br /> repeat(go_pick,6) <br /> turn_left() <br /> move() <br /> if next_to_a_beeper():<br /> pick_beeper() <br /> turn_left() <br /> repeat(go_pick,5) <br /> go_go() <br /> go_go() <br /> move()<br /> turn_left()<br /> repeat(move,5)<br /> turn_left()<br /> <br /> def go_pick_sub(): <br /> move() <br /> put_beeper() <br /> <br /> def go_go_sub():<br /> turn_right() <br /> move() <br /> put_beeper() <br /> turn_right() <br /> repeat(go_pick_sub,5) <br /> turn_left() <br /> move() <br /> put_beeper() <br /> turn_left() <br /> repeat(go_pick_sub,5) <br /> <br /> def havest_sub():<br /> repeat(go_pick_sub,6) <br /> turn_left() <br /> move() <br /> put_beeper() <br /> turn_left() <br /> repeat(go_pick_sub,5) <br /> go_go_sub() <br /> go_go_sub() <br /> move()<br /> turn_left()<br /> repeat(move,5)<br /> turn_left()<br /> #havest()<br /> #havest()<br /> #havest()<br /> #havest()<br /> #havest_sub()<br /> sort()<br /> turn_off() <br /> <br /> == 김정현 ==<br /> def turn():<br /> repeat(turn_left, 2)<br /> def turn_right():<br /> repeat(turn_left, 3)<br /> def go():<br /> while front_is_clear(): <br /> if not next_to_a_beeper():<br /> bringOne()<br /> if front_is_clear():<br /> move()<br /> turn_right()<br /> move()<br /> turn_right()<br /> <br /> def justGo():<br /> for n in range(7): <br /> move()<br /> turn()<br /> <br /> def bringOne():<br /> while not next_to_a_beeper():<br /> move() <br /> if not front_is_clear():<br /> break <br /> doRest()<br /> <br /> <br /> def doRest():<br /> turn()<br /> if next_to_a_beeper(): <br /> pick_beeper() <br /> while front_is_clear(): <br /> move()<br /> turn()<br /> move()<br /> move()<br /> while next_to_a_beeper():<br /> move() <br /> put_beeper() <br /> else:<br /> turn()<br /> <br /> <br /> <br /> for n in range(8):<br /> justGo()<br /> go()<br /> <br /> turn_off()<br /> <br /> == 김태훈(&amp;#91;zyint&amp;#93;) ==<br /> <br /> 미완성 입니다 -ㅅ-<br /> ###############################<br /> # Function Public Definitions #<br /> ###############################<br /> <br /> #move/get/put functions<br /> def right():<br /> repeat(turn_left,3)<br /> <br /> def back():<br /> repeat(left,2)<br /> move()<br /> repeat(left,2)<br /> <br /> def go_left():<br /> left()<br /> move()<br /> right()<br /> <br /> def go_right():<br /> right()<br /> move()<br /> left()<br /> <br /> def go():<br /> move()<br /> <br /> left = turn_left<br /> get = pick_beeper<br /> put = put_beeper<br /> <br /> #find beeper<br /> exist = next_to_a_beeper<br /> <br /> <br /> <br /> ####################<br /> #private functions #<br /> ####################<br /> def go_limit_right():<br /> if not exist():<br /> while not exist():<br /> go_right()<br /> while exist():<br /> go_right()<br /> go_left()<br /> <br /> def notexist_wantone():<br /> while left_is_clear():<br /> go_left()<br /> if exist():<br /> get()<br /> go_right()<br /> while exist():<br /> go_right()<br /> put()<br /> <br /> <br /> def process():<br /> if not exist():<br /> while left_is_clear():<br /> go_left()<br /> if exist():<br /> get()<br /> go_right()<br /> while exist():<br /> go_right()<br /> put()<br /> else: #exist<br /> while left_is_clear():<br /> go_left()<br /> if not exist():<br /> notexist_wantone()<br /> <br /> # main source code #<br /> <br /> #robot looks top<br /> left()<br /> <br /> go_limit_right()<br /> go()<br /> <br /> for i in range(5):<br /> process()<br /> back()<br /> go_limit_right()<br /> if not exist():<br /> while not exist():<br /> process()<br /> back()<br /> go_limit_right()<br /> go()<br /> else:<br /> go()<br /> process()<br /> # Finish #<br /> turn_off()<br /> <br /> == 정수민 ==<br /> [[데블스캠프2005/RUR-PLE/정수민]]<br /> <br /> ----<br /> [[데블스캠프2005/RUR-PLE]]<br /> </div>

imported>Unknown