Esempio n. 1
0
 private int QueryMove()
 {
     // Loop until valid input received
     while (true)
     {
         Console.Write("Where to? ");
         string line = Console.ReadLine();
         int    room;
         if (Int32.TryParse(line, out room))
         {
             var adjRooms = Map.getAdjacentRooms(Position);
             if (adjRooms.Contains(room))
             {
                 return(room);
             }
             else // Cannot move to that room
             {
                 Console.WriteLine("Not Possible");
             }
         }
         else
         {
             Console.WriteLine("That's not a valid number. Try again.");
         }
     }
 }
Esempio n. 2
0
        public bool isAdjacentToPlayer()
        {
            var adjRooms = Map.getAdjacentRooms(Map.Player.Position);

            if (adjRooms.Contains(Position))
            {
                return(true);
            }
            return(false);
        }
Esempio n. 3
0
        public override void Update()
        {
            // Move to random adj room if not sleeping
            if (!Sleeping)
            {
                if (Map.random.Next(4) != 0) // 75% chance to move
                {
                    var adjRooms = Map.getAdjacentRooms(Position);
                    Move(adjRooms[Map.random.Next(3)]);
                }
            }

            // Smell a wumpus if next to player
            if (isAdjacentToPlayer())
            {
                Console.WriteLine("I smell a Wumpus!");
            }
        }
Esempio n. 4
0
        private int[] QueryShoot()
        {
            // Query number of rooms
            int num;

            while (true)
            {
                Console.Write("No. of rooms (0-5)? ");
                string line = Console.ReadLine();
                if (Int32.TryParse(line, out num))
                {
                    if (0 <= num && num <= 5)
                    {
                        break;
                    }
                    Console.WriteLine("Number of rooms must be between 0 and 5.");
                }
                else
                {
                    Console.WriteLine("That's not a valid number.");
                }
            }

            int[] result = new int[num];
            int[] input  = new int[num];

            if (num == 0)
            {
                Console.WriteLine("Okay, suit yourself...");
                return(result);
            }

            // keeps track of if player gave a valid path so far or not
            bool valid       = true;
            int  currentRoom = Position;

            // Query a room for the number of rooms specified
            for (int k = 0; k < num; k++)
            {
                int room;
                while (true)
                {
                    Console.Write("Room #? ");
                    string line = Console.ReadLine();
                    if (Int32.TryParse(line, out room))
                    {
                        if (1 <= room && room <= Map.NumRooms)
                        {
                            input[k] = room;
                            // Arrow takes A-B-A path
                            // use input instead of result to evaluate only player input
                            if (k > 1 && input[k - 2] == room || k == 1 && room == Position)
                            {
                                Console.WriteLine("Arrows aren't that crooked - try another room");
                            }
                            // The player's path is correct so far, shoot where he said
                            else if (valid && Map.isAdjacent(currentRoom, room))
                            {
                                result[k]   = room;
                                currentRoom = result[k];
                                break;
                            }
                            // The player messed up the path, so shoot somewhere random
                            else
                            {
                                valid = false;
                                var adjRooms = Map.getAdjacentRooms(currentRoom);
                                // Remove possibility for A-B-A path
                                if (k > 0)
                                {
                                    var forbiddenRoom = (k == 1) ? Position : result[k - 2];
                                    // If there is a room that creates a A-B-A path, remove it
                                    if (adjRooms.Contains(forbiddenRoom))
                                    {
                                        var tempRooms = new int[adjRooms.Length - 1];
                                        int j         = 0;
                                        foreach (var adjRoom in adjRooms)
                                        {
                                            if (adjRoom != forbiddenRoom)
                                            {
                                                tempRooms[j++] = adjRoom;
                                            }
                                        }
                                        adjRooms = tempRooms;
                                    }
                                }
                                result[k]   = adjRooms[Map.random.Next(adjRooms.Length)];
                                currentRoom = result[k];
                                break;
                            }
                        }
                        else // Input isn't a real room on the map
                        {
                            Console.WriteLine("That room doesn't exist.");
                        }
                    }
                    else // Input is an invalid number
                    {
                        Console.WriteLine("That's not a valid number.");
                    }
                }
            }

            return(result);
        }