Algorithm Projects with Rust

Problem-Solving with Recursion you own this product

This project is part of the liveProject series Four Small Algorithm Projects with Rust
prerequisites
arrays and slices, basic chess movement rules
skills learned
recursion • simple dynamic programming • memoization • backtracking • restructuring problems • calculating factorials and Fibonacci numbers • finding knight's tours • solving the n-queens problem • solving the Tower of Hanoi puzzle
Rod Stephens
1 week · 4-6 hours per week · INTERMEDIATE

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

lite $19.99 per month

  • access to all Manning books, including MEAPs!

team

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


Look inside

The Tower of Hanoi is one of the most famous (and fun!) mathematical puzzles you can tackle. In this liveProject, you’ll set out to solve this tricky challenge using recursive functions in the Rust programming language. Kickstart your journey with factorials, then calculate Fibonacci numbers and solve the Knight’s Tour and N-Queens problems. Then, you’ll be ready to take on the Tower of Hanoi—and transfer your new recursion skills to multiple other problems.

This project is designed for learning purposes and is not a complete, production-ready application or solution.

book resources

When you start your liveProject, you get full access to the following books for 90 days.

project author

Rod Stephens

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.

prerequisites

This liveProject is for Rust programmers who want to flex their skills. You should know the basics of Rust, but you don’t need any advanced knowledge or capabilities.

TOOLS
  • Intemediate Rust
TECHNIQUES
  • Rust arrays and slices
  • Rust structs and vectors
  • Basics of chess rules
  • Basics of math

you will learn

In this liveProject, you’ll learn effective recursion algorithms for solving tricky problems.

  • Recursion
  • Simple dynamic programming
  • Memoization
  • Backtracking
  • Restructuring problems
  • Calculating factorials and Fibonacci numbers
  • Finding Knight's tours
  • Solving the N-queens problem
  • Solving the Tower of Hanoi puzzle

features

Self-paced
You choose the schedule and decide how much time to invest as you build your project.
Project roadmap
Each project is divided into several achievable steps.
Get Help
While within the liveProject platform, get help from other participants and our expert mentors.
Compare with others
For each step, compare your deliverable to the solutions by the author and other participants.
book resources
Get full access to select books for 90 days. Permanent access to excerpts from Manning products are also included, as well as references to other resources.

choose your plan

team

monthly
annual
$49.99
$499.99
only $41.67 per month
  • five seats for your team
  • access to all Manning books, MEAPs, liveVideos, liveProjects, and audiobooks!
  • choose another free product every time you renew
  • choose twelve free products per year
  • exclusive 50% discount on all purchases
  • Problem-Solving with Recursion project for free