Backtracking (Think Like a Programmer)
Backtracking is used when you need to find the correct series of choices that will solve a problem. The example I use here is finding one's way through a maze. You can use the basic idea with or without recursion; if you haven't seen my other videos on recursion, start with the first one at https://youtu.be/oKndim5-G94
This topic was a viewer suggestion--your suggestions for future videos are welcome.
If you want to read more about my programming concepts, check out my "Think Like a Programmer" book. If you've found that you are able to read programs and understand programming language syntax but aren't always confident writing programs from scratch, my book can help.
For more information on the book head to one of these:
Amazon page for the book: http://amzn.to/1MZlmlY
My site: http://www.vantonspraul.com/TLAP
My publisher's site: http://nostarch.com/thinklikeaprogrammer
Connect with me:
My site: http://vantonspraul.com
Twitter: https://twitter.com/VAntonSpraul
Facebook: https://www.facebook.com/ThinkLikeAProg
Видео Backtracking (Think Like a Programmer) канала V. Anton Spraul
This topic was a viewer suggestion--your suggestions for future videos are welcome.
If you want to read more about my programming concepts, check out my "Think Like a Programmer" book. If you've found that you are able to read programs and understand programming language syntax but aren't always confident writing programs from scratch, my book can help.
For more information on the book head to one of these:
Amazon page for the book: http://amzn.to/1MZlmlY
My site: http://www.vantonspraul.com/TLAP
My publisher's site: http://nostarch.com/thinklikeaprogrammer
Connect with me:
My site: http://vantonspraul.com
Twitter: https://twitter.com/VAntonSpraul
Facebook: https://www.facebook.com/ThinkLikeAProg
Видео Backtracking (Think Like a Programmer) канала V. Anton Spraul
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![5 Simple Steps for Solving Any Recursive Problem](https://i.ytimg.com/vi/ngCos392W4w/default.jpg)
![6 Introduction to Backtracking - Brute Force Approach](https://i.ytimg.com/vi/DKCbsiDBN6c/default.jpg)
![Python Sudoku Solver Tutorial with Backtracking p.1](https://i.ytimg.com/vi/eqUwSA0xI-s/default.jpg)
![Dynamic Programming (Think Like a Programmer)](https://i.ytimg.com/vi/iv_yHjmkv4I/default.jpg)
![19. Dynamic Programming I: Fibonacci, Shortest Paths](https://i.ytimg.com/vi/OQ5jsbhAv_M/default.jpg)
![](https://i.ytimg.com/vi/8ZpdIgq81IY/default.jpg)
![6.1 N Queens Problem using Backtracking](https://i.ytimg.com/vi/xFv_Hl4B83A/default.jpg)
![The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms](https://i.ytimg.com/vi/Zq4upTEaQyM/default.jpg)
![Backtracking: Permutations - Leetcode 46 - Python](https://i.ytimg.com/vi/s7AvT7cGdSo/default.jpg)
![Recursion (Think Like a Programmer)](https://i.ytimg.com/vi/oKndim5-G94/default.jpg)
![Why Most People FAIL to Learn Programming](https://i.ytimg.com/vi/T7aSI-E1fCE/default.jpg)
![How to THINK like a Programmer](https://i.ytimg.com/vi/NNazO2tMHno/default.jpg)
![Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges](https://i.ytimg.com/vi/oBt53YbR9Kk/default.jpg)
![Generate All Strings With n Matched Parentheses - Backtracking ("Generate Parentheses" on LeetCode)](https://i.ytimg.com/vi/sz1qaKt0KGQ/default.jpg)
![Python Sudoku Solver - Computerphile](https://i.ytimg.com/vi/G_UYXzGuqvM/default.jpg)
![N Queen Problem Using Backtracking Algorithm](https://i.ytimg.com/vi/xouin83ebxE/default.jpg)
![Practical Big-O Notation (Think Like a Programmer)](https://i.ytimg.com/vi/e6UZ2kzmmdA/default.jpg)
![Word Search - Backtracking - Leetcode 79 - Python](https://i.ytimg.com/vi/pfiQ_PS1g8E/default.jpg)
![How to Understand Any Recursive Code](https://i.ytimg.com/vi/B3U6LExgevE/default.jpg)
![Leetcode 46. Permutations : Introduction to backtracking](https://i.ytimg.com/vi/Nabbpl7y4Lo/default.jpg)