https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0%2F%EC%83%81%EC%9A%B1%26%EC%9D%B8%EC%88%98 2026-05-15T10:45:27Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%83%81%EC%9A%B1%26%EC%9D%B8%EC%88%98&diff=85596&oldid=prev 2026-03-27T00:44:58Z

<p>Repair batch-0005 pages from live compare</p> <a href="https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%83%81%EC%9A%B1%26%EC%9D%B8%EC%88%98&amp;diff=85596&amp;oldid=50524">Show changes</a>

Maintenance script https://mediawiki.zeropage.org/index.php?title=%EB%AF%B8%EB%A1%9C%EC%B0%BE%EA%B8%B0/%EC%83%81%EC%9A%B1%26%EC%9D%B8%EC%88%98&diff=50524&oldid=prev 2021-02-07T05:29:31Z

<p></p> <p><b>New page</b></p><div>=== MazeBoard.java ===<br /> import java.awt.Point;<br /> <br /> public class MazeBoard {<br /> public int boardMatrix[][];<br /> public static int WALL = 0;<br /> public static int PATH = 1;<br /> public static int END = 2;<br /> public static int BLOCK = 3;<br /> <br /> public MazeBoard(int boardMatrix[][]) {<br /> int x = boardMatrix[0].length;<br /> int y = boardMatrix.length;<br /> this.boardMatrix = new int[y+2][x+2];<br /> for(int i = 0 ; i &amp;lt; x ; ++i)<br /> for(int j = 0 ; j &amp;lt; y ; ++j)<br /> this.boardMatrix[j+1][i+1] = boardMatrix[j][i];<br /> }<br /> public boolean isEndPoint(Point point) {<br /> return getBoardSymbol(point) == END;<br /> }<br /> public boolean isOpened(Point pt) {<br /> return getBoardSymbol(pt) != MazeBoard.WALL &amp;amp;&amp;amp;<br /> getBoardSymbol(pt) != MazeBoard.BLOCK; <br /> }<br /> public int getBoardSymbol(Point pt) {<br /> return boardMatrix[pt.y][pt.x];<br /> }<br /> }<br /> <br /> === Player.java ===<br /> import java.awt.Point;<br /> import java.util.Vector;<br /> <br /> public class Player {<br /> public Vector tracedPath = new Vector();<br /> public MazeBoard board;<br /> <br /> public static final int E = 0;<br /> public static final int S = 1;<br /> public static final int W = 2;<br /> public static final int N = 3;<br /> <br /> public static final Point directionTable[] =<br /> { new Point(1, 0), new Point(0, 1), new Point(-1, 0), new Point(0, -1)};<br /> <br /> public Player(int x, int y, MazeBoard board) {<br /> tracedPath.add(new Point(0,0));<br /> tracedPath.add(new Point(x + 1, y + 1));<br /> this.board = board; <br /> }<br /> public void move() {<br /> for (int i = 0; i &amp;lt; 4; ++i) {<br /> Point curPoint = new Point( getLastPoint() );<br /> if ( isValidMove(curPoint,i) ) {<br /> curPoint.x += directionTable[i].x;<br /> curPoint.y += directionTable[i].y;<br /> tracedPath.add( new Point(curPoint) );<br /> return;<br /> }<br /> }<br /> backToPrev();<br /> }<br /> public boolean isValidMove(Point curPoint, int nth) {<br /> Point nextPt = new Point( curPoint.x + directionTable[nth].x, <br /> curPoint.y + directionTable[nth].y );<br /> Point prevPt = (Point) tracedPath.elementAt(tracedPath.size() - 2); <br /> return board.isOpened(nextPt) &amp;amp;&amp;amp; getDirection(nextPt)!= getDirection(prevPt);<br /> }<br /> public int getDirection(Point point) {<br /> Point curPoint = new Point(getLastPoint());<br /> if (point.x &amp;gt; curPoint.x)<br /> return E;<br /> if (point.x &amp;lt; curPoint.x)<br /> return W;<br /> if (point.y &amp;gt; curPoint.y)<br /> return S;<br /> return N;<br /> }<br /> public Point getLastPoint() {<br /> return (Point)tracedPath.get(tracedPath.size() - 1);<br /> }<br /> public void traverseMaze() {<br /> while( !board.isEndPoint( getLastPoint() ) )<br /> move();<br /> }<br /> public void backToPrev() {<br /> Point pt = new Point(getLastPoint());<br /> board.boardMatrix[pt.y][pt.x] = MazeBoard.BLOCK;<br /> tracedPath.remove( tracedPath.size()-1 ); <br /> }<br /> }<br /> <br /> === MazeTestCase ===<br /> import java.awt.Point;<br /> import java.util.Vector;<br /> <br /> import junit.framework.TestCase;<br /> <br /> public class MazeTestCase extends TestCase {<br /> final int X = 3;<br /> final int Y = 3;<br /> int mazeBoard[][] = { {1,1,0}, {0,1,0}, {0,1,2} }; <br /> MazeBoard mb = new MazeBoard(mazeBoard);<br /> Player player = new Player(0,0,mb);<br /> <br /> public MazeTestCase(String title) {<br /> super(title);<br /> }<br /> public void testCreation() {<br /> int expected[][] = { {0,0,0,0,0}, {0,1,1,0,0}, {0,0,1,0,0},<br /> {0,0,1,2,0}, {0,0,0,0,0} };<br /> for(int i = 0 ; i &amp;lt; X+2 ; ++i) <br /> for(int j = 0 ; j &amp;lt; Y+2 ; ++j) <br /> assertEquals(expected[j][i], mb.boardMatrix[j][i]);<br /> }<br /> public void testMovement() {<br /> Point expectedPoint[] = { new Point(2,1), new Point(2,2),<br /> new Point(2,3), new Point(3,3) };<br /> for(int i = 0 ; i &amp;lt; 4 ; ++i) {<br /> player.move();<br /> assertEquals( expectedPoint[i], player.getLastPoint() ); <br /> }<br /> }<br /> public void testMovement2() {<br /> Vector expected = new Vector();<br /> Point pt[] = {new Point(0,0), new Point(1,1), new Point(2,1),<br /> new Point(2,2), new Point(2,3), new Point(3,3)};<br /> for(int i = 0 ; i &amp;lt; pt.length ; ++i)<br /> expected.add(pt[i]); <br /> player.traverseMaze();<br /> assertEquals( expected, player.tracedPath );<br /> }<br /> public void testJudge() {<br /> Point point = new Point(2,1);<br /> assertEquals(Player.E, player.getDirection(point));<br /> point.setLocation(1,2);<br /> assertEquals(Player.S, player.getDirection(point));<br /> } <br /> public void testEnd() {<br /> player.traverseMaze();<br /> Point point = player.getLastPoint();<br /> assertEquals(2, mb.boardMatrix[point.y][point.x]); <br /> } <br /> }<br /> <br /> === ComplexMazeTestCase ===<br /> import java.awt.Point;<br /> import junit.framework.TestCase;<br /> <br /> public class ComplexMazeTestCase extends TestCase {<br /> int complexMatrix[][] = {{1,1,1,0},{0,0,1,0},{1,1,1,1},{2,0,0,0}};<br /> MazeBoard mb = new MazeBoard(complexMatrix);<br /> Player player = new Player(0,0,mb);<br /> <br /> public void testBlocked() {<br /> for(int i = 0 ; i &amp;lt; 5 ; ++i)<br /> player.move(); <br /> player.backToPrev();<br /> assertEquals(MazeBoard.BLOCK, mb.getBoardSymbol(new Point(4,3)));<br /> assertEquals(new Point(3,3), player.getLastPoint());<br /> }<br /> <br /> public void testAll() {<br /> Point expected[] = {new Point(0,0), new Point(1,1), new Point(2,1),<br /> new Point(3,1), new Point(3,2), new Point(3,3),<br /> new Point(2,3), new Point(1,3), new Point(1,4)}; <br /> player.traverseMaze();<br /> for(int i = 0 ; i &amp;lt; expected.length ; i++)<br /> assertEquals(expected[i], (Point) player.tracedPath.get(i));<br /> }<br /> <br /> public void testAcceptance1() {<br /> int matrix[][] = { {1,1,0,0,0,0},<br /> {0,1,1,1,1,0},<br /> {0,0,0,0,1,0},<br /> {0,0,0,0,2,0} }; <br /> MazeBoard maze = new MazeBoard(matrix);<br /> Player p = new Player(0,0,maze);<br /> p.traverseMaze();<br /> <br /> assertEquals(new Point(5,4), p.getLastPoint());<br /> } <br /> public void testAcceptance2() {<br /> int matrix[][] = {{1,1,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,1,1,1,1,0,0,1,0,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0},<br /> {0,0,0,0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,1,1,0,0,0,0},<br /> {0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,0,0},<br /> {1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0},<br /> {1,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0},<br /> {1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0},<br /> {1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0},<br /> {1,0,0,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0},<br /> {1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0},<br /> {0,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0},<br /> {1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,1,1,0,0,0},<br /> {0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,1,1,1,2}}; <br /> MazeBoard maze = new MazeBoard(matrix);<br /> Player p = new Player(0,0,maze);<br /> p.traverseMaze();<br /> <br /> assertEquals(new Point(30,20), p.getLastPoint());<br /> }<br /> }<br /> <br /> === MazeFrame.java ===<br /> import java.awt.*;<br /> <br /> import javax.swing.*;<br /> <br /> public class MazeFrame extends JApplet {<br /> JButton mazeUnit[][] = new JButton[20][30];<br /> MazeBoard maze;<br /> Player player; <br /> public void init() {<br /> int matrix[][] = {{1,1,0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,1,1,1,1,0,0,1,0,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0},<br /> {0,0,0,0,1,1,1,1,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,1,1,0,0,0,0},<br /> {0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,0,0},<br /> {1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0},<br /> {1,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0},<br /> {1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0},<br /> {1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0},<br /> {1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0},<br /> {1,0,0,0,0,0,0,0,1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0},<br /> {1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0},<br /> {0,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0,0,0,0},<br /> {1,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0},<br /> {0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,1,1,1,0,0,0},<br /> {0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,0,0,1,1,1,2}}; <br /> maze = new MazeBoard(matrix);<br /> player = new Player(0,0,maze);<br /> player.traverseMaze();<br /> <br /> getContentPane().setLayout(new GridLayout(20,30));<br /> for(int i = 0 ; i &amp;lt; 20 ; ++i) {<br /> for(int j = 0 ; j &amp;lt; 30 ; ++j) {<br /> mazeUnit[i][j] = new JButton();<br /> <br /> int boardSymbol = maze.getBoardSymbol(new Point(j+1,i+1)); <br /> if( boardSymbol == MazeBoard.WALL ) <br /> mazeUnit[i][j].setBackground(Color.BLACK); <br /> else if( boardSymbol == MazeBoard.PATH ||<br /> boardSymbol == MazeBoard.BLOCK ) <br /> mazeUnit[i][j].setBackground(Color.WHITE); <br /> getContentPane().add(mazeUnit[i][j]);<br /> }<br /> }<br /> setSize(600,600);<br /> setVisible(true);<br /> <br /> traverse();<br /> }<br /> public void traverse() {<br /> for(int i = 1 ; i &amp;lt; player.tracedPath.size() ; ++i) {<br /> Point pt = (Point)player.tracedPath.get(i);<br /> mazeUnit[pt.y-1][pt.x-1].setBackground(Color.RED);<br /> }<br /> }<br /> <br /> }<br /> </div>

imported>Unknown