+ MoveStack mlist[MAX_MOVES];
+ MoveStack* last = generate<MV_LEGAL>(pos, mlist);
+
+ for (MoveStack* cur = mlist; cur != last; cur++)
+ if (str == move_to_uci(cur->move, pos.is_chess960()))
+ return cur->move;
+
+ return MOVE_NONE;
+}
+
+
+/// move_to_san() takes a position and a move as input, where it is assumed
+/// that the move is a legal move from the position. The return value is
+/// a string containing the move in short algebraic notation.
+
+const string move_to_san(Position& pos, Move m) {
+
+ assert(pos.is_ok());
+ assert(move_is_ok(m));
+
+ Bitboard attackers;
+ bool ambiguousMove, ambiguousFile, ambiguousRank;
+ Square sq, from = move_from(m);
+ Square to = move_to(m);
+ PieceType pt = piece_type(pos.piece_on(from));
+ string san;
+
+ if (m == MOVE_NONE)
+ return "(none)";
+
+ if (m == MOVE_NULL)
+ return "(null)";
+
+ if (move_is_long_castle(m))
+ san = "O-O-O";
+ else if (move_is_short_castle(m))
+ san = "O-O";
+ else