Need help with c or c++ thank you so much.

Write a program that solves 15-puzzle problems using heuristic functions and a best-first or A* search. You can also add pruning, backward, bidirectional, or staged search modifications. (But no problem decomposition strategies!) Use whatever language/machine you want.

Input: Initial state only

Goal state is fixed at 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 []

Output:

1. Number of nodes generated (open closed sets)

2. Length of solution path

3. Solution path from IS to GS using Right, Left, Up, and Down operators (= how you move the "blank") with resulting board configurations.