-------------------------------------------------------------------------------
-- LevelGen script creates a random maze
-- Args: gridXSize, gridYSize, ulCornerX, ulCornerY, cellsize
--
--    gridXSize, gridYSize --> Number of cells in the maze (defaults to 10, 10)
--    ulCornerX, ulCornerY --> Coordinates of upper left corner of maze
--                        (defaults to 0, 0)
--      cellsize --> Size of each maze cell (defaults to 255)
--
-------------------------------------------------------------------------------



function isUnvisited(cell)
  return cell["N Wall"] and cell["S Wall"] and cell["E Wall"] and cell["W Wall"]
end


function getAdjacentUnvisitedCells(cell)

  local x = cell["x"]
  local y = cell["y"]

  adjCells = {}
  adjDirs = {}

  if(not cells[x][y]["N Edge"] and isUnvisited(cells[x][y - 1])) then
     table.insert(adjCells, cells[x][y - 1])
     table.insert(adjDirs, "N")
  end

  if(not cells[x][y]["S Edge"] and isUnvisited(cells[x][y + 1])) then
     table.insert(adjCells, cells[x][y + 1])
     table.insert(adjDirs, "S")
  end

  if(not cells[x][y]["E Edge"] and isUnvisited(cells[x + 1][y])) then
     table.insert(adjCells, cells[x + 1][y])
     table.insert(adjDirs, "E")
  end

  if(not cells[x][y]["W Edge"] and isUnvisited(cells[x - 1][y])) then
     table.insert(adjCells, cells[x - 1][y])
     table.insert(adjDirs, "W")
  end
end


-- Knock down wall to neighbor cell, and neighbor's wall to current cell
function knockDownWallToCell(cell, dir, adjacentCell)
  cell[dir .. " Wall"] = false
  adjacentCell[oppDir(dir) .. " Wall"] = false
end


function oppDir(dir)
  if(dir == "N") then return "S" end
  if(dir == "S") then return "N" end
  if(dir == "E") then return "W" end
  if(dir == "W") then return "E" end
end


function initGridCells(xsize, ysize)
  for x = 0, xsize + 1 do    -- Add extra cell to avoid bounds checking later
     cells[x] = {}
     for y = 0, ysize + 1 do
        cells[x][y] = {}

        cells[x][y]["N Wall"] = true
        cells[x][y]["S Wall"] = true
        cells[x][y]["E Wall"] = true
        cells[x][y]["W Wall"] = true

        cells[x][y]["x"] = x
        cells[x][y]["y"] = y

        cells[x][y]["N Edge"] = (y == 1)
        cells[x][y]["S Edge"] = (y == gridYSize)
        cells[x][y]["E Edge"] = (x == gridXSize)
        cells[x][y]["W Edge"] = (x == 1)
     end
  end
end


function outputMaze()

   -- We'll output our maze as a series of tiles, each being 2 x cellsize square
   -- Divide each tile into quadrants, as follows:
   --           X----+----+
   --           | UL | UR |    * denotes point (cenx, ceny)
   --           |    |    |    size of each cell is (gridXSize, gridXSize)
   --           +----*----+    coords of point X on upper left cell are
   --           | LL | LR |       (ulCornerX, ulCornerY)
   --           |    |    |    UL is always filled in, LR is always open
   --           +----+----+    LL is filled in when an E wall is present
   --                          UR is filled in when a N wall is present
   --  When a series of these tiles are tiled together, a maze will be drawn
   --  with an open bottom and open right side, which will be closed at the end.
   --
   --  Wall segments are drawn as 2-pt horizontal or vertical lines with the
   --  appropriate thickness to make them square.  Adjacent wall segments are
   --  partially merged into longer lines to reduce vertices and therefore
   --  level transfer size.  .


   -- Add 1 to get a tiny bit of
   -- overlap to make walls merge
   local wallsize = cellsize + 1
   local points
   local vwallstart = { }
   local vwallend = { }

   for y = 1, gridYSize do

      local xstart = nil
      local ceny = ulCornerY + (2 * y - 1) * cellsize

      for x = 1, gridXSize do
         local cenx = ulCornerX + (2 * x - 1) * cellsize
         local cell = cells[x][y]


         -- UL quadrant is always drawn
         if(xstart == nil) then        -- No line in progress
            xstart = cenx - cellsize
         end

         -- UR quadrant drawn only when a N wall is present
         local endx

         if(cell["N Wall"]) then
           endx = cenx + cellsize
         else
           endx = cenx
         end


         if(not cell["N Wall"] or cell["E Edge"]) then

            -- Skip a horizontal wall if it's only one cell wide, because
            -- that portion will get covered by a vertical segment later.
            if(endx - xstart > cellsize) then
               local pts = { point.new(xstart, ceny - cellsize * 0.5), point.new(endx, ceny - cellsize * 0.5) }
               addWall(wallsize, pts)
            end

            xstart = nil
         end

         -- LL quadrant drawn only when a W wall is present
         if(cell["W Wall"]) then
            if vwallstart[x] == nil then
               vwallstart[x] = point.new(cenx - cellsize * 0.5, ceny - cellsize )
            end

            vwallend[x] = point.new(cenx - cellsize * 0.5, ceny + cellsize * 2)

         else  -- Finish vertical wall
            if(vwallstart[x]) then
               local pts = { vwallstart[x], vwallend[x] }

               addWall(wallsize, pts)
               vwallstart[x] = nil
            end
         end

         -- LR quadrant is always open, so do nothing
      end

   end

   -- Make one final sweep across the bottom to ensure that all vertical walls are finished
   local ceny = ulCornerY + (2 * gridYSize - 1) * cellsize

   for x = 1, gridXSize do
      local cenx = ulCornerX + (2 * x - 1) * cellsize
      if(vwallstart[x]) then
         local pts = { vwallstart[x], point.new(cenx - cellsize * 0.5, ceny + cellsize * 2) }

         addWall(wallsize, pts)
         vwallstart[x] = nil
      end
   end

   -- Now add walls along entire bottom and right sides of the maze
   local pts = { point.new(ulCornerX,
                       ulCornerY + 2 * gridYSize * cellsize + cellsize * 0.5),
                 point.new(ulCornerX + 2 * gridXSize * cellsize + cellsize * 0.5,
                       ulCornerY + 2 * gridYSize * cellsize + cellsize * 0.5),
                 point.new(ulCornerX + 2 * gridXSize * cellsize + cellsize * 0.5,
                       ulCornerY) }
   addWall(wallsize, pts)
end


function addWall(size, pts)
  local wall = WallItem.new()
  wall:setWidth(size)
  wall:setGeom(pts)

  bf:addItem(wall)
end


-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
-----------------------------------------------------------
function main()

mazeItems()
-- Global variables

-- Remember, in Bitfighter, all global variables must be
-- defined in the main block!

gridXSize = tonumber(arg[1]) or 10
gridYSize = tonumber(arg[2]) or 10
ulCornerX = tonumber(arg[3]) or 0
ulCornerY = tonumber(arg[4]) or 0
cellsize = tonumber(arg[5]) or 255


cellStack = {}

cells = {}
adjCells = {}
adjDirs = {}

-- Initialize cells
initGridCells(gridXSize, gridYSize)



-- Get starting cell
local x = math.random(gridXSize)
local y = math.random(gridYSize)

local currCell = cells[x][y]
local totalCells = gridXSize * gridYSize

local visitedCells = 1

while visitedCells < totalCells do

  -- Find all adjacent cells with all walls intact (sets adjCells and adjDirs)
  getAdjacentUnvisitedCells(currCell)
  if(#adjCells > 0) then                   -- More than one?
     local adj = math.random(#adjCells)    -- Pick one at random
          knockDownWallToCell(currCell, adjDirs[adj], adjCells[adj])

          -- Push current cell location on the cellStack; we'll revisit it later
          table.insert(cellStack, currCell)

          -- Make the randomly selected adjacent cell the new current cell
          currCell = adjCells[adj]

     visitedCells = visitedCells + 1
  else
     -- This cell has no neighbors, so let's grab one from the stack
     local last = #cellStack
     currCell = cellStack[last]
     table.remove(cellStack, last)
  end
end

-- Output the results
outputMaze()

end

function mazeItems()
    for i = 1, 5 do --Resource Items
        local res = ResourceItem.new()
        local pos = pickFromPickerList()
        res:setPos(pos)
        bf:addItem(res)
        logprint("added res at " .. tostring(pos))
    end

    for i = 1, 5 do --Repair Items
        local repair = RepairItem.new()
        repair:setRegenTime(20) 
        local pos = pickFromPickerList()
        repair:setPos(pos)
        bf:addItem(repair)
        logprint("added repair at " .. tostring(pos))
    end

    for i = 1, 5 do --Energy items
        local energy = EnergyItem.new()
        energy:setRegenTime(20)
        local pos = pickFromPickerList()
        energy:setPos(pos)
        bf:addItem(energy)
        logprint("added energy at " .. tostring(pos))
    end
    
    for i = 1, 5 do -- Test items
        local bouncy = TestItem.new()
        local pos = pickFromPickerList()
        bouncy:setPos(pos)
        bf:addItem(bouncy)
        logprint("added test at " .. tostring(pos))
    end
end
pickerList = {
point.new(3442.5, 1912.5),
point.new(2932.5, 2422.5),
point.new(2422.5, 2932.5),
point.new(2422.5, 2422.5),
point.new(3442.5, 2422.5),
point.new(3442.5, 2932.5),
point.new(1912.5, 1912.5),
point.new(2422.5, 1912.5),
point.new(2932.5, 1912.5),
point.new(3952.5, 1912.5),
point.new(3952.5, 2422.5),
point.new(2932.5, 2932.5),
point.new(1912.5, 2932.5),
point.new(1912.5, 2422.5),
point.new(1912.5, 3952.5),
point.new(2422.5, 3952.5),
point.new(2932.5, 3952.5),
point.new(3952.5, 2932.5),
point.new(2932.5, 1402.5),
point.new(2422.5, 1402.5),
point.new(1912.5, 892.5),
point.new(2422.5, 892.5),
point.new(2932.5, 892.5),
point.new(1912.5, 1402.5),
point.new(1402.5, 2422.5),
point.new(892.5, 2422.5),
point.new(892.5, 1912.5),
point.new(1402.5, 1912.5),
point.new(892.5, 2932.5),
point.new(1402.5, 2932.5),
point.new(1912.5, 382.5),
point.new(2422.5, 382.5),
point.new(2932.5, 382.5),
point.new(1912.5, 4462.5),
point.new(2422.5, 4462.5),
point.new(2932.5, 4462.5),
point.new(1912.5, 4972.5),
point.new(2422.5, 4972.5),
point.new(2932.5, 4972.5),
point.new(382.5, 2422.5),
point.new(382.5, 1912.5),
point.new(382.5, 2932.5),
point.new(4462.5, 2422.5),
point.new(4462.5, 1912.5),
point.new(4462.5, 2932.5),
point.new(4972.5, 2422.5),
point.new(4972.5, 1912.5),
point.new(4972.5, 2932.5),
point.new(1912.5, 3442.5),
point.new(2422.5, 3442.5),
point.new(2932.5, 3442.5)
}
-- five each: resource items, repair items, energy items, test items
-- their position in the maze should be randomized from coords
function pickFromPickerList() 
    local roll = math.random(#pickerList) --# takes the size of an array
    local pointToReturn = pickerList[roll] --This is for protection after the next line.
    table.remove(pickerList, roll) --I assume here there shouldn't be overlap between any objects.
    return pointToReturn
end