| | |
Maze solving
![]() |
•
•
Join Date: Dec 2006
Posts: 1,000
Reputation:
Solved Threads: 283
0
#2 17 Days Ago
You would probably have to use a large grid with squares, like a large tic-tac-toe board, with a unique number for each square . Also, if you store what the square is, a wall or open space, then you should be able to come up with a formula/decision table to calculate the squares surrounding any given square and so can tell which way the player can and can not move.
Linux counter #99383
![]() |
Similar Threads
- Implementing stack in maze (C++)
- maze solving and bicycle speed (Assembly)
- Help in C program (Image reading) (C)
- Stacks, Queues, and a Maze?? (C++)
Other Threads in the Python Forum
- Previous Thread: Alarm Question
- Next Thread: Pythagoras?
| Thread Tools | Search this Thread |
abrupt address advanced advice aliased apax array avogadro backend beginner bluetooth c++ calculator code console coordinates corners csv cturtle curves data def development embed enter event examples excel file function generator gui hints http ideas images input itunes jaunty java launcher linux list lists loan loop maze microsoft module mouse movingimageswithpygame newb obexftp opensource output parameters path prime programming projects push py2exe pygame pyglet pyqt python random raw_input read recursive remote return reverse rubyconf silverlight simple source ssh string sum syntax table terminal text time tlapse tricks tutorial ubuntu url urllib urllib2 variable ventrilo web-scrape wikipedia wordgame write wxpython xlwt







