Problem 315. Valid Chess Moves

Created by Alan Chalker

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Using</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Algebraic_chess_notation\"><w:r><w:t>standard Algebraic notation</w:t></w:r></w:hyperlink><w:r><w:t> ('' for a pawn), given previous move and a next move, output true if it is a valid move or false otherwise. Assume there are no other pieces on the chess board, that the piece can be either black or white (whichever generates a valid result) and the previous move was valid. Examples:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[Moving a pawn one space:\n('c5','c6') -> true \n\nMoving a bishop non-diagonally:\n('Bb7','Bd7') -> false]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

223 Solutions
55 Solvers

Last Solution submitted on Aug 30, 2021

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Jean-Marie Sainthillier on 20 Jul 2012

Hard !

Rafael S.T. Vieira on 11 Aug 2020

This is a good problem, but it needs more test cases. There is no test with the King for instance, and there should be a true and false state test for every piece.

Solution Comments

Solution 6447974

1 Comment

1 Comment

Alex Drikitis on 30 Aug 2021

by for not enough test cases:
z = ismember(x(1),'cNR');
fullfills all test cases, but doesn't verify any chess move.

Solution 138606

1 Comment

1 Comment

Michael on 19 Apr 2020

Brilliant!

Solution 39064

3 Comments

3 Comments

@bmtran (Bryant Tran) on 13 Feb 2012

this doesn't take into account captures or moving a pawn 2 moves from its starting position. should it?

@bmtran (Bryant Tran) on 13 Feb 2012

and the occasional other weird rules...

Alan Chalker on 16 Feb 2012

Captures and pawn 2 moves and castling and such aren't possible based upon the assumptions I stated (i.e. no other pieces on the board, the previous move was valid, etc)

Problem Recent Solvers55

Problem Tags

chess

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 315. Valid Chess Moves

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers55

Suggested Problems

More from this Author39

Problem Tags

Community Treasure Hunt

Problem 315. Valid Chess Moves

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers55

Suggested Problems

More from this Author39

Problem Tags

Community Treasure Hunt

Players