public AlgorithmsAssignment() : base(1280, 600, false, true, -1, -1, false)
{
/////////////////////////////////////////////////////////////////////////////////////////
/// BASE SETUP - FEEL FREE TO SKIP
//set our default background color and title
GL.ClearColor(1, 1, 1, 1);
GL.glfwSetWindowTitle("Algorithms Game");
//The simplest approach to visualize a dungeon, is using black and white squares
//to show where the walls (black) and walkable areas/doors (white) are.
//A quick and easy way to implement that is by creating a small canvas,
//draw black and white pixels on it and scale it up by an insane amount (e.g. 40).
//
//To visualize where these scaled pixels are we also add a grid, where we use
//this same SCALE value as a grid size setting. Comment out the next line to hide it.
Grid grid = new Grid(GRID_WIDTH, GRID_HEIGHT, SCALE);
/////////////////////////////////////////////////////////////////////////////////////////
/// ASSIGNMENT 1 : DUNGEON - READ CAREFULLY
///
//The Dungeon in this assignment is an object that holds Rooms & Doors instances, and
//extends a canvas that we scale up so that it can visualize these rooms & doors.
//In a 'real' setting you would split this 'model' of the dungeon from the visualization,
//but we chose to not make it more complicated than necessary.
//To calculate the size of the dungeon we can create, we take our screen size and
//divide it by how much we want to scale everything up. For example if our screen size is 800
//and the dungeon scale 40, we would like our dungeon to have a max width of 20 'units'
//so that if we scale it up by 40, its screenwidth is 800 pixels again.
//Basically this means every pixel drawn in the dungeon has the size of the SCALE setting.
//Eg walls are SCALE pixels thick, doors are squares with an area of SCALE * SCALE pixels.
_size = new Size(GRID_WIDTH / SCALE, GRID_HEIGHT / SCALE);
////////////////////////////////////////
//Assignment 1.1 Sufficient (Mandatory)
//
//TODO: Study assignment 1.1 on blackboard
//TODO: Study the Dungeon, Room and Door classes
//TODO: Study the SampleDungeon class and try it out below
//TODO: Comment out SampleDungeon below, implement a SufficientDungeon class and uncomment it below
//_dungeon = new SampleDungeon(size);
_dungeon = new SufficientDungeon(_size);
/////////////////////////////////
//Assignment 1.2 Good (optional)
//
//TODO: Study assignment 1.2 on blackboard
//TODO: Comment out SufficientDungeon above, implement a GoodDungeon class, and uncomment it below
//_dungeon = new GoodDungeon(size);
//////////////////////////////////////
//Assignment 1.3 Excellent (optional)
//
//TODO: Study assignment 1.3 on blackboard
//TODO: Comment out GoodDungeon above, implement an ExcellentDungeon class, and uncomment it below
//_dungeon = new ExcellentDungeon(size);
if (_dungeon != null)
{
//assign the SCALE we talked about above, so that it no longer looks like a tinietiny stamp:
_dungeon.scale = SCALE;
//Tell the dungeon to generate rooms and doors with the given MIN_ROOM_SIZE
_dungeon.Generate(MIN_ROOM_SIZE);
}
/////////////////////////////////////////////////////////////////////////////////////////
/// ASSIGNMENT 2 : GRAPHS, AGENTS & TILES
///
/// SKIP THIS BLOCK UNTIL YOU'VE FINISHED ASSIGNMENT 1 AND ASKED FOR TEACHER FEEDBACK !
/////////////////////////////////////////////////////////////
//Assignment 2.1 Sufficient (Mandatory) High Level NodeGraph
//
//TODO: Study assignment 2.1 on blackboard
//TODO: Study the NodeGraph and Node classes
//TODO: Study the SampleDungeonNodeGraph class and try it out below
//TODO: Comment out the SampleDungeonNodeGraph again, implement a HighLevelDungeonNodeGraph class and uncomment it below
//_graph = new SampleDungeonNodeGraph(_dungeon);
//_graph = new HighLevelDungeonNodeGraph(_dungeon);
_graph = new LowLevelDungeonNodeGraph(_dungeon);
if (_graph != null)
{
_graph.Generate();
}
/////////////////////////////////////////////////////////////
//Assignment 2.1 Sufficient (Mandatory) OffGraphWayPointAgent
//
//TODO: Study the NodeGraphAgent class
//TODO: Study the SampleNodeGraphAgent class and try it out below
//TODO: Comment out the SampleNodeGraphAgent again, implement an OffGraphWayPointAgent class and uncomment it below
//_agent = new SampleNodeGraphAgent(_graph);
//_agent = new OffGraphWayPointAgent(_graph);
////////////////////////////////////////////////////////////
//Assignment 2.2 Good (Optional) TiledView
//
//TODO: Study assignment 2.2 on blackboard
//TODO: Study the TiledView and TileType classes
//TODO: Study the SampleTileView class and try it out below
//TODO: Comment out the SampleTiledView again, implement the TiledDungeonView and uncomment it below
//_tiledView = new SampleTiledView(_dungeon, TileType.GROUND);
_tiledView = new TiledDungeonView(_dungeon, TileType.GROUND);
if (_tiledView != null)
{
_tiledView.Generate();
}
////////////////////////////////////////////////////////////
//Assignment 2.2 Good (Optional) OnGraphWayPointAgent
//
//TODO: Comment out the OffGraphWayPointAgent above, implement an OnGraphWayPointAgent class and uncomment it below
//_agent = new OnGraphWayPointAgent(_graph);
//////////////////////////////////////////////////////////////
//Assignment 2.3 Excellent (Optional) LowLevelDungeonNodeGraph
//
//TODO: Comment out the HighLevelDungeonNodeGraph above, and implement the LowLevelDungeonNodeGraph
/////////////////////////////////////////////////////////////////////////////////////////
/// ASSIGNMENT 3 : PathFinding and PathFindingAgents
///
/// SKIP THIS BLOCK UNTIL YOU'VE FINISHED ASSIGNMENT 2 AND ASKED FOR TEACHER FEEDBACK !
//////////////////////////////////////////////////////////////////////////
//Assignment 3.1 Sufficient (Mandatory) - Recursive Pathfinding
//
//TODO: Study assignment 3.1 on blackboard
//TODO: Study the PathFinder class
//TODO: Study the SamplePathFinder class and try it out
//TODO: Comment out the SamplePathFinder, implement a RecursivePathFinder and uncomment it below
//_pathFinder = new SamplePathFinder(_graph);
//_pathFinder = new RecursivePathFinder(_graph);
//////////////////////////////////////////////////////////////////////////
//Assignment 3.1 Sufficient (Mandatory) - BreadthFirst Pathfinding
//
//TODO: Comment out the RecursivePathFinder above, implement a BreadthFirstPathFinder and uncomment it below
//_pathFinder = new BreadthFirstPathFinder(_graph);
_pathFinder = new DijkstraBreadthFirstPathFinder(_graph);
//TODO: Implement a PathFindingAgent that uses one of your pathfinder implementations (should work with any pathfinder implementation)
_agent = new PathFindingAgent(_graph, _pathFinder);
/////////////////////////////////////////////////
//Assignment 3.2 Good & 3.3 Excellent (Optional)
//
//There are no more explicit TODO's to guide you through these last two parts.
//You are on your own. Good luck, make the best of it. Make sure your code is testable.
//For example for A*, you must choose a setup in which it is possible to demonstrate your
//algorithm works. Find the best place to add your code, and don't forget to move the
//PathFindingAgent below the creation of your PathFinder!
//------------------------------------------------------------------------------------------
/// REQUIRED BLOCK OF CODE TO ADD ALL OBJECTS YOU CREATED TO THE SCREEN IN THE CORRECT ORDER
/// LOOK BUT DON'T TOUCH :)
if (grid != null)
{
AddChild(grid);
}
if (_dungeon != null)
{
AddChild(_dungeon);
}
if (_tiledView != null)
{
AddChild(_tiledView);
}
if (_pathFinder != null)
{
AddChild(_pathFinder); //pathfinder on top of that
}
if (_graph != null)
{
AddChild(_graph);
}
if (_graph != null)
{
AddChild(_nodeLabelDrawer = new NodeLabelDrawer(_graph)); //node label display on top of that
}
if (_agent != null)
{
AddChild(_agent); //and last but not least the agent itself
}
/////////////////////////////////////////////////
//The end!
////
}
void ResetDungeon()
{
if (_dungeon != null)
{
RemoveChild(_dungeon);
}
if (_tiledView != null)
{
RemoveChild(_tiledView);
}
if (_pathFinder != null)
{
RemoveChild(_pathFinder);
}
if (_graph != null)
{
RemoveChild(_graph);
}
if (_nodeLabelDrawer != null)
{
RemoveChild(_nodeLabelDrawer);
}
if (_agent != null)
{
RemoveChild(_agent);
}
_dungeon = new SufficientDungeon(_size);
_dungeon.scale = SCALE;
_dungeon.Generate(MIN_ROOM_SIZE);
if (_graph is HighLevelDungeonNodeGraph)
{
_graph = new HighLevelDungeonNodeGraph(_dungeon);
}
else
{
_graph = new LowLevelDungeonNodeGraph(_dungeon);
}
_graph.Generate();
if (_pathFinder?.GetType() == typeof(BreadthFirstPathFinder))
{
_pathFinder = new BreadthFirstPathFinder(_graph);
}
else if (_pathFinder?.GetType() == typeof(DijkstraBreadthFirstPathFinder))
{
_pathFinder = new DijkstraBreadthFirstPathFinder(_graph);
}
_tiledView = new TiledDungeonView(_dungeon, TileType.GROUND);
_tiledView.Generate();
if (_agent?.GetType() == typeof(OnGraphWayPointAgent))
{
_agent = new OnGraphWayPointAgent(_graph);
}
else if (_agent?.GetType() == typeof(PathFindingAgent))
{
_agent = new PathFindingAgent(_graph, _pathFinder);
}
if (_tiledView != null)
{
AddChild(_tiledView);
}
if (_pathFinder != null)
{
AddChild(_pathFinder); //pathfinder on top of that
}
if (_graph != null)
{
AddChild(_graph);
}
if (_graph != null)
{
AddChild(_nodeLabelDrawer = new NodeLabelDrawer(_graph)); //node label display on top of that
}
if (_agent != null)
{
AddChild(_agent);
}
}