Deep learning and computer chess (part 2)
A machine would need more than 10^90 years to make the first chess move using brute force method. To address this problem, various strategies based on minimax algorithms and deep learning advancements have surfaced throughout time. One innovation that is able to address this problem is giraffe ar...
Saved in:
Main Author: | Seah, Yu Liang |
---|---|
Other Authors: | He Ying |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/162926 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Deep learning and computer chess (part 2)
by: Ngoh, Guang Wei
Published: (2020) -
Deep learning and computer chess (part 2)
by: Lee, Zachary Varella Zheyu,
Published: (2023) -
Deep learning and computer chess (part 2)
by: Xu, Shiguang
Published: (2022) -
Deep learning and computer chess (part 1)
by: Ngui, Seng Yang
Published: (2020) -
Deep learning for computer chess (part 1)
by: Arora, Manav
Published: (2022)