C# Logical Puzzles Games Algorithm Projects (step by step)

This course is all about practice. Therefore, to benefit from this course, you need to be an active student. It doesn’t matter if you are self-taught or attend a programming course. What matters is the time and effort you are willing to put into learning and practicing your skills.锟?/p>

There are no lectures in this course. However,聽I do my best to explain what I am trying to accomplish with each line of code, and touch on common pitfalls, too.锟?/p>

This is a course for beginner to intermediate C#聽programmers who need to put the concepts and theory they learned into practice and for people who prefer to learn by doing. This is NOT聽a course for absolute beginner!

If that’s you, then let’s start coding!

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Chapter 2: Calculating factorials using loops and recursion

Lecture 1: Factorial – Loop solution

Lecture 2: Factorial – Recursive solution

Chapter 3: FizzBuzz problem using loops and recursion

Lecture 1: FizzBuzz – Loop solution

Lecture 2: FizzBuzz – Recursive solution

Chapter 4: Fibonacci numbers using loops and recursion

Lecture 1: Fibonacci Numbers – Loop solution

Lecture 2: Fibonacci Numbers – Recursive solution

Chapter 5: Tower of Hanoi puzzle – recursive solution

Lecture 1: Tower of Hanoi

Chapter 6: Sieve Eratosthenes algorithm for finding Prime numbers

Lecture 1: Sieve of Eratosthenes Part 1

Lecture 2: Sieve of Eratosthenes Part 2

Chapter 7: Lo Shu Magic Square puzzle

Lecture 1: Lo Shu Magic Square Part 1

Lecture 2: Lo Shu Magic Square Part 2

Chapter 8: Roll of Dice simulation

Lecture 1: Roll of Dice Part 1

Lecture 2: Roll of Dice Part 2

Chapter 9: Game of Craps simulation

Lecture 1: Game of Craps Part 1

Lecture 2: Game of Craps Part 2

Lecture 3: Game of Craps Part 3

Lecture 4: Game of Craps Part 4

Lecture 5: Game of Craps Part 5

Chapter 10: Turtle Graphics – path simulation

Lecture 1: Turtle Graphics 1

Lecture 2: Turtle Graphics 2

Lecture 3: Turtle Graphics 3

Lecture 4: Turtle Graphics 4

Lecture 5: Turtle Graphics 5

Lecture 6: Turtle Graphics 6

Chapter 11: Tortoise vs Hare race simulation

Lecture 1: Tortoise vs Hare Part 1

Lecture 2: Tortoise vs Hare Part 2

Lecture 3: Tortoise vs Hare Part 3

Lecture 4: Tortoise vs Hare Part 4

Lecture 5: Tortoise vs Hare Part 5

Lecture 6: Tortoise vs Hare Part 6

Chapter 12: Knight Tour chess algorithm

Lecture 1: Knight Tour Part 1

Lecture 2: Knight Tour Part 2

Lecture 3: Knight Tour Part 3

Lecture 4: Knight Tour Part 4

Chapter 13: Eight Queens chess algorithm

Lecture 1: Eight Queens Part 1

Lecture 2: Eight Queens Part 2

Lecture 3: Eight Queens Part 3

Lecture 4: Eight Queens Part 4

Lecture 5: Eight Queens Part 5

Lecture 6: Eight Queens Part 6

Lecture 7: Eight Queens Part 7

Chapter 14: Conclusion

Lecture 1: Where to go from here

Lecture 2: Bonus Lecture

Instructors

Pavol Almasi
Computer Programmer at Berkshire Hathaway Company

Rating Distribution

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!