{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2025-12-14T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":1467,"title":"Key Generation for Solitaire Cipher","description":"The Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull:  http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher and http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck.\r\n\r\nHowever, these problems do not address the initial configuration of the deck.  One simple approach uses a key phrase, as described here:  http://programmingpraxis.com/2011/01/18/solitaire-cipher/\r\n\r\nYour job is to implement this key generator.  Begin with the cards in numeric order (1:28) and process the deck once.  (To \"process\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.)  Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck.  After each cut, process the deck once again.  Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\r\n\r\nAt the end, you should return the state of the deck.","description_html":"\u003cp\u003eThe Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull:  \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\u003c/a\u003e and \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eHowever, these problems do not address the initial configuration of the deck.  One simple approach uses a key phrase, as described here:  \u003ca href = \"http://programmingpraxis.com/2011/01/18/solitaire-cipher/\"\u003ehttp://programmingpraxis.com/2011/01/18/solitaire-cipher/\u003c/a\u003e\u003c/p\u003e\u003cp\u003eYour job is to implement this key generator.  Begin with the cards in numeric order (1:28) and process the deck once.  (To \"process\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.)  Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck.  After each cut, process the deck once again.  Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\u003c/p\u003e\u003cp\u003eAt the end, you should return the state of the deck.\u003c/p\u003e","function_template":"function deck = solitaireKey(keyphrase)\r\n  deck = 1:28;\r\nend","test_suite":"%%\r\nx = '';\r\ny_correct = [2:28,1];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n\r\n%%\r\nx = 'SECRET KEY';\r\ny_correct = [26 25 7 8 2 13 6 16 27 4 5 19 23 21 14 15 9 3 20 11 12 28 17 18 10 1 24 22];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n\r\n%%\r\nx = 'I don''t know the key to success, but the key to failure is trying to please everybody.';\r\ny_correct = [16 10 28 4 26 25 8 27 19 24 7 1 9 21 22 23 17 11 14 15 12 13 20 5 2 3 18 6];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3117,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":"2013-04-28T15:50:44.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-04-28T15:36:00.000Z","updated_at":"2013-04-28T15:50:44.000Z","published_at":"2013-04-28T15:50:44.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull: \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eHowever, these problems do not address the initial configuration of the deck. One simple approach uses a key phrase, as described here: \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://programmingpraxis.com/2011/01/18/solitaire-cipher/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://programmingpraxis.com/2011/01/18/solitaire-cipher/\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYour job is to implement this key generator. Begin with the cards in numeric order (1:28) and process the deck once. (To \\\"process\\\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.) Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck. After each cut, process the deck once again. Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAt the end, you should return the state of the deck.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":1467,"title":"Key Generation for Solitaire Cipher","description":"The Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull:  http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher and http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck.\r\n\r\nHowever, these problems do not address the initial configuration of the deck.  One simple approach uses a key phrase, as described here:  http://programmingpraxis.com/2011/01/18/solitaire-cipher/\r\n\r\nYour job is to implement this key generator.  Begin with the cards in numeric order (1:28) and process the deck once.  (To \"process\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.)  Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck.  After each cut, process the deck once again.  Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\r\n\r\nAt the end, you should return the state of the deck.","description_html":"\u003cp\u003eThe Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull:  \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\u003c/a\u003e and \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\"\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\u003c/a\u003e.\u003c/p\u003e\u003cp\u003eHowever, these problems do not address the initial configuration of the deck.  One simple approach uses a key phrase, as described here:  \u003ca href = \"http://programmingpraxis.com/2011/01/18/solitaire-cipher/\"\u003ehttp://programmingpraxis.com/2011/01/18/solitaire-cipher/\u003c/a\u003e\u003c/p\u003e\u003cp\u003eYour job is to implement this key generator.  Begin with the cards in numeric order (1:28) and process the deck once.  (To \"process\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.)  Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck.  After each cut, process the deck once again.  Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\u003c/p\u003e\u003cp\u003eAt the end, you should return the state of the deck.\u003c/p\u003e","function_template":"function deck = solitaireKey(keyphrase)\r\n  deck = 1:28;\r\nend","test_suite":"%%\r\nx = '';\r\ny_correct = [2:28,1];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n\r\n%%\r\nx = 'SECRET KEY';\r\ny_correct = [26 25 7 8 2 13 6 16 27 4 5 19 23 21 14 15 9 3 20 11 12 28 17 18 10 1 24 22];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n\r\n%%\r\nx = 'I don''t know the key to success, but the key to failure is trying to please everybody.';\r\ny_correct = [16 10 28 4 26 25 8 27 19 24 7 1 9 21 22 23 17 11 14 15 12 13 20 5 2 3 18 6];\r\nassert(isequal(solitaireKey(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3117,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":6,"test_suite_updated_at":"2013-04-28T15:50:44.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-04-28T15:36:00.000Z","updated_at":"2013-04-28T15:50:44.000Z","published_at":"2013-04-28T15:50:44.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe Solitaire Cipher by Bruce Schneier was introduced to Cody in two problems by Doug Hull: \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/753-solitaire-cipher\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e and\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://www.mathworks.com/matlabcentral/cody/problems/766-implement-solitaire-cipher-for-n-long-deck\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eHowever, these problems do not address the initial configuration of the deck. One simple approach uses a key phrase, as described here: \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://programmingpraxis.com/2011/01/18/solitaire-cipher/\\\"\u003e\u003cw:r\u003e\u003cw:t\u003ehttp://programmingpraxis.com/2011/01/18/solitaire-cipher/\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYour job is to implement this key generator. Begin with the cards in numeric order (1:28) and process the deck once. (To \\\"process\\\" the deck you should carry out all the steps necessary to produce one character in the keystream with the regular Solitaire cipher, but you don't emit any output.) Now for each character k in the key, cut the deck by moving k cards from the front to the back of the deck. After each cut, process the deck once again. Assume that any non-alphabetic characters in the keyphrase generate a null cut (move zero characters from front to back).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAt the end, you should return the state of the deck.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"solitaire cipher\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"solitaire cipher\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"solitaire cipher\"","","\"","solitaire cipher","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f660\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fa2b427f5c0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fa2b427ed00\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f8e0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fa2b427f840\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fa2b427f7a0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fa2b427f700\u003e":"tag:\"solitaire cipher\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f700\u003e":"tag:\"solitaire cipher\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"search","password":"J3bGPZzQ7asjJcCk","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"solitaire cipher\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"solitaire cipher\"","","\"","solitaire cipher","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f660\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fa2b427f5c0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fa2b427ed00\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f8e0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fa2b427f840\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fa2b427f7a0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fa2b427f700\u003e":"tag:\"solitaire cipher\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fa2b427f700\u003e":"tag:\"solitaire cipher\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1467,"difficulty_rating":"medium"}]}}