Log for YSITD

Finite State Machie

你要不要問問你自己(

0719803

有沒有演算法大神可以跟我講要怎麼解迷宮的

(

摸著牆壁走(

要實作有點難ㄅ

AStar

我要的是實作啊._.

你跟我講演算法我也知道啊只是要寫很久

輸入是一個二維陣列

maze[y][x]

有start.x start.y
end.x end.y

pm 12:34:36

python

pm 12:35:16

問問阿星他的ID 就是 AStar ㄋ

不要給我這種沒營養的答案好嗎

深度優先搜索

https://pypi.org/project/astar/

pm 12:36:45

Licson Lee

DFS

pm 12:37:06

這個比較有營養

就他媽的遞迴

戳到正確的路線就return

A*比B/DFS 還要適合走迷宮ㄅ

把迷宮路線當作三叉樹就知道什麼意思了

你寫成靠牆走我都行

現在是random

(然後根本走不到

那顏料法

不然在迷宮中仰望星斗

我要用二維陣列的實作RR

仰望耶穌

沒限制空間是小事啊

by龍應台

重點是我不會寫(跑

DFS非常短，很好寫啊

所以你需要code嗎ww

真的超短

要

[['1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1',

pm 12:41:03

 '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', '1', '1', '1', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['1', ' ', ' ',

pm 12:41:03

https://pastebin.com/mppS9PBx

 ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', 'M', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', 'O', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1'], ['1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1', ' ', ' ', ' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', '1'], ['1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1']]

參考測資(?

啊靠

DFS走迷宮的效率低到爆炸你知道嗎www

python歐ww

為什麼

對

跟深度優先一模一樣，只是走過的直接標成牆壁

s00
000
00t

從s出發到t

你知道你有多少可能的走法嗎

嗚嗚我只要知道這回合該往上下左右哪個方向就好

pm 12:43:16

def 走(位置):
把位置標記走過
如果是終點他搭
for 鄰近八個點：
如果可以走&沒走過：
走（那個點）

6！/(3！*3！)

我以前是用BFS寫的

BFS才是正解啦w

反正他也沒說要多快ㄋ

沒考慮過DFS的效率

比random快就好

但是我要code QQ

那我覺得random還比較好寫

雙向bfs

python有queue嗎

自己實做阿

好啦我去寫code了

def player_move(maze):
    player = find_player(maze)
    monster = find_monster(maze)
    print(player)
    print(monster)
    # print(maze[player['y']][player['x']])
    # print(maze[player['y']-1][player['x']]) # Up
    # print(maze[player['y']+1][player['x']]) # Down
    # print(maze[player['y']][player['x']-2]) # Left
    # print(maze[player['y']][player['x']+2]) # Right

    move = 0
    while move == 0:
        move = random.randint(1, 4)
        if move == 1 and maze[player['y']-1][player['x']] == '1':
            move = 0
            continue
        if move == 2 and maze[player['y']+1][player['x']] == '1':
            move = 0
            continue
        if move == 3 and maze[player['y']][player['x']-2] == '1':
            move = 0
            continue
        if move == 4 and maze[player['y']][player['x']+2] == '1':
            move = 0
            continue
    r.sendline(move_key[move-1])
    print(maze)

現在就是這麼垃圾(

只能保證不會撞牆

如果同時從兩端開始走，然後廣度優先，會比較快嗎？

pm 12:45:42

Brian Su

1是牆ㄇ

pm 12:45:45

給你ㄌ齁

pm 12:45:48

是

pm 12:46:08

BiDi-BFS

pm 12:46:12

你的return呢

pm 12:46:34

可是我覺得A*比較快

pm 12:46:41

要return啥

求解釋一下格子的定義

你的評分函數呢w

是說又沒說要多快

123
456
789
[[1,2,3],[4,5,6],[7,8,]]

pm 12:47:07

Fish Wang

也沒說盤面多大啊

pm 12:47:17

def dalun():

pm 12:47:21

一個方向

pm 12:47:28

不用啊

然後這東西先不管真的會跑不完顯然是錯的吧

你給我路徑我沒用我他媽只要方向RRRR

可以直接得到路徑吧．－．？

從路徑算方向啊？

哪裡

他那個連路徑都沒return

你標記為走過然後你沒有把他標記為沒走過R

標記沒走過...？

你是指初始設定？

反正現在random是長這樣啦

不是w

求 '' '0' '1' 'M' 的定義

為啥我要標記沒走過

會有迴圈

你會永遠繞路

''是路 O是Start 1是牆 M是End

pm 12:49:55

不會啊

按到ww

而且才四個你居然打錯了兩個ww

那明明是空白跟O

XDD

等等大佬你要說明ㄇ

是說要最短路徑嗎？

還是只要能到瞎雞巴走都沒差？

這個迷宮是定寬1隔的還是？

#include <bits/stdc++.h>
using namespace std;
vector<int> G[_N];
int dis[_N][_N] = {{0}};
bool visited[_N];
inline void bfs(int start) {
  memset(visited, 0, sizeof(visited));
  int now;
  dis[start][start] = 0;
  queue<int> q;
  q.push(start);
  while (!q.empty()) {
    now = q.front();
    q.pop();
    visited[now] = true;
    for (int i = 0; i < G[now].size(); i++) {
      if (!visited[G[now][i]]) {
        q.push(G[now][i]);
        visited[G[now][i]] = true;
        dis[start][G[now][i]] = dis[start][now] + 1;
      }
    }
  }
}

python有queue

改一下定義你就可以跑了

然後他應該也只有一條能就是我目測的

交給你了(跑

不會python(跑

自己作業

pm 12:52:49

自己寫

對我parse完了原本的格式很雞掰

其實不太算

歐歐有人寫了我就不寫囉XD

那不是python齁QQ

我從我的template拿出來的www

然後回到dfs的問題

等等你要不要教學一下

pm 12:54:17

Brian Su

你的code標記為走過之後不是會繼續往附近走嗎

pm 12:54:30

你這個是一維的吧

pm 12:54:35

對

那如果接下來遞迴的東西都沒有找到終點

不行啦你還是要寫(?

阿，這只是bfs的template

等等

ㄜ不對

不過有找到終點

我可以把某題的實作給你

你不能保證這是最短路阿

所以你不就需要把這個格子再mark成沒走過

pm 12:55:36

我沒有保證ㄋ

這樣下次換個方式走的時候才能再走

度阿所以說顯然是錯的

DFS沒有保證ㄅ

所以我從頭到尾都說不能DFS阿XDD

可是他沒有

pm 12:56:55

https://pastebin.com/YYXfP8hG

要求最短路啊

pm 12:56:59

けんき

pm 12:57:01

Fish Wang

所有有說要最短嗎…

pm 12:57:07

我只是給出個可行解

不習慣python寫演算法啦QQ

tioj1013那時候寫的解法...

不是說只要能到就好？

對 python 好難

我記得沒寫很好

真的歐

基本上就是先把map改成一行字串

廣度優先直接loop寫會不會比較快？

不過其實也就是在最後加個 visted = false 而已

本來就是loop?

我記得只有DFS是地回

dx_ls = [0, 1, 0, -1]
dy_ls = [1, 0, -1, 0]
for dx, dy in zip(dx_ls, dy_ls):
xx = x + dx
yy = y + dy
#(xx, yy) is the new point

這個東西很好用w

基本上就是bfs的queue的元素變成pair

不然我下次出八方位的題目

你就要複製八遍了

你們，都演算法大師

你的變數命名(?

你看過題目大概會知道意思

因為這個題目每個時刻會多一個牆壁

喔喔這個好讚

pm 01:02:22

https://blog.wtako.net/view/20/%E8%A9%A6%E4%B8%8B%E7%94%A8python%E6%95%B4a*-search

我以前都是這麼幹ㄉ

zip是python的東西嗎

是

不然也可以寫成
for(int i = 0;i < 4;i ++){
int xx = x + dx[i], yy = y + dy[i];
}

兩個for

看完之後我覺得找別人的比較快

一個就行啦

www

其實就是bfs的元素改成pair

好

python
s = (1, 1)
t = (5, 5)
prev = [[0] * m] * n
dis = [[-1] * m] * n
dis[s[0]][s[1]] = 0
q = [s]
it = 0

dx_ls = [0, 1, 0, -1]
dy_ls = [1, 0, -1, 0]

while it < len(q):
    now = q[it]
    if now == t:
        break
    it += 1
    for dx, dy in zip(dx_ls, dy_ls):
        xx = now[0] + dx
        yy = now[1] + dy
        if d[xx][yy] is not obstacle and dis[xx][yy] == -1:
            dis[xx][yy] = dis[now[0]][now[1]] + 1
            prev[xx][yy] = now
            q.append((xx, yy))

if dis[t[0]][t[1]] == -1:
    print("Dest is not reachable!")
    exit(1)
now = t
history = []
while now != s:
    history.append(now)
    now = prev[now[0]][now[1]]
history.append(s)
history = history[::-1]
print("Step: {}".format(dis[t[0]][t[1]]))
for p in history:
    print("({}, {})".format(p[0], p[1]))

我很偷懶歐

d[xx][yy] is not obstacle
這句再自己改

q 是 queue

然後輸出是最短路徑上的每一個點

會先輸出最短距離

我沒有檢查過所以可能會有錯XD

._.

不過概念就上面那樣啦跟前面那份c++ code應該差不多

剛剛寫了一下

這樣哪裡有問題R

為什麼是2阿

就 y的移動距離是2

歐歐

改1也不會動R

祝debug愉快

@mmis1000 顏料法不會動QQ

那你一定寫錯了（幹話

好喔

不知道為什麼沒有判斷到wall

-.-

你好

應該就是你想要的東西

@seadog007 看看 Ubnt 苦主

是但是我要先看懂它然後改他

尼的拍森好C

TypeError: unbound method distance() must be called with AStarGrid instance as first argument (got tuple instance instead)

@seadog007 尼考完期末了喔

正在

🤔

所以我才來求救(?

雞掰題目

期末可以求救喔wwww

C 是優越的語言

寫得像 C 其實不錯（

把每個可能性都存起來會不會記憶體爆炸

wtf

:1,"y":53},{"x":2,"y":53},{"x":3,"y":53},{"x":3,"y":54},{"x":3,"y":55},{"x":3,"y":56},{"x":3,"y":57},{"x":2,"y":57},{"x":1,"y":57},{"x":1,"y":58},{"x":1,"y":59},{"x":1,"y":60},{"x":1,"y":61},{"x":2,"y":61},{"x":3,"y":61},{"x":4,"y":61},{"x":5,"y":61},{"x":6,"y":61},{"x":7,"y":61},{"x":7,"y":60},{"x":7,"y":59},{"x":8,"y":59},{"x":9,"y":59},{"x":9,"y":60},{"x":9,"y":61},{"x":10,"y":61},{"x":11,"y":61},{"x":12,"y":61},{"x":13,"y":61},{"x":14,"y":61},{"x":15,"y":61},{"x":16,"y":61},{"x":17,"y":61},{"x":17,"y":60},{"x":17,"y":59},{"x":17,"y":58},{"x":17,"y":57},{"x":17,"y":56},{"x":17,"y":55},{"x":18,"y":55},{"x":19,"y":55},{"x":19,"y":56},{"x":19,"y":57},{"x":19,"y":58},{"x":19,"y":59},{"x":19,"y":60},{"x":19,"y":61},{"x":20,"y":61},{"x":21,"y":61},{"x":22,"y":61},{"x":23,"y":61},{"x":23,"y":60},{"x":23,"y":59},{"x":22,"y":59},{"x":21,"y":59},{"x":21,"y":58},{"x":21,"y":57},{"x":21,"y":56},{"x":21,"y":55},{"x":22,"y":55},{"x":23,"y":55},{"x":24,"y":55},{"x":25,"y":55},{"x":25,"y":56},{"x":25,"y":57},{"x":25,"y":58}]

pm 02:09:20

Fish Wang

@seadog007 [{"x":29,"y":33},{"x":29,"y":32},{"x":29,"y":31},{"x":30,"y":31},{"x":31,"y":31},{"x":31,"y":30},{"x":31,"y":29},{"x":31,"y":28},{"x":31,"y":27},{"x":31,"y":26},{"x":31,"y":25},{"x":31,"y":24},{"x":31,"y":23},{"x":31,"y":22},{"x":31,"y":21},{"x":31,"y":20},{"x":31,"y":19},{"x":31,"y":18},{"x":31,"y":17},{"x":31,"y":16},{"x":31,"y":15},{"x":31,"y":14},{"x":31,"y":13},{"x":31,"y":12},{"x":31,"y":11},{"x":31,"y":10},{"x":31,"y":9},{"x":31,"y":8},{"x":31,"y":7},{"x":31,"y":6},{"x":31,"y":5},{"x":31,"y":4},{"x":31,"y":3},{"x":30,"y":3},{"x":29,"y":3},{"x":28,"y":3},{"x":27,"y":3},{"x":26,"y":3},{"x":25,"y":3},{"x":24,"y":3},{"x":23,"y":3},{"x":23,"y":4},{"x":23,"y":5},{"x":22,"y":5},{"x":21,"y":5},{"x":21,"y":6},{"x":21,"y":7},{"x":21,"y":8},{"x":21,"y":9},{"x":21,"y":10},{"x":21,"y":11},{"x":21,"y":12},{"x":21,"y":13},{"x":20,"y":13},{"x":19,"y":13},{"x":19,"y":14},{"x":19,"y":15},{"x":19,"y":16},{"x":19,"y":17},{"x":19,"y":18},{"x":19,"y":19},{"x":19,"y":20},{"x":19,"y":21},{"x":18,"y":21},{"x":17,"y":21},{"x":17,"y":22},{"x":17,"y":23},{"x":17,"y":24},{"x":17,"y":25},{"x":16,"y":25},{"x":15,"y":25},{"x":15,"y":26},{"x":15,"y":27},{"x":15,"y":28},{"x":15,"y":29},{"x":14,"y":29},{"x":13,"y":29},{"x":13,"y":30},{"x":13,"y":31},{"x":13,"y":32},{"x":13,"y":33},{"x":14,"y":33},{"x":15,"y":33},{"x":15,"y":34},{"x":15,"y":35},{"x":15,"y":36},{"x":15,"y":37},{"x":15,"y":38},{"x":15,"y":39},{"x":15,"y":40},{"x":15,"y":41},{"x":14,"y":41},{"x":13,"y":41},{"x":13,"y":40},{"x":13,"y":39},{"x":12,"y":39},{"x":11,"y":39},{"x":10,"y":39},{"x":9,"y":39},{"x":9,"y":38},{"x":9,"y":37},{"x":9,"y":36},{"x":9,"y":35},{"x":10,"y":35},{"x":11,"y":35},{"x":11,"y":34},{"x":11,"y":33},{"x":11,"y":32},{"x":11,"y":31},{"x":10,"y":31},{"x":9,"y":31},{"x":8,"y":31},{"x":7,"y":31},{"x":7,"y":30},{"x":7,"y":29},{"x":7,"y":28},{"x":7,"y":27},{"x":7,"y":26},{"x":7,"y":25},{"x":7,"y":24},{"x":7,"y":23},{"x":8,"y":23},{"x":9,"y":23},{"x":10,"y":23},{"x":11,"y":23},{"x":12,"y":23},{"x":13,"y":23},{"x":14,"y":23},{"x":15,"y":23},{"x":15,"y":22},{"x":15,"y":21},{"x":15,"y":20},{"x":15,"y":19},{"x":15,"y":18},{"x":15,"y":17},{"x":15,"y":16},{"x":15,"y":15},{"x":14,"y":15},{"x":13,"y":15},{"x":13,"y":16},{"x":13,"y":17},{"x":12,"y":17},{"x":11,"y":17},{"x":10,"y":17},{"x":9,"y":17},{"x":8,"y":17},{"x":7,"y":17},{"x":7,"y":16},{"x":7,"y":15},{"x":6,"y":15},{"x":5,"y":15},{"x":5,"y":14},{"x":5,"y":13},{"x":5,"y":12},{"x":5,"y":11},{"x":4,"y":11},{"x":3,"y":11},{"x":2,"y":11},{"x":1,"y":11},{"x":1,"y":12},{"x":1,"y":13},{"x":1,"y":14},{"x":1,"y":15},{"x":1,"y":16},{"x":1,"y":17},{"x":2,"y":17},{"x":3,"y":17},{"x":4,"y":17},{"x":5,"y":17},{"x":5,"y":18},{"x":5,"y":19},{"x":5,"y":20},{"x":5,"y":21},{"x":5,"y":22},{"x":5,"y":23},{"x":5,"y":24},{"x":5,"y":25},{"x":5,"y":26},{"x":5,"y":27},{"x":5,"y":28},{"x":5,"y":29},{"x":4,"y":29},{"x":3,"y":29},{"x":3,"y":28},{"x":3,"y":27},{"x":3,"y":26},{"x":3,"y":25},{"x":3,"y":24},{"x":3,"y":23},{"x":2,"y":23},{"x":1,"y":23},{"x":1,"y":24},{"x":1,"y":25},{"x":1,"y":26},{"x":1,"y":27},{"x":1,"y":28},{"x":1,"y":29},{"x":1,"y":30},{"x":1,"y":31},{"x":1,"y":32},{"x":1,"y":33},{"x":2,"y":33},{"x":3,"y":33},{"x":4,"y":33},{"x":5,"y":33},{"x":5,"y":34},{"x":5,"y":35},{"x":5,"y":36},{"x":5,"y":37},{"x":5,"y":38},{"x":5,"y":39},{"x":5,"y":40},{"x":5,"y":41},{"x":6,"y":41},{"x":7,"y":41},{"x":7,"y":42},{"x":7,"y":43},{"x":7,"y":44},{"x":7,"y":45},{"x":8,"y":45},{"x":9,"y":45},{"x":9,"y":44},{"x":9,"y":43},{"x":10,"y":43},{"x":11,"y":43},{"x":11,"y":44},{"x":11,"y":45},{"x":12,"y":45},{"x":13,"y":45},{"x":14,"y":45},{"x":15,"y":45},{"x":15,"y":46},{"x":15,"y":47},{"x":15,"y":48},{"x":15,"y":49},{"x":14,"y":49},{"x":13,"y":49},{"x":12,"y":49},{"x":11,"y":49},{"x":10,"y":49},{"x":9,"y":49},{"x":9,"y":50},{"x":9,"y":51},{"x":9,"y":52},{"x":9,"y":53},{"x":8,"y":53},{"x":7,"y":53},{"x":6,"y":53},{"x":5,"y":53},{"x":5,"y":52},{"x":5,"y":51},{"x":5,"y":50},{"x":5,"y":49},{"x":5,"y":48},{"x":5,"y":47},{"x":4,"y":47},{"x":3,"y":47},{"x":3,"y":48},{"x":3,"y":49},{"x":2,"y":49},{"x":1,"y":49},{"x":1,"y":50},{"x":1,"y":51},{"x":1,"y":52},{"x"

我就用你那個齁

https://jsbin.com/ziwuhetuzo/edit?html,js,output

我又沒存

我知道，應該是漏掉了 @staticmethod

我在想遞迴的 stack

我更新了

會不會蹦蹦

只要一個迴圈就夠了啊...

可是他是JS

他跟python夠近了，自己改啊

然後我給的那個sample是錯的(

怪我囉(

這有啥演算法能用ㄇ

還是爆破

let any2d = (arr_arr, fn)=>
    arr_arr.any(
        (arr, i)=>
            arr.any(
                (item, j)=>
                    fn(item, i, j)
            )
    )

對不起小弟能力不足以把這個翻python

那是找出2d array裡哪個是x

js沒內建這種操作，所以隨便寫個

@nekomata_saren 好喔感謝成功了我直接把它全部加上self了(

👍🏻

恩不對

他484穿牆了

你要看看generate_neighbors

這ㄍ用 list comp ㄅ

額可是圖出來是對的耶

for cell in n:
if self.grid[cell[1]][cell[0]]:
n.remove(cell)
這句很重要，上下左右把撞牆的可能性刪掉

把走過的當牆不就好了...

直接塗掉

是說這好像能拿來寫個顏料法的 virtualize

pm 02:25:03

走過的會被直接無視
for neighbor in self.generate_neighbors(parent):
if neighbor in closed_list:
continue

不是啊圖畫出來正常的話

我是說沒必要區分走過的跟強

不就代表grid裡面是對的嗎

沒有分開存的意義

可是如果別的測資

那裡的確有牆

對

所以我覺得是generate_neighbors那裡出問題了

迷宮格式是什麼？

2d list

你現在的code和測資能給我嗎

linux機器嗎?

yes

感動

終於寫好了

可怕ㄉ東西

為什有幾個比你高

time

我覺得夠了就閃了

6:30~8:30

他們 6:30~10:00

基因演算法ㄚ

然後

l = [1, 2, 3, 4]
for i in l:
if i % 2 == 0:
l.remove(i)

真夠雷

怎麼reproduce不到

這什麼鬼bug

def generate_neighbors(self, p):
movements = [(-1, 0), (1, 0), (0, -1), (0, 1)]
candidates = map(lambda m: (p[0] + m[0], p[1] + m[1]) , movements)
valid_candidates = filter(lambda c: not self.grid[c[1]][c[0]], candidates)
return valid_candidates

pm 05:14:20

Cute_ Panda 🐼 就業了，Still 窮。

這樣寫會更好，只是我那時候不會map filter lambda

map filter大法好

順便推歌any every

直接讓accessor幹

範圍外都牆壁

getSlot
setSlot
什麼的

是說python能重新定義操作子吧

弄一個範圍外都回答填滿的array wrapper如何？

nice

徹底拉開差距了(

期末考

偏振鏡

我把兩個疊在一起他不會變黑

要轉R

這應該不是

轉過了r

那是半反

還是他要轉超過360度

沒有好ㄇ

吶至少我不會自動自嗨

不要想不開而且我想我們沒有需要浪費時間攻擊它

pm 05:47:26

sooxiaotong@tg

我突然想起我的server还开着squid😰

來，我 nmap 掃看看

給我 Domain Name

幹我今天要去哪讀書rrr

圖書館？

走迷宮好恐怖(

有人的 Google Play 也有這樣的問題嗎

確定網路沒事

讀殺小

看vtuber

聽說

我帶青軸去期末考

然後被靠北了ww

笑死

我該道歉+diss一波ㄇ

先說造成您的困擾了了不好意思

別W

然後說這麼容易分心你還是別寫程式好了 5題從6:30寫到10點寫不完

有沒有考慮退學

對不起齁我也很容易分心

不過鍵盤的穩定清脆聲響應該還好

重點是我8:30就離開ㄌ

如果是抖腳撞東西一直發出聲音(ry

XDD 嗆

我覺得啦

這件事情啦

的機掰人是你

我只是盡可能維持我平常寫Code效率R

你知道學校電腦那個鍵盤滑鼠

人家也想維持它平常ㄉ寫code效率阿

那個Windows

你可以不要用青軸r

我想並沒有(

那你買一把靜音紅軸給我

因為我個人對噪音有點小敏感能體會它的感受(?

你可以帶耳機啊(

喔是說

自備耳塞

如果全用他的設備+ CodeBlock或DevC++

我一定寫不完

一堆滑鼠滾輪壞的

鍵盤還會黏(兩種意義上

噁心(

是說那個第四題

我只寫了9行

我反感 Dev C++

堅持 VIM + Clang

帶自己的ANC耳機阿#

7$又上電視ㄌ耶

https://www.mjib.gov.tw/news/Details?Module=1&id=421

這誰

我寫程式還好

我啊

https://edu-ctf.zoolab.org/

pm 07:42:07

總之老板不每15分鐘叫我出來說這有問題要修就行

不然我絕對會罵髒話

那題佔多少分？

出題者吸很多

動態配分的

目前498

只有你解決？

3 Solved

前一個跟我差20min

噢…

QQ 沒被py2雷的話就first blood了

目前拿了4個First Blood 總共15題

pm 07:45:41

我記得我只試過把朋友學校的ctf web部份整個rm -rf掉

我覺得這裡有其他人做過

佢認定係你rm rf 佢個web server
@husky7x24

@nekomata_saren 你條仆街

還上來說rm -rf完web題全部連不上怎麼辦

然後我就笑死

修復題目，回復備份，補回時間

是說只要默默的幹，web題分數就全部拿下了不是嗎(x

pm 07:49:45