| | |
Maze solving
![]() |
•
•
Join Date: Dec 2006
Posts: 1,000
Reputation:
Solved Threads: 283
0
#2 16 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 accessdenied address advanced advice aliased apax array avogadro beginner book c++ calculator convert corners csv cturtle curves cx-freeze data def development digital dynamic edit embed enter event excel file function generator halp http ideas iframe input ip itunes jaunty java leftmouse line linux list lists loan loop maze microphone microsoft module mouse movingimageswithpygame newb obexftp opensource output parameters path prime programming projects py2exe pygame pyopengl python random raw_input recursive redirect return reverse rubyconf silverlight sprite sqlite ssh string sudokusolver sum syntax table text threading time traverse ubuntu urllib urllib2 variable ventrilo voip web-scrape whileloop wikipedia wordgame write wxpython xlwt







