Sunday, November 20, 2011

Project 4 First Lecture

Group for Proj 4
Riddi, Ashish, Andrew
Siyang, Dhaval, Elliot
Nei, Tao, Najaf
Afreen, Sandeep, Nate, Jonathan
Akiva, Erica, Erik
Yufei, Sid, Jonecia, Hans
Kanna, Orestis, Chris


Find the exit first. Look back the track to see whether it is easy to let two out together.
How to use the obstacles to align two players.
Related to regular expression.
How to take advantage of obstacles is dependent on the locations of both of the players
Some maps are impossible to get out together.
Align too early may be weakened by obstacles on the way moving to the exit. It might be more reasonable to find obstacles near the exit and use them to align.

What if we know the whole map.
Moving diagnolly can see more unexplored area.
Search from the exits to see their common "back moves".

When there is enough information, exhaust search is theorecially fine to solve the proble.
When do you know you have enough information to start the very time consuming exhaust search.

How to explore more efficiently, taking consideration of both map.
Diagnoal search could be fast, but could also leave lots of wholes behind.

Think it as one puzzle instead of solving two individual puzzles together.


Deliverable 1:
Two maps, and one initial player

Might be limit on turns related to the size of the map