Node

data class Node(puzzleStatePair: StatePair, parent: Node?, g: Int, h: Int)

Data class corresponding to a node.

Parameters

puzzleStatePair

Current puzzle state (flattened into one dimension, following row-major order) and the position of the blank tile in the puzzle grid (zero-based, following row-major order).

parent

Parent of this node (null if this is the start node).

Cost of the path from the start node to this node (depth of this node).

Heuristic for estimating the cheapest path from this node to the goal (Manhattan distance).

Constructors

Node

fun Node(puzzleStatePair: StatePair, parent: Node?, g: Int, h: Int)

Current puzzle state (flattened into one dimension, following row-major order) and the position of the blank tile in the puzzle grid (zero-based, following row-major order).

Types

Companion

object Companion

Companion object containing the method for hashing the puzzle state of this node.

Properties

var g: Int

Cost of the path from the start node to this node (depth of this node).

private var h: Int

Heuristic for estimating the cheapest path from this node to the goal (Manhattan distance).

parent

val parent: Node?

Parent of this node (null if this is the start node).

puzzleStatePair

val puzzleStatePair: StatePair

Current puzzle state (flattened into one dimension, following row-major order) and the position of the blank tile in the puzzle grid (zero-based, following row-major order).

Functions

equals

open operator override fun equals(other: Any?): Boolean

Indicates whether some other object is "equal to" this one.

getF

fun getF(): Int

Computes the f-value of this node (in relation to the A* algorithm).

hashCode

open override fun hashCode(): Int

Returns a hash code value for the object.