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%2F%EC%A1%B0%ED%98%84%ED%83%9C 2026-05-15T12:30:04Z 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/%EC%A1%B0%ED%98%84%ED%83%9C&diff=85388&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-l136">Line 136:</td> <td colspan="2" class="diff-lineno">Line 136:</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>2개의 알고리즘이 저장되어 있는 코드파일 링크</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>2개의 알고리즘이 저장되어 있는 코드파일 링크</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;">[[:File:</del>test_dine_4.rur<del style="font-weight: bold; text-decoration: none;">|test_dine_4.rur]]</del></div></td><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: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>test_dine_4.rur</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>== Thread ==</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>== Thread ==</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>* 장하다~ 빠른걸 다시 만들었구나 ㅋ - [[상협]]</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>---</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/%EC%A1%B0%ED%98%84%ED%83%9C&diff=46109&oldid=prev 2021-02-07T05:28:59Z

<p></p> <p><b>New page</b></p><div>미로찾기 알고리즘<br /> 삐삐가 있는곳이 출구로 가정된다.<br /> 단 삐삐는 미로의 출구(즉 미로의 외곽벽과 인접한 위치)에 있어야만 한다.<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 /> 소트 알고리즘<br /> 저번 소트 알고리즘을 한층 강화한 고속 소트알고리즘이다.<br /> 여러가지 환경에서 테스트를 수행하였으며, 문제가 있을경우 [[조현태]]페이지에 올려놓으면 빠른시일내에 해결하도록 노력하겠습니다.<br /> 파일을 copy/paste하는 과정에서 중간중간에 빈 줄이 생겼는데, 일부 삭제하였으나 남은 것이 있을 경우 지우고 사용해야 합니다.(단 함수와 함수사이는 아닙니다.)<br /> 소트 함수명은 sort()입니다.<br /> 리펙토링이 덜된 이유는 리펙토링을 하면 할수록 느려지는듯한 문제가(인터프리터방식으로 인한듯)있는듯 하기때문 입니다.<br /> <br /> <br /> def sort_sub():<br /> move()<br /> if next_to_a_beeper():<br /> pick_beeper()<br /> turn_left()<br /> turn_left()<br /> while not next_to_a_beeper():<br /> move()<br /> turn_left()<br /> turn_left()<br /> move()<br /> put_beeper()<br /> <br /> def sort_sub_sub():<br /> while front_is_clear():<br /> move()<br /> if next_to_a_beeper():<br /> pick_beeper()<br /> turn_left()<br /> move()<br /> turn_left()<br /> while not next_to_a_beeper():<br /> move()<br /> while next_to_a_beeper():<br /> if front_is_clear():<br /> move()<br /> else:<br /> break<br /> turn_left()<br /> move()<br /> if right_is_clear():<br /> turn_left()<br /> move()<br /> else:<br /> turn_left()<br /> put_beeper()<br /> break<br /> <br /> def gaedan():<br /> while next_to_a_beeper():<br /> if front_is_clear():<br /> move()<br /> else:<br /> break<br /> while front_is_clear():<br /> sort_sub()<br /> turn_left()<br /> turn_left()<br /> while not next_to_a_beeper():<br /> if front_is_clear():<br /> move()<br /> else:<br /> turn_off() <br /> while next_to_a_beeper():<br /> if front_is_clear():<br /> move()<br /> else:<br /> break<br /> turn_left()<br /> if front_is_clear():<br /> move()<br /> else:<br /> turn_off()<br /> if right_is_clear():<br /> turn_left()<br /> move()<br /> else:<br /> turn_left()<br /> if not next_to_a_beeper():<br /> sort_sub_sub()<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 /> while not next_to_a_beeper():<br /> move()<br /> while next_to_a_beeper():<br /> if front_is_clear():<br /> move()<br /> else:<br /> break<br /> turn_left()<br /> if right_is_clear():<br /> turn_left()<br /> move()<br /> else:<br /> turn_left()<br /> move()<br /> while 1:<br /> gaedan()<br /> <br /> def turn_right(): <br /> repeat(turn_left,3) <br /> <br /> sort() <br /> <br /> ---<br /> 2개의 알고리즘이 저장되어 있는 코드파일 링크<br /> [[:File:test_dine_4.rur|test_dine_4.rur]]<br /> == Thread ==<br /> * 장하다~ 빠른걸 다시 만들었구나 ㅋ - [[상협]]<br /> ---<br /> [[데블스캠프2005/RUR-PLE]]<br /> </div>

imported>Unknown