Simple Java Simulation solution
\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        \n        int[] myCoords = {0, 0};\n        \n        while(true) {
```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        \n        int[] myCoords = {0, 0};\n        \n        while(true) {\n            // Check if we are at target\n            if(myCoords[0] == target[0] && myCoords[1] == target[1]) return true;  \n            for(int[] ghost : ghosts) {\n                // Update ghosts and see if theyr reach target first\n                updateTarget(target, ghost);\n                if(ghost[0] == target[0] && ghost[1] == target[1]) return false;\n            }\n            updateTarget(target, myCoords);\n        }\n        \n    }\n    \n    private void updateTarget(int[] target, int[] toUpdate) {\n        // Update the current array based on target\n        if(target[0] > toUpdate[0]) {\n            toUpdate[0]++;\n        } else if(target[0] < toUpdate[0]) {\n            toUpdate[0]--;\n        }\n        else if(target[1] > toUpdate[1]) {\n            toUpdate[1]++;\n        } else if(target[1] < toUpdate[1]) {\n            toUpdate[1]--;\n        }\n    }\n}\n```
[]