--
-- Copyright (C) 2022  <fastrgv@gmail.com>
--
-- This program is free software: you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-- GNU General Public License for more details.
--
-- You may read the full text of the GNU General Public License
-- at <http://www.gnu.org/licenses/>.
--


-- This solver is embedded into the cann.adb application,
-- which presents any of the "Annoying-Sliders" puzzle group.
-- Thus, its input is the current state of the puzzle,
-- not necessarily the original state...where one must 
-- specify number & position of blanks, the number & positions 
-- of all locations omitted from a rectangular playing field,
-- as well as number & positions of the moveable pieces.


with Ada.Strings.Unbounded;

package fbfsa is -- client: cann
-- potential clients: cdd, crush, cslid

use Ada.Strings.Unbounded;

procedure bfsa (
	infilname: unbounded_string;
	solutionPath : out unbounded_string
);

end fbfsa;

