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.
This liveProject is for Go programmers, from beginning level to advanced, who want to learn how to solve problems using recursive techniques in Go. To begin these liveProjects you’ll need to be familiar with the following:
In this liveProject, you’ll learn how to solve problems using recursive techniques in Go:
geekle is based on a wordle clone.