Problem-Solving with Recursion

pro 24ドル.99 per month

• access to all Manning books, MEAPs, liveVideos, liveProjects, and audiobooks!
• choose one free eBook per month to keep
• exclusive 50% discount on all purchases
• renews monthly, pause or cancel renewal anytime

lite 19ドル.99 per month

• access to all Manning books, including MEAPs!

team

5, 10 or 20 seats+ for your team - learn more

You’re an avid chess player who’s asked by Alexis, a fellow chess club member, "How many queens can you place on a chessboard without any of them being able to attack any of the others?" To discover the answer, you’ll write a recursive program that will enable you to examine all of the possible queen arrangements. You’ll start with simpler functions, including calculating factorials and Fibonacci numbers, to warm up your recursive brain muscles. Then, you’ll advance to solving the knight’s tour problem, the Tower of Hanoi puzzle, and finally, the N-queens problem—the one that will satisfy Alexis’s curiosity. When you’re finished, you’ll have elevated your recursive function game by solving well-known problems and learning important techniques along the way.

Rod Stephens started out as a mathematician but discovered the fun of algorithms and has been programming ever since. Rod was a Microsoft Visual Basic Most Valuable Professional (MVP) for 15 years, has spoken to user groups and conferences, and has taught introductory programming courses. He has written more than 35 books including Essential Algorithms: A Practical Approach to Computer Algorithms Using Python and C# and Beginning Software Engineering, both of which include material related to this series of liveProjects.