Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
XNA 4 3D Game Development by Example: Beginner's Guide

You're reading from   XNA 4 3D Game Development by Example: Beginner's Guide Create action-packed 3D games with the Microsoft XNA Framework with this book and ebook.

Arrow left icon
Product type Paperback
Published in Sep 2012
Publisher Packt
ISBN-13 9781849687089
Length 322 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Kurt Jaegers Kurt Jaegers
Author Profile Icon Kurt Jaegers
Kurt Jaegers
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

XNA 4 3D Game Development by Example Beginner's Guide
Credits
About the Author
About the Reviewers
www.PacktPub.com
Preface
1. Introduction to XNA FREE CHAPTER 2. Cube Chaser – A Flat 3D World 3. Cube Chaser – It's A-Mazing! 4. Cube Chaser – Finding Your Way 5. Tank Battles – A War-torn Land 6. Tank Battles – The Big Guns 7. Tank Battles – Shooting Things 8. Tank Battles – Ending the War 9. Mars Runner 10. Mars Runner – Reaching the Finish Line

Time for action – defining a MazeCell


  1. 1. Right-click on the Cube Chaser project in Solution Explorer and select Add | Class....

  2. 2. Name the new class MazeCell and click OK.

  3. 3. Add the following declarations to the MazeCell class:

    public bool[] Walls = new bool[4] {true, true, true, true};
    public bool Visited = false;

What just happened?

The definition of each maze cell is very straightforward. We have an array of Boolean values for the walls of the cell. A true value indicates that a wall exists in that position, and a false value indicates that the wall is an opening. In the declaration of the array, we have provided initialization values, specifying that a newly-generated cell will have walls on all four sides. We will arbitrarily decide that the first entry in the array (index 0) is the north wall of the cell. From there, we will proceed clockwise around the cell for the remaining walls (1 is equal to east, 2 is equal to south, and 3 is equal to west) as shown in the following image:

The...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image