Welcome back to my SAS Users blog series CAS Action! - a series on fundamentals. In this post, I'll show how to create user defined functions (UDFs) for the distributed CAS server using SAS and CASL code. Once the UDF is created, you can use it on the CAS server with programming
Welcome to the continuation of my series Getting Started with Python Integration to SAS Viya. In this post I'll show how to create user defined functions (UDFs) for the distributed CAS server using the SWAT package. Once the UDF is created you can use it on the CAS server with programming
By starting from a set of purely declarative statements, any zebra puzzle with limited constraints can be tagged and solved quickly in the same way without changing any code.
The Missionaries and Cannibals Problem (MCP) is a classic river-crossing logic puzzle. With SAS, we can solve this problem, visualize the solutions with SAS NETDRAW procedure and generate steps for any MCP problems.
This article introduces how to solve the pirate game with a recursive solving algorithm in SAS, and how to analyze and visualize the law behind the complex logic of the pirate game. If you join in a pirate game next time, you can know your destiny ahead of time to reap the benefits and avoid getting killed.
Dynamic programming is a powerful technique to implement algorithms, and is often used to solve complex computational problems. This article shows how to use PROC FCMP to implement the "edit distance" algorithm.
It's a simple task to use SAS to compute the number of weekdays between two dates. You can use the INTCK function with the WEEKDAY interval to come up with that number. diff = intck('WEEKDAY', start_date, end_date); If you want to compute the number of working days between two dates,
