-
-
Notifications
You must be signed in to change notification settings - Fork 397
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
d93d4ad
commit 5e6f75c
Showing
7 changed files
with
43 additions
and
143 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,11 +1,9 @@ | ||
# 24数码问题 | ||
# 24 Puzzle | ||
|
||
人工智能课第三次作业 | ||
### Description | ||
|
||
### 问题描述 | ||
Solve 24 puzzle problem. | ||
|
||
求解24数码问题 | ||
### Approach | ||
|
||
### 方法 | ||
|
||
启发式搜索 | ||
Heuristic Search |
This file was deleted.
Oops, something went wrong.
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,16 +1,14 @@ | ||
# 基于遗传算法的优化问题求解 | ||
# Genetic Algorithm for Functional Maximum Problem | ||
|
||
人工智能课第二次作业 | ||
### Description | ||
|
||
### 问题 | ||
Find out the maximum value of the function *f(x)=x+10sin(5x)+7cos(4x)* in the range [0, 9]. | ||
|
||
求解函数 f(x)=x+10sin(5x)+7cos(4x) 在区间[0,9]的极大值 | ||
### Approach | ||
|
||
### 方法 | ||
Genetic Algorithm | ||
|
||
遗传算法 | ||
|
||
### 答案 | ||
### Ground Truth | ||
|
||
24.8553627239529 | ||
x = 7.857 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,13 +1,9 @@ | ||
# 百万皇后问题 | ||
# Million Queens | ||
|
||
人工智能课第四次作业 | ||
### Description | ||
|
||
### 问题描述 | ||
Solve million queens problem. | ||
|
||
求解百万皇后问题 | ||
### Approach | ||
|
||
### 方法 | ||
|
||
采用QS4算法,求解3000000皇后一般能在3秒之内得到一个可行解,若未搜索到随机重启。 | ||
|
||
算法来自 Sosic, R.; Gu, J. 3,000,000 Queens in less than one minute. ACM SIGART Bulletin, 1991, 2(2). | ||
QS4 algorithm [Sosic, R.; Gu, J. 3,000,000 Queens in less than one minute. ACM SIGART Bulletin, 1991, 2(2).] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters