mazegameD2solver01 Class Reference

Solve D2 maze - rough solution. More...

#include <mazegameD2solver01.h>

Collaboration diagram for mazegameD2solver01:

List of all members.

Public Types
typedef set< uint >	uintset
Public Member Functions
	mazegameD2solver01 (mazegameD2state01 &mg_)
	Constructor.
boolc	pathcontains (uintc k) const
	Is the cell already on the path?
void	reset ()
	Set to beginning of game.
boolc	operator! () const
	Invalid if already found solution or no more moves.
void	operator++ ()
	Next step.
Public Attributes
mazegameD2state01 &	mg
	State.
vector< cellD2< uint > > &	vi
uintset	visited
	List of visited cells.

---

Detailed Description

Solve D2 maze - rough solution.

Definition at line 14 of file mazegameD2solver01.h.

---

Member Typedef Documentation

typedef set<uint> mazegameD2solver01::uintset

Definition at line 26 of file mazegameD2solver01.h.

---

Constructor & Destructor Documentation

mazegameD2solver01::mazegameD2solver01

(

mazegameD2state01 &

mg_

)

Constructor.

Definition at line 6 of file mazegameD2solver01.cpp.

  : mg(mg_), vi(mg.mz.vi)
{
}

---

Member Function Documentation

boolc mazegameD2solver01::operator!

(

)

const

Invalid if already found solution or no more moves.

Definition at line 34 of file mazegameD2solver01.cpp.

References mazegameD2state01::gamefinish, mg, and pathcontains().

{
  if (pathcontains(mg.gamefinish))
    return false;

  return true;
}

void mazegameD2solver01::operator++

(

)

Next step.

Definition at line 42 of file mazegameD2solver01.cpp.

References mazegameD2state01::currentpos(), mg, mazegameD2state01::path, vi, and visited.

{
  // Try moving forward.

  uint cpi=mg.currentpos();
  assert(cpi!=0);

  uint k2;
  uint gi[4];
  uint gisize=0;
  for (uint i=0; i<4; ++i)
  {
    k2 = vi[cpi].ni[i];
    if (k2==0)
      continue;

    if (visited.find(k2)!=visited.end())
      continue;

    gi[gisize] = k2;
    ++gisize;
  }

  if (gisize!=0)
  {
    // pick one and move forward
    k2 = gi[ rand() % gisize ];
    mg.path.push_back(k2);
    visited.insert(k2);
    return;
  } 
    
  // Must backtrack.
  assert(mg.path.size()>1);
  mg.path.pop_back();
}

boolc mazegameD2solver01::pathcontains

(

uintc

k

)

const

Is the cell already on the path?

Definition at line 21 of file mazegameD2solver01.cpp.

References assertreturnfalse, mg, and mazegameD2state01::path.

Referenced by operator!().

{
  assertreturnfalse(k!=0);

  for (uint i=0; i<mg.path.size(); ++i)
  {
    if (mg.path[i]==k)
      return true;
  }
 
  return false; 
}

void mazegameD2solver01::reset

(

)

Set to beginning of game.

Definition at line 11 of file mazegameD2solver01.cpp.

References mazegameD2state01::gamestart, mg, mazegameD2state01::path, and visited.

Referenced by maze005::eval().

{
  mg.path.clear();
  mg.path.push_back(mg.gamestart);

  visited.clear();
  visited.insert(0);
  visited.insert(mg.gamestart);
}

---

Member Data Documentation

mazegameD2state01& mazegameD2solver01::mg

State.

Definition at line 18 of file mazegameD2solver01.h.

Referenced by operator!(), operator++(), pathcontains(), and reset().

vector< cellD2<uint> >& mazegameD2solver01::vi

Definition at line 20 of file mazegameD2solver01.h.

Referenced by operator++().

uintset mazegameD2solver01::visited

List of visited cells.

Definition at line 28 of file mazegameD2solver01.h.

Referenced by operator++(), and reset().

---

The documentation for this class was generated from the following files:

• maze/mazegameD2solver01.h
• maze/mazegameD2solver01.cpp