{"id":382,"date":"2023-09-09T04:29:37","date_gmt":"2023-06-03T00:11:35","guid":{"rendered":"https:\/\/www.silicloud.com\/ja\/blog\/index.php\/2023\/11\/30\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/"},"modified":"2025-07-31T23:09:30","modified_gmt":"2025-07-31T14:09:30","slug":"java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/","title":{"rendered":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c"},"content":{"rendered":"

\u3082\u3057\u5c06\u68cb\u304c\u597d\u304d\u306a\u3089\u3001N-\u30af\u30a4\u30fc\u30f3\u554f\u984c\u3092\u5b66\u3076\u3053\u3068\u306f\u697d\u3057\u3044\u3067\u3057\u3087\u3046\u3002\u3053\u308c\u306f\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3092\u7406\u89e3\u3059\u308b\u306e\u306b\u9069\u3057\u305f\u554f\u984c\u3067\u3059\u3002<\/p>\n

\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3068\u306f\u4f55\u3067\u3059\u304b\uff1f<\/h2>\n

\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3067\u306f\u3001\u591a\u304f\u306e\u53ef\u80fd\u306a\u624b\u306e\u3046\u3061\u306e1\u3064\u304b\u3089\u59cb\u3081\u307e\u3059\u3002\u305d\u306e\u5f8c\u3001\u554f\u984c\u3092\u89e3\u6c7a\u3057\u3088\u3046\u3068\u3057\u307e\u3059\u3002<\/p>\n

\u9078\u629e\u3057\u305f\u624b\u6cd5\u3067\u554f\u984c\u3092\u89e3\u6c7a\u3067\u304d\u308b\u306a\u3089\u3001\u305d\u306e\u89e3\u7b54\u3092\u51fa\u529b\u3057\u307e\u3059\u3002\u305d\u3046\u3067\u306a\u3051\u308c\u3070\u3001\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3057\u3066\u4ed6\u306e\u624b\u6cd5\u3092\u9078\u629e\u3057\u3001\u89e3\u6c7a\u3092\u8a66\u307f\u307e\u3059\u3002<\/p>\n

\u3082\u3057\u5168\u3066\u306e\u624b\u304c\u3046\u307e\u304f\u3044\u304b\u306a\u304b\u3063\u305f\u5834\u5408\u3001\u79c1\u305f\u3061\u306f\u305d\u306e\u554f\u984c\u306b\u5bfe\u3059\u308b\u89e3\u6c7a\u7b56\u304c\u5b58\u5728\u3057\u306a\u3044\u3068\u4e3b\u5f35\u3057\u307e\u3059\u3002<\/p>\n

N-Queens Problem\u3068\u306f\u4f55\u3067\u3059\u304b\uff1f<\/h2>\n
How can N queens be placed on an NxN chessboard so that no two of them attack each other?\r\n<\/code><\/pre>\n
\u3053\u306e\u554f\u984c\u306f\u3001\u901a\u5e38\u3001N=4\u3068N=8\u306e\u5834\u5408\u306b\u3088\u304f\u898b\u3089\u308c\u307e\u3059\u3002<\/p>\n
N=4\u306e\u4f8b\u3092\u898b\u3066\u307f\u307e\u3057\u3087\u3046\u3002 (N=\u3088\u3093\u306e\u308c\u3044\u3092\u307f\u3066\u307f\u307e\u3057\u3087\u3046\u3002)<\/p>\n
\u30c1\u30a7\u30b9\u306e\u30af\u30a4\u30fc\u30f3\u306e\u52d5\u304d\u306b\u3064\u3044\u3066\u7406\u89e3\u3059\u308b\u524d\u306b\u3001\u554f\u984c\u3092\u89e3\u6c7a\u3059\u308b\u5fc5\u8981\u304c\u3042\u308a\u307e\u3059\u3002<\/p>\n
\u30af\u30a4\u30fc\u30f3\u306f\u3001\u3069\u306e\u65b9\u5411\u3067\u3082\u4f55\u6b69\u3067\u3082\u52d5\u304f\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u305f\u3060\u3057\u3001\u79fb\u52d5\u4e2d\u306b\u65b9\u5411\u3092\u5909\u3048\u308b\u3053\u3068\u306f\u3067\u304d\u307e\u305b\u3093\u3002<\/p>\n
\u30af\u30a4\u30fc\u30f3\u306e\u52d5\u304d\u3092\u898b\u308b\u3068\u3001\u660e\u3089\u304b\u306a\u3053\u3068\u306f\u4e8c\u3064\u306e\u30af\u30a4\u30fc\u30f3\u304c\u540c\u3058\u884c\u307e\u305f\u306f\u5217\u306b\u5b58\u5728\u3059\u308b\u3053\u3068\u306f\u306a\u3044\u3068\u3044\u3046\u3053\u3068\u3067\u3059\u3002<\/p>\n
\u79c1\u9054\u306f\u3001\u5404\u884c\u3068\u5404\u5217\u306b\u305d\u308c\u305e\u308c1\u3064\u306e\u30af\u30a4\u30fc\u30f3\u3092\u7f6e\u304f\u3053\u3068\u304c\u53ef\u80fd\u3067\u3059\u3002<\/p>\n
N\u304c4\u306e\u6642\u3001\u89e3\u306f\u4ee5\u4e0b\u306e\u3088\u3046\u306b\u898b\u3048\u307e\u3059\u3002<\/p>\n
\"Queen<\/div>\n
\u3057\u304b\u3057\u3001\u3053\u306e\u914d\u7f6e\u3092\u3069\u306e\u3088\u3046\u306b\u53d6\u5f97\u3057\u307e\u3059\u304b\uff1f (Shikashi, kono haichi o donoy\u014dni shutoku shimasu ka?)<\/p>\n
N-Queens\u554f\u984c\u306e\u89e3\u6c7a\u7b56<\/h2>\n
\u79c1\u305f\u3061\u304c\u3053\u306e\u554f\u984c\u3092\u89e3\u6c7a\u3057\u3088\u3046\u3068\u3059\u308b\u65b9\u6cd5\u306f\u3001\u30af\u30a4\u30fc\u30f3\u3092\u3042\u308b\u4f4d\u7f6e\u306b\u914d\u7f6e\u3057\u3066\u3001\u305d\u306e\u4f4d\u7f6e\u304c\u653b\u6483\u3055\u308c\u308b\u53ef\u80fd\u6027\u3092\u9664\u5916\u3057\u3088\u3046\u3068\u3059\u308b\u3053\u3068\u3067\u3059\u3002\u79c1\u305f\u3061\u306f\u5404\u884c\/\u5217\u306b1\u3064\u306e\u30af\u30a4\u30fc\u30f3\u3092\u914d\u7f6e\u3057\u307e\u3059\u3002<\/p>\n
\u3082\u3057\u3001\u79c1\u305f\u3061\u304c\u5973\u738b\u304c\u9078\u3093\u3060\u4f4d\u7f6e\u3067\u653b\u6483\u3092\u53d7\u3051\u3066\u3044\u308b\u3053\u3068\u3092\u898b\u3064\u3051\u305f\u5834\u5408\u3001\u79c1\u305f\u3061\u306f\u6b21\u306e\u4f4d\u7f6e\u3092\u8a66\u3057\u3066\u307f\u307e\u3059\u3002<\/p>\n
\u30af\u30a4\u30fc\u30f3\u304c\u3059\u3079\u3066\u306e\u4f4d\u7f6e\u3067\u653b\u6483\u3055\u308c\u3066\u3044\u308b\u5834\u5408\u3001\u79c1\u305f\u3061\u306f\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3057\u3001\u73fe\u5728\u306e\u4f4d\u7f6e\u3088\u308a\u524d\u306b\u914d\u7f6e\u3055\u308c\u305f\u30af\u30a4\u30fc\u30f3\u306e\u4f4d\u7f6e\u3092\u5909\u66f4\u3057\u307e\u3059\u3002<\/p>\n
\u79c1\u305f\u3061\u306f\u3001\u30af\u30a4\u30fc\u30f3\u3092\u914d\u7f6e\u3057\u3001\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3059\u308b\u3068\u3044\u3046\u30d7\u30ed\u30bb\u30b9\u3092\u3001N\u500b\u306e\u30af\u30a4\u30fc\u30f3\u304c\u3059\u3079\u3066\u6b63\u5e38\u306b\u914d\u7f6e\u3055\u308c\u308b\u307e\u3067\u7e70\u308a\u8fd4\u3057\u307e\u3059\u3002<\/p>\n
\u4ee5\u4e0b\u306e\u3088\u3046\u306b\u3001\u30b9\u30c6\u30c3\u30d7\u30d0\u30a4\u30b9\u30c6\u30c3\u30d7\u306e\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u304c\u8868\u793a\u3055\u308c\u307e\u3059\u3002<\/p>\n
\"Queen<\/div>\n
\u30af\u30a4\u30fc\u30f3\u306b\u3088\u3063\u3066\u653b\u6483\u3055\u308c\u3066\u3044\u308b\u4f4d\u7f6e\u306b\u8d64\u3044\u5341\u5b57\u5370\u304c\u3064\u3044\u3066\u3044\u307e\u3059\u3002\u30af\u30a4\u30fc\u30f3\u3092\u914d\u7f6e\u3059\u308b\u5834\u6240\u304c\u5fc5\u8981\u3067\u3059\u304c\u3001\u884c\u5168\u4f53\u304c\u653b\u6483\u3055\u308c\u3066\u3044\u308b\u72b6\u614b\u306b\u306a\u3063\u305f\u3089\u3001\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3057\u307e\u3059\u3002<\/p>\n
\u3053\u306e\u554f\u984c\u3078\u306e\u552f\u4e00\u306e\u89e3\u6c7a\u7b56\u3067\u306f\u3042\u308a\u307e\u305b\u3093\u3002\u3082\u3057\u30af\u30a4\u30fc\u30f3\u3092\u6642\u8a08\u56de\u308a\u306b\u4e00\u6b69\u305a\u3064\u52d5\u304b\u3059\u3068\u3001\u5225\u306e\u89e3\u304c\u5f97\u3089\u308c\u307e\u3059\u3002<\/p>\n
\"Queen<\/div>\n
\u3053\u306e\u4f8b\u3067\u306f\u3001\u79c1\u305f\u3061\u306f\u30af\u30a4\u30fc\u30f3\u3092\u884c\u306b\u914d\u7f6e\u3057\u307e\u3057\u305f\u304c\u3001\u540c\u69d8\u306e\u3053\u3068\u3092\u5217\u306b\u95a2\u3057\u3066\u3082\u884c\u3046\u3053\u3068\u304c\u3067\u304d\u307e\u3059\u3002\u305d\u306e\u5834\u5408\u3001\u5404\u30af\u30a4\u30fc\u30f3\u306f\u5217\u306b\u5c5e\u3059\u308b\u3053\u3068\u306b\u306a\u308a\u307e\u3059\u3002<\/p>\n
C++\u3068Java\u306b\u304a\u3051\u308bN-Queens\u554f\u984c\u306e\u5b9f\u88c5<\/h3>\n
C++\u306b\u304a\u3044\u3066N-Queens\u554f\u984c\u3092\u5b9f\u88c5\u3059\u308b\u3002<\/p>\n
#<\/span>define<\/span> N<\/span> 4<\/span> <\/span><\/span>\r\n#<\/span>include<\/span> <stdbool.h><\/span> <\/span>\r\n#<\/span>include<\/span> <stdio.h><\/span> <\/span>\r\n\/\/function to print the solution<\/span>\r\nvoid<\/span> printSolution<\/span>(<\/span>int<\/span> board[<\/span>N]<\/span>[<\/span>N]<\/span>)<\/span> \r\n{<\/span> \r\n    for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N;<\/span> i++<\/span>)<\/span> {<\/span> \r\n        for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> N;<\/span> j++<\/span>)<\/span> \r\n            printf<\/span>(<\/span>\" %d \"<\/span>,<\/span> board[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span>;<\/span> \r\n        printf<\/span>(<\/span>\"\\n\"<\/span>)<\/span>;<\/span> \r\n    }<\/span> \r\n}<\/span> \r\n\r\n \/\/ function to check whether the position is safe or not <\/span>\r\nbool<\/span> isSafe<\/span>(<\/span>int<\/span> board[<\/span>N]<\/span>[<\/span>N]<\/span>,<\/span> int<\/span> row,<\/span> int<\/span> col)<\/span> \r\n{<\/span> \r\n    int<\/span> i,<\/span> j;<\/span> \r\n    for<\/span> (<\/span>i =<\/span> 0<\/span>;<\/span> i <<\/span> col;<\/span> i++<\/span>)<\/span> \r\n        if<\/span> (<\/span>board[<\/span>row]<\/span>[<\/span>i]<\/span>)<\/span> \r\n            return<\/span> false<\/span>;<\/span> \r\n\r\n    for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> i >=<\/span> 0<\/span> &&<\/span> j >=<\/span> 0<\/span>;<\/span> i--<\/span>,<\/span> j--<\/span>)<\/span> \r\n        if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span> \r\n            return<\/span> false<\/span>;<\/span> \r\n    for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> j >=<\/span> 0<\/span> &&<\/span> i <<\/span> N;<\/span> i++<\/span>,<\/span> j--<\/span>)<\/span> \r\n        if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span>)<\/span> \r\n            return<\/span> false<\/span>;<\/span> \r\n  \r\n    return<\/span> true<\/span>;<\/span> \r\n}<\/span> \r\n\r\n\/\/ The function that solves the problem using backtracking <\/span>\r\nbool<\/span> solveNQUtil<\/span>(<\/span>int<\/span> board[<\/span>N]<\/span>[<\/span>N]<\/span>,<\/span> int<\/span> col)<\/span> \r\n{<\/span> \r\n    if<\/span> (<\/span>col >=<\/span> N)<\/span> \r\n        return<\/span> true<\/span>;<\/span> \r\n  \r\n   \r\n    for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N;<\/span> i++<\/span>)<\/span> {<\/span> \r\n       \/\/if it is safe to place the queen at position i,col -> place it<\/span>\r\n        if<\/span> (<\/span>isSafe<\/span>(<\/span>board,<\/span> i,<\/span> col)<\/span>)<\/span> {<\/span> \r\n         \r\n            board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 1<\/span>;<\/span> \r\n  \r\n         \r\n            if<\/span> (<\/span>solveNQUtil<\/span>(<\/span>board,<\/span> col +<\/span> 1<\/span>)<\/span>)<\/span> \r\n                return<\/span> true<\/span>;<\/span> \r\n\r\n  \/\/backtrack if the above condition is false<\/span>\r\n            board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 0<\/span>;<\/span> \/\/ BACKTRACK <\/span>\r\n        }<\/span> \r\n    }<\/span> \r\n  \r\n   \r\n    return<\/span> false<\/span>;<\/span> \r\n}<\/span> \r\n\r\n\/\/ driver program to test above function <\/span>\r\nint<\/span> main<\/span>(<\/span>)<\/span> \r\n{<\/span> \r\n     int<\/span> board[<\/span>N]<\/span>[<\/span>N]<\/span> =<\/span> {<\/span> {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span> \r\n                        {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span> \r\n                        {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span> \r\n                        {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span> }<\/span>;<\/span> \r\n  \r\n    if<\/span> (<\/span>solveNQUtil<\/span>(<\/span>board,<\/span> 0<\/span>)<\/span> ==<\/span> false<\/span>)<\/span> {<\/span> \r\n        printf<\/span>(<\/span>\"Solution does not exist\"<\/span>)<\/span>;<\/span> \r\n        return<\/span> 0<\/span>;<\/span> \r\n    }<\/span> \r\n  \r\n    printSolution<\/span>(<\/span>board)<\/span>;<\/span> \r\n    return<\/span> true<\/span>;<\/span> \r\n    return<\/span> 0<\/span>;<\/span> \r\n}<\/span> \r\n<\/code><\/pre>\n
Java\u3067N-queens\u554f\u984c\u306e\u5b9f\u88c5<\/p>\n
package<\/span> com.<\/span><\/span>JournalDev<\/span>;<\/span>\r\npublic<\/span> class<\/span> Main<\/span> {<\/span>\r\n    static<\/span> final<\/span> int<\/span> N<\/span> =<\/span> 4<\/span>;<\/span>\r\n\r\n   \/\/ print the final solution matrix <\/span>\r\n    static<\/span> void<\/span> printSolution<\/span>(<\/span>int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span>)<\/span>\r\n    {<\/span>\r\n        for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>\r\n            for<\/span> (<\/span>int<\/span> j =<\/span> 0<\/span>;<\/span> j <<\/span> N<\/span>;<\/span> j++<\/span>)<\/span>\r\n                System<\/span>.<\/span>out.<\/span>print<\/span>(<\/span>\" \"<\/span> +<\/span> board[<\/span>i]<\/span>[<\/span>j]<\/span>\r\n                        +<\/span> \" \"<\/span>)<\/span>;<\/span>\r\n            System<\/span>.<\/span>out.<\/span>println<\/span>(<\/span>)<\/span>;<\/span>\r\n        }<\/span>\r\n    }<\/span>\r\n\r\n    \/\/ function to check whether the position is safe or not <\/span>\r\n    static<\/span> boolean<\/span> isSafe<\/span>(<\/span>int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span>,<\/span> int<\/span> row,<\/span> int<\/span> col)<\/span>\r\n    {<\/span>\r\n        int<\/span> i,<\/span> j;<\/span>\r\n        for<\/span> (<\/span>i =<\/span> 0<\/span>;<\/span> i <<\/span> col;<\/span> i++<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>row]<\/span>[<\/span>i]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n\r\n       \r\n        for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> i >=<\/span> 0<\/span> &&<\/span> j >=<\/span> 0<\/span>;<\/span> i--<\/span>,<\/span> j--<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n            \r\n        for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> j >=<\/span> 0<\/span> &&<\/span> i <<\/span> N<\/span>;<\/span> i++<\/span>,<\/span> j--<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n\r\n        return<\/span> true<\/span>;<\/span>\r\n    }<\/span>\r\n\r\n    \/\/ The function that solves the problem using backtracking <\/span>\r\n    public<\/span> static<\/span> boolean<\/span> solveNQueen<\/span>(<\/span>int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span>,<\/span> int<\/span> col)<\/span>\r\n    {<\/span>\r\n        if<\/span> (<\/span>col >=<\/span> N<\/span>)<\/span>\r\n            return<\/span> true<\/span>;<\/span>\r\n\r\n        for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>\r\n            \/\/if it is safe to place the queen at position i,col -> place it<\/span>\r\n            if<\/span> (<\/span>isSafe<\/span>(<\/span>board,<\/span> i,<\/span> col)<\/span>)<\/span> {<\/span>\r\n                board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 1<\/span>;<\/span>\r\n\r\n                if<\/span> (<\/span>solveNQueen<\/span>(<\/span>board,<\/span> col +<\/span> 1<\/span>)<\/span>)<\/span>\r\n                    return<\/span> true<\/span>;<\/span>\r\n\r\n                \/\/backtrack if the above condition is false<\/span>\r\n                board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 0<\/span>;<\/span>\r\n            }<\/span>\r\n        }<\/span>\r\n        return<\/span> false<\/span>;<\/span>\r\n    }<\/span>\r\n\r\n    public<\/span> static<\/span> void<\/span> main<\/span>(<\/span>String<\/span> args[<\/span>]<\/span>)<\/span>\r\n    {<\/span>\r\n        int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span> =<\/span> {<\/span> {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span>\r\n                {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span>\r\n                {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span>,<\/span>\r\n                {<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span>,<\/span> 0<\/span> }<\/span> }<\/span>;<\/span>\r\n\r\n        if<\/span> (<\/span>!<\/span>solveNQueen<\/span>(<\/span>board,<\/span> 0<\/span>)<\/span>)<\/span> {<\/span>\r\n            System<\/span>.<\/span>out.<\/span>print<\/span>(<\/span>\"Solution does not exist\"<\/span>)<\/span>;<\/span>\r\n            return<\/span>;<\/span>\r\n        }<\/span>\r\n\r\n        printSolution<\/span>(<\/span>board)<\/span>;<\/span>\r\n       \r\n    }<\/span>\r\n}<\/span> \r\n\r\n<\/code><\/pre>\n
Output : \r\n0  0  1  0 \r\n1  0  0  0 \r\n0  0  0  1 \r\n0  1  0  0 \r\n<\/code><\/pre>\n
\"Queen<\/div>\n
N\u304c8\u306e\u5834\u5408\u3001\u51fa\u529b\u306f\u4ee5\u4e0b\u306e\u901a\u308a\u3067\u3059\u3002<\/p>\n
 1  0  0  0  0  0  0  0 \r\n 0  0  0  0  0  0  1  0 \r\n 0  0  0  0  1  0  0  0 \r\n 0  0  0  0  0  0  0  1 \r\n 0  1  0  0  0  0  0  0 \r\n 0  0  0  1  0  0  0  0 \r\n 0  0  0  0  0  1  0  0 \r\n 0  0  1  0  0  0  0  0\r\n<\/code><\/pre>\n
\"Queen<\/div>\n
\u30b3\u30fc\u30c9\u306e\u5b9f\u88c5\u3092\u7406\u89e3\u3059\u308b<\/h3>\n
\u653b\u6483\u306e\u5bfe\u8c61\u3067\u3042\u308b\u304b\u3069\u3046\u304b\u3092\u78ba\u8a8d\u3059\u308b\u305f\u3081\u306b\u3001\u79c1\u305f\u3061\u306fisSafe\u3068\u3044\u3046\u95a2\u6570\u3092\u4f5c\u6210\u3057\u307e\u3057\u305f\u3002<\/p>\n
\u305d\u306e\u95a2\u6570\u306f\u3001\u3044\u304b\u306a\u308b\u653b\u6483\u304b\u3089\u3082\u5b89\u5168\u306a\u4f4d\u7f6e\u3067\u3042\u308c\u3070\u3001true\u3092\u8fd4\u3057\u307e\u3059\u3002<\/p>\n
 static<\/span> boolean<\/span> isSafe<\/span>(<\/span>int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span>,<\/span> int<\/span> row,<\/span> int<\/span> col)<\/span>\r\n    {<\/span>\r\n        int<\/span> i,<\/span> j;<\/span>\r\n        for<\/span> (<\/span>i =<\/span> 0<\/span>;<\/span> i <<\/span> col;<\/span> i++<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>row]<\/span>[<\/span>i]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n\r\n        for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> i >=<\/span> 0<\/span> &&<\/span> j >=<\/span> 0<\/span>;<\/span> i--<\/span>,<\/span> j--<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n            \r\n        for<\/span> (<\/span>i =<\/span> row,<\/span> j =<\/span> col;<\/span> j >=<\/span> 0<\/span> &&<\/span> i <<\/span> N<\/span>;<\/span> i++<\/span>,<\/span> j--<\/span>)<\/span>\r\n            if<\/span> (<\/span>board[<\/span>i]<\/span>[<\/span>j]<\/span> ==<\/span> 1<\/span>)<\/span>\r\n                return<\/span> false<\/span>;<\/span>\r\n\r\n        return<\/span> true<\/span>;<\/span>\r\n    }<\/span>\r\n<\/code><\/pre>\n
\u6700\u521d\u306efor\u30eb\u30fc\u30d7\u306f\u5217\u3092\u30c1\u30a7\u30c3\u30af\u3057\u307e\u3059\u30022\u756a\u76ee\u30683\u756a\u76ee\u306efor\u30eb\u30fc\u30d7\u306f2\u3064\u306e\u5bfe\u89d2\u7dda\u3092\u30c1\u30a7\u30c3\u30af\u3057\u307e\u3059\u3002<\/p>\n
\u6b21\u306e\u30b3\u30fc\u30c9\u306f\u3001\u30af\u30a4\u30fc\u30f3\u3092\u914d\u7f6e\u3057\u3066\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3059\u308b\u8cac\u4efb\u3092\u6301\u3061\u307e\u3059\u3002\u30af\u30a4\u30fc\u30f3\u306e\u4f4d\u7f6e\u3092\u30de\u30fc\u30af\u3059\u308b\u305f\u3081\u306b\u3001\u305d\u306e\u30bb\u30eb\u3092\u884c\u5217\u5185\u306e1\u3068\u3057\u3066\u8a2d\u5b9a\u3057\u307e\u3059\u3002\u30af\u30a4\u30fc\u30f3\u3092\u914d\u7f6e\u3059\u308b\u524d\u306b\u3001\u4f4d\u7f6e\u304c\u5b89\u5168\u3067\u3042\u308b\u3053\u3068\u3092\u78ba\u8a8d\u3059\u308b\u305f\u3081\u306bisSafe\u3092\u547c\u3073\u51fa\u3057\u307e\u3059\u3002<\/p>\n
public<\/span> static<\/span> boolean<\/span> solveNQueen<\/span>(<\/span>int<\/span> board[<\/span>]<\/span>[<\/span>]<\/span>,<\/span> int<\/span> col)<\/span>\r\n    {<\/span>\r\n        if<\/span> (<\/span>col >=<\/span> N<\/span>)<\/span>\r\n            return<\/span> true<\/span>;<\/span>\r\n\r\n        for<\/span> (<\/span>int<\/span> i =<\/span> 0<\/span>;<\/span> i <<\/span> N<\/span>;<\/span> i++<\/span>)<\/span> {<\/span>\r\n            \/\/if it is safe to place the queen at position i,col -> place it<\/span>\r\n            if<\/span> (<\/span>isSafe<\/span>(<\/span>board,<\/span> i,<\/span> col)<\/span>)<\/span> {<\/span>\r\n                board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 1<\/span>;<\/span>\r\n\r\n                if<\/span> (<\/span>solveNQueen<\/span>(<\/span>board,<\/span> col +<\/span> 1<\/span>)<\/span>)<\/span>\r\n                    return<\/span> true<\/span>;<\/span>\r\n\r\n                \/\/backtrack if the above condition is false<\/span>\r\n                board[<\/span>i]<\/span>[<\/span>col]<\/span> =<\/span> 0<\/span>;<\/span>\r\n            }<\/span>\r\n        }<\/span>\r\n        return<\/span> false<\/span>;<\/span>\r\n    }<\/span>\r\n<\/code><\/pre>\n
\u518d\u5e30\u547c\u3073\u51fa\u3057\u306f\u30dc\u30fc\u30c9\u3092\u6e21\u3057\u3001\u30ab\u30e9\u30e0\u3092 col+1 \u306b\u8a2d\u5b9a\u3057\u307e\u3059\u3002\u518d\u5e30\u547c\u3073\u51fa\u3057\u304c false \u3092\u8fd4\u3057\u305f\u5834\u5408\u3001\u30a8\u30f3\u30c8\u30ea\u30920\u306b\u30ea\u30bb\u30c3\u30c8\u3057\u3066\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3057\u307e\u3059\u3002<\/p>\n
\u7d50\u8ad6<\/h2>\n
\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u3066N-Queen\u306e\u554f\u984c\u3092\u89e3\u304f\u65b9\u6cd5\u306f\u6b21\u306e\u3068\u304a\u308a\u3067\u3059\u3002\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u306b\u3064\u3044\u3066\u3082\u3063\u3068\u5b66\u3076\u305f\u3081\u306b\u306f\u3001\u6570\u72ec\u306e\u554f\u984c\u3092\u89e3\u304f\u3053\u3068\u3092\u8a66\u3057\u3066\u307f\u3066\u304f\u3060\u3055\u3044\u3002<\/p>\n","protected":false},"excerpt":{"rendered":"
\u3082\u3057\u5c06\u68cb\u304c\u597d\u304d\u306a\u3089\u3001N-\u30af\u30a4\u30fc\u30f3\u554f\u984c\u3092\u5b66\u3076\u3053\u3068\u306f\u697d\u3057\u3044\u3067\u3057\u3087\u3046\u3002\u3053\u308c\u306f\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30af\u3092\u7406\u89e3\u3059\u308b\u306e\u306b\u9069\u3057\u305f\u554f\u984c\u3067\u3059\u3002 \u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3068\u306f\u4f55\u3067\u3059\u304b\uff1f \u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3067\u306f\u3001\u591a\u304f\u306e\u53ef\u80fd\u306a\u624b\u306e\u3046\u3061\u306e1\u3064\u304b\u3089\u59cb\u3081\u307e\u3059\u3002\u305d\u306e\u5f8c […]<\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[26,61],"class_list":["post-382","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-26","tag-61"],"yoast_head":"\nJava\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c - Blog - Silicon Cloud<\/title>\n<meta name=\"description\" content=\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/ja\/blog\/java-c\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fn-queens\u554f\u984c\/\" \/>\n<meta property=\"og:locale\" content=\"ja_JP\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\" \/>\n<meta property=\"og:description\" content=\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/ja\/blog\/java-c\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fn-queens\u554f\u984c\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:published_time\" content=\"2023-06-03T00:11:35+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-07-31T14:09:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/cdn.silicloud.com\/blog-img\/blog\/img\/65648a26daa94e2bdf7bb797\/14-0.png\" \/>\n<meta name=\"author\" content=\"\u685c, \u6625\u6a39\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u57f7\u7b46\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"\u685c, \u6625\u6a39\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593\" \/>\n\t<meta name=\"twitter:data2\" content=\"12\u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/\",\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/\",\"name\":\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#website\"},\"datePublished\":\"2023-06-03T00:11:35+00:00\",\"dateModified\":\"2025-07-31T14:09:30+00:00\",\"author\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/ff22288af1a5455571aff7586b0fb341\"},\"description\":\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#breadcrumb\"},\"inLanguage\":\"ja\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.silicloud.com\/ja\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/\",\"name\":\"Blog - Silicon Cloud\",\"description\":\"\",\"inLanguage\":\"ja\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/ff22288af1a5455571aff7586b0fb341\",\"name\":\"\u685c, \u6625\u6a39\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"ja\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/cee48863f3d4fd7fef222498f3e71b82312aee42b7257a2dbde56394ca4e19de?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/cee48863f3d4fd7fef222498f3e71b82312aee42b7257a2dbde56394ca4e19de?s=96&d=mm&r=g\",\"caption\":\"\u685c, \u6625\u6a39\"},\"url\":\"https:\/\/www.silicloud.com\/ja\/blog\/author\/sakuraharuki\/\"},{\"@type\":\"ImageObject\",\"inLanguage\":\"ja\",\"@id\":\"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#local-main-organization-logo\",\"url\":\"\",\"contentUrl\":\"\",\"caption\":\"Blog - Silicon Cloud\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c - Blog - Silicon Cloud","description":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.silicloud.com\/ja\/blog\/java-c\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fn-queens\u554f\u984c\/","og_locale":"ja_JP","og_type":"article","og_title":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c","og_description":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","og_url":"https:\/\/www.silicloud.com\/ja\/blog\/java-c\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fn-queens\u554f\u984c\/","og_site_name":"Blog - Silicon Cloud","article_published_time":"2023-06-03T00:11:35+00:00","article_modified_time":"2025-07-31T14:09:30+00:00","og_image":[{"url":"https:\/\/cdn.silicloud.com\/blog-img\/blog\/img\/65648a26daa94e2bdf7bb797\/14-0.png"}],"author":"\u685c, \u6625\u6a39","twitter_card":"summary_large_image","twitter_misc":{"\u57f7\u7b46\u8005":"\u685c, \u6625\u6a39","\u63a8\u5b9a\u8aad\u307f\u53d6\u308a\u6642\u9593":"12\u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/","url":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/","name":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/#website"},"datePublished":"2023-06-03T00:11:35+00:00","dateModified":"2025-07-31T14:09:30+00:00","author":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/ff22288af1a5455571aff7586b0fb341"},"description":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c\u3092\u5206\u304b\u308a\u3084\u3059\u304f\u89e3\u8aac\u3002\u5b9f\u8df5\u7684\u306a\u4f8b\u3068\u30b3\u30fc\u30c9\u3001\u6ce8\u610f\u70b9\u3092\u542b\u3081\u3066\u521d\u5fc3\u8005\u306b\u3082\u7406\u89e3\u3067\u304d\u308b\u3088\u3046\u8aac\u660e\u3057\u307e\u3059\u3002","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#breadcrumb"},"inLanguage":"ja","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.silicloud.com\/ja\/blog\/"},{"@type":"ListItem","position":2,"name":"Java\/C++\u3067\u30d0\u30c3\u30af\u30c8\u30e9\u30c3\u30ad\u30f3\u30b0\u3092\u4f7f\u7528\u3057\u305fN-Queens\u554f\u984c"}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#website","url":"https:\/\/www.silicloud.com\/ja\/blog\/","name":"Blog - Silicon Cloud","description":"","inLanguage":"ja"},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/ff22288af1a5455571aff7586b0fb341","name":"\u685c, \u6625\u6a39","image":{"@type":"ImageObject","inLanguage":"ja","@id":"https:\/\/www.silicloud.com\/ja\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/cee48863f3d4fd7fef222498f3e71b82312aee42b7257a2dbde56394ca4e19de?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/cee48863f3d4fd7fef222498f3e71b82312aee42b7257a2dbde56394ca4e19de?s=96&d=mm&r=g","caption":"\u685c, \u6625\u6a39"},"url":"https:\/\/www.silicloud.com\/ja\/blog\/author\/sakuraharuki\/"},{"@type":"ImageObject","inLanguage":"ja","@id":"https:\/\/www.silicloud.com\/ja\/blog\/java-c%e3%81%a7%e3%83%90%e3%83%83%e3%82%af%e3%83%88%e3%83%a9%e3%83%83%e3%82%ad%e3%83%b3%e3%82%b0%e3%82%92%e4%bd%bf%e7%94%a8%e3%81%97%e3%81%9fn-queens%e5%95%8f%e9%a1%8c\/#local-main-organization-logo","url":"","contentUrl":"","caption":"Blog - Silicon Cloud"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/382","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/comments?post=382"}],"version-history":[{"count":1,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/382\/revisions"}],"predecessor-version":[{"id":39879,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/posts\/382\/revisions\/39879"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/media?parent=382"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/categories?post=382"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/ja\/blog\/wp-json\/wp\/v2\/tags?post=382"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}