Advertisement
Check these out next
Beating us at our own Games
Sep. 22, 2017•0 likes•89 views
1 likes
Be the first to like this
Show More
views
Total views
0
On Slideshare
0
From embeds
0
Number of embeds
0
Download to read offline
Report
Technology
Talk given at KPMG innovation workshop held on 2017-09-22
Melvin ZhangFollow
Programmer at Cosmiqo · MagarenaAdvertisement
Advertisement
Advertisement
Recommended
Being Practical About Artificial Intelligence (Forbes U30 Summit 2016)Tarun Gangwani
IEEE big data 2015Dippy Aggarwal
ChimpanzeeThe Lower School
Make it Fixable (CppCon 2018)Patricia Aas
Xamarin essentials un API cross-platform para gobernarlos a todosLuis Beltran
AI for IA's: Machine Learning Demystified at IA Summit 2017 - IAS17Carol Smith
Beating us at our own Games
- Beating us at our own Games Melvin Zhang melvin@melvinzhang.net @melvinzhangzy
- CTO @ Cosmiqo
- Maintainer @ MagArena, an open source card game
- Part 1: Progress in AI and challenges
- https://www.codeproject.com/Articles/1182210/Artificial-Intelligence
- https://www.venturescanner.com/
- Have you trained an AI?
- Have you trained an AI?
- Have you trained an AI?
- Lip reading with LipNet, Nov 2016 http://www.cs.ox.ac.uk/news/1217-full.html
- Detecting cancer cells in biopsy, Mar 2017 https://research.googleblog.com/2017/03/assisting-pathologists-in-detecting.html
- Detecting cancer cells in biopsy, Mar 2017 https://research.googleblog.com/2017/03/assisting-pathologists-in-detecting.html
- DARPA Robotics Challenge 2015 https://spectrum.ieee.org/automaton/robotics/humanoids/darpa-robotics-challenge
- Part 2: Games as a benchmark for AI
- https://en.wikipedia.org/wiki/File:ST Battle Chess.png
- http://afflictor.com/2012/09/11/chess-programs-regularly-play-at-good-amateur-level/
- https://en.wikipedia.org/wiki/Deep Blue (chess computer) Deep Blue
- https://stockfishchess.org/ Lang:C++ License:GPLv3 Stockfish
- Game tree https://en.wikipedia.org/wiki/Game tree
- Optimal play Terminal min player max player
- Optimal play 1 01 1 1Terminal min player max player
- Optimal play 1 01 1 1 0 Terminal min player max player
- Optimal play 1 01 1 1 0 1 Terminal min player max player
- Optimal play 1 01 1 1 0 1 1 Terminal min player max player
- Chess has about 1046 states!
- Minimax algorithm with heuristic score Cut-off min player max player
- Minimax algorithm with heuristic score .7 .1 .6 .9Cut-off min player max player
- Minimax algorithm with heuristic score .7 .1 .6 .9 .1 Cut-off min player max player
- Minimax algorithm with heuristic score .7 .1 .6 .9 .1 .6 Cut-off min player max player
- Minimax algorithm with heuristic score .7 .1 .6 .9 .1 .6 .6 Cut-off min player max player
- https://tests.stockfishchess.org/ Testing AI changes is crucial
- Scoring is hard!
- http://mathworld.wolfram.com/Go.html
- by Google Deepmind https://deepmind.com/research/alphago/
- https://gogameguru.com/alphago-races-ahead-2-0-lee-sedol/
- http://pachi.or.cz/ Lang:C License:GPLv2 Pachi
- Monte Carlo evaluations Cut-off min player max player
- Monte Carlo evaluations Cut-off min player max player
- Monte Carlo evaluations Cut-off min player max player
- Monte Carlo evaluations Cut-off min player max player
- Monte Carlo evaluations Cut-off min player max player .7
- Monte Carlo Tree Search (MCTS)
- http://www.nature.com/nature/journal/v529/n7587/full/nature16961.html MCTS + Policy and value networks
- Not all information is known...
- http://magic.wizards.com/en/events/coverage/gpsin15/father-son-2015-06-27
- https://magarena.github.io Lang:Java License:GPLv3
- Choose a random instantiation of the hidden information during simulation
- Challenges
- Challenges https://www.linkedin.com/pulse/applying-machine-learning-security-without-phd-ken-westin/
- Q&A Melvin Zhang melvin@melvinzhang.net @melvinzhangzy
Advertisement