----------------------------------------------------------
%% %% CSE 3402 Assignment 1
%% Family name:
%% Given name:
%% Student number:
%% Answers to Questions 6-10
%% Instructions:
%% Please edit this file in the following way to answer the text
%% questions of Assignment 1.
%% - Please replace any occurence of '[yes/no]' with either 'yes' or
%% 'no' to answer the respective question.
%% - Replace any occurence of '[explain N words]' or '[if yes (resp.
%% no), explain N words]' with an explanation containing no more
%% than N words if the condition (yes/no) applies to your previous
%% answer.
%% - Do not remove any other lines, in particular do not remove the
%% task-tags (<tasknumber>)
%% - Any line starting with a '%' will be ignored.
%% - Submit this file electronically.
%% ----------------------------------------------------------
%% 6. Which of the four heuristics are admissible?
%% - hfn_null
<6.1>
[yes/no]
%% - hfn_misplaced
<6.2>
[yes/no]
%% - hfn_manhattan
<6.3>
[yes/no]
%% - hfn_inversions
<6.4>
[yes/no]
%% /* ------------------------------------------------------ */
% 7. Suppose for sliding a tile to the left we would change the
% cost from 1 to 0.5 and leave all the other moves the same cost.
% Does this affect the admissibility of the heuristics? Which of
% them are admissible now?
%% - hfn_null
<7.1.1>
[yes/no]
<7.1.2>
[if no explain in 100 words or less]
%% - hfn_misplaced
<7.2.1>
[yes/no]
<7.2.2>
[if no explain in 100 words or less]
%% - hfn_manhattan
<7.3.1>
[yes/no]
<7.3.2>
[if no explain in 100 words or less]
%% - hfn_inversions
<7.4.1>
[yes/no]
<7.4.2>
[if no explain in words 100 or less]
%% /* ------------------------------------------------------ */
% 8. Now suppose we would change the cost for sliding a tile to the
% left to 2 and leave all the other moves the same cost. Does this
% now affect the admissibility of the four heuristics? Again, which
% of them are admissible?
%% - hfn_null
<8.1.1>
[yes/no]
<8.1.2>
[if no explain in 100 words or less]
%% - hfn_misplaced
<8.2.1>
[yes/no]
<8.2.2>
[if no explain in 100 words or less]
%% - hfn_manhattan
<8.3.1>
[yes/no]
<8.3.2>
[if no explain in 100 words or less]
%% - hfn_inversions
<8.4.1>
[yes/no]
<8.4.2>
[if no explain in 100 words or less]
%% /* ------------------------------------------------------ */
% 9. In the former modification (sliding to the LEFT costs 0.5), can
% you say for sure which heuristic will be the fastest (expand the
% least number of states) in finding a (not necessary optimal)
% solution? Explain.
<9.1>
[yes/no]
<9.2>
[explain in 100 words or less]...