Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
Google Applied CS - Day 4
Search
Harsh Vakharia
March 31, 2016
Education
0
42
Google Applied CS - Day 4
Day 4:
A* search (Heap & Priority queue)
Harsh Vakharia
March 31, 2016
Tweet
Share
More Decks by Harsh Vakharia
See All by Harsh Vakharia
Google Applied CS - Day 3
harshjv
0
53
Google Applied CS - Introduction
harshjv
0
41
Google Applied CS - Day 1
harshjv
0
130
Other Decks in Education
See All in Education
AWS re_Invent に全力で参加したくて筋トレを頑張っている話
amarelo_n24
2
120
SJRC 2526
cbtlibrary
0
200
Cifrado asimétrico
irocho
0
380
Leveraging LLMs for student feedback in introductory data science courses (Stats Up AI)
minecr
1
170
【旧:ZEPメタバース校舎操作ガイド】
ainischool
0
790
TinyGoをWebブラウザで動かすための方法+アルファ_20260201
masakiokuda
2
210
1111
cbtlibrary
0
270
Web Search and SEO - Lecture 10 - Web Technologies (1019888BNR)
signer
PRO
2
3.1k
20251119 如果是勇者欣美爾的話, 他會怎麼做? 東海資工
pichuang
0
170
国際卓越研究大学計画|Science Tokyo(東京科学大学)
sciencetokyo
PRO
0
47k
あなたの言葉に力を与える、演繹的なアプローチ
logica0419
1
270
コマンドラインを見直そう(1995年からタイムリープ)
sapi_kawahara
0
660
Featured
See All Featured
Building a Scalable Design System with Sketch
lauravandoore
463
34k
GitHub's CSS Performance
jonrohan
1032
470k
Why You Should Never Use an ORM
jnunemaker
PRO
61
9.7k
AI Search: Where Are We & What Can We Do About It?
aleyda
0
6.9k
A designer walks into a library…
pauljervisheath
210
24k
End of SEO as We Know It (SMX Advanced Version)
ipullrank
3
3.9k
<Decoding/> the Language of Devs - We Love SEO 2024
nikkihalliwell
1
130
How Fast Is Fast Enough? [PerfNow 2025]
tammyeverts
3
450
A Soul's Torment
seathinner
5
2.3k
Hiding What from Whom? A Critical Review of the History of Programming languages for Music
tomoyanonymous
2
420
RailsConf & Balkan Ruby 2019: The Past, Present, and Future of Rails at GitHub
eileencodes
141
34k
Easily Structure & Communicate Ideas using Wireframe
afnizarnur
194
17k
Transcript
Day 4
A* search
Admissible “A heuristic function is said to be admissible if
it never overestimates the cost of reaching the goal.” GTU, Department of unnecessary complexity
None
Example
Euclidean distance
None
“Ordinary (i.e. straight-line) distance between two points.” Euclidean him self
“Estimation should not be higher than the actual lowest possible
value.” Sincerely me, Department of necessary simplicity !
None