New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

第六次作業 -- 請選一個 DFS, BFS 的問題自己寫程式解出來 #6

Open

ccckmit opened this issue Apr 24, 2019 · 1 comment

Contributor

ccckmit commented Apr 24, 2019 •

edited

Loading

http://misavo.com/view/ai/chapter4.md

以深度優先搜尋解決老鼠走迷宮問題
以廣度優先搜尋解決拼圖問題
『狼、羊、甘藍菜』過河的問題
八皇后互不攻擊問題
- https://zh.wikipedia.org/wiki/%E5%85%AB%E7%9A%87%E5%90%8E%E9%97%AE%E9%A2%98

blackstuend commented May 1, 2019

皇后 : https://github.com/blackstuend/ai107b/blob/master/search_work/find_every_queue.js

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment