Search-Algorithms/Problem.java at master · nazanin97/Search-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
package com.company;

import java.util.ArrayList;

public class Problem {

    private City initialState;
    private City goalState;

    public Problem(){

        setInitialState();
        setGoalState();
    }

    public void setInitialState(){
        City.getCity(2).father = null;
        initialState = City.getCity(2);
    }
    public void setGoalState(){
        goalState = City.getCity(12);
    }
    public City getInitialState(){
        return initialState;
    }

    /* action in each state
        city number is in range 0-19 */
    public ArrayList<Integer> action۳۳(City city){
        ArrayList<Integer> linkStates = new ArrayList<>();

        for (int i = 0; i < 20; i++) {
            if (City.getNeighbors(city.number)[i] != 0)
                linkStates.add(i);
        }
        return linkStates;
    }

    public boolean goalTest(City city){
        if (city.number == 12)
            return true;
        else
            return false;
    }
    public int stepCost(int node1, int node2){
        return City.getNeighbors(node1)[node2];
    }
    public int heuristic(int cityNum){
        int result = 0;
        switch (cityNum){
            case 0:
                result = 380;
                break;
            case 1:
                result = 374;
                break;
            case 2:
                result = 366;
                break;
            case 3:
                result = 329;
                break;
            case 4:
                result = 244;
                break;
            case 5:
                result = 241;
                break;
            case 6:
                result = 242;
                break;
            case 7:
                result = 253;
                break;
            case 8:
                result = 193;
                break;
            case 9:
                result = 160;
                break;
            case 10:
                result = 178;
                break;
            case 11:
                result = 98;
                break;
            case 12:
                result = 0;
                break;
            case 13:
                result = 77;
                break;
            case 14:
                result = 234;
                break;
            case 15:
                result = 226;
                break;
            case 16:
                result = 199;
                break;
            case 17:
                result = 80;
                break;
            case 18:
                result = 151;
                break;
            case 19:
                result = 161;
                break;
        }
        return result;
    }
}